## Combinatorics: Theory and Applications |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

GENERATING FUNCTIONS AND RECURRENCE RELATIONS | 29 |

SYMMETRIC FUNCTIONS | 52 |

MULTINOMIALS | 66 |

Copyright | |

20 other sections not shown

### Other editions - View all

### Common terms and phrases

algebra algorithm alſ antichain bijection blocks boxes Burnside's lemma called character table chess board circular word coefficient colours column strict combinatorial computation conjugacy class construction corresponding counting series cycle index cycle structure defined Definition denoted Diagram distinct double coset elements entries equal equivalent Example exists Ferrers graph finite formula g e G generalised given gives graph Hadamard matrix Hence II-5 MF Illustration insertion inventory inverse irreducible lattice Lemma matrix Mobius Mobius function MOLS of order multiple edges n-set necklace non-zero notation objects obtained pairs permutation group Plethysm Polya's theorem polynomial poset positive integer PROBLEM SET Proof Prop Proposition prove Q-symbol Recall recurrence relation representation result RSK-theorem Schur functions sequence subgroup subset symbols symmetric functions symmetric group tableau tion total number vertices weight zero