## Combinatorial theory, Part 1 |

### What people are saying - Write a review

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

### Contents

PERMUTATIONS AND COMBINATIONS | 1 |

INVERSION FORMULAE | 8 |

GENERATING FUNCTIONS AND RECURSIONS | 19 |

Copyright | |

13 other sections not shown

### Other editions - View all

### Common terms and phrases

_ mz _ rot arcs automorphism block design Bruck-Ryser-Chowla theorem choice classes coefficients column complete cycles condition construct contains convex cone copositive corresponding cyclic define deletion difference set distinct representatives equation equivalent exactly once exists finite field GF(pn given gives H matrix Hadamard Hadamard matrix Hence hyperplane incidence matrix integers l(mod Latin squares Lemma matrix of order Mobius function multiplier mutually orthogonal nonnegative nonzero number of solutions objects ordered pairs parameters partially ordered set permutation permutation matrix points polynomial primitive root problem Proof qn+x quadratic forms quadratic residues Ramsey's theorem rational recursion relation residues modulo satisfying squares of order Steiner triple system subsets suppose symmetric design unique values vector whence write yields zero