2 - Sieve Methods
Published online by Cambridge University Press: 05 June 2012
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Enumerative Combinatorics , pp. 195 - 240Publisher: Cambridge University PressPrint publication year: 2011
References
[2] , PIE-sums: A combinatorial tool for partition theory, J. Combinatorial Theory, Ser. A 31 (1981), 223–236.Google Scholar
[5] and , On the rook polynomials of Ferrers relations, Colloquia Mathematica Societatis Jano Bolyai, 4, Combinatorial Theory and ItsApplications, vol. 2 (, , and , eds.), North-Holland, Amsterdam, 1970, pp. 413–436.Google Scholar
[6] and , A Rogers-Ramanujan bijection, J. Combinatorial Theory, Ser. A 31 (1981), 289–339.Google Scholar
[7] and , Binomial determinants, paths, and hook-length formulas, Advances in Math. 58 (1985), 300–321.Google Scholar
[8] , , and , Rook theory I: Rook equivalence of Ferrers boards, Proc. Amer. Math. Soc. 52 (1975), 485–492.Google Scholar
[9] , , and , Rook polynomials, Möbius inversion, and the umbral calculus, J. Combinatorial Theory, Ser. A 21 (1976), 230–239.Google Scholar
[10] , , and , Rook theory IV: Orthogonal sequences of rook polynomials, Studies in Applied Math. 56 (1977), 267–272.Google Scholar
[11] , , and , Rook theory III: Rook polynomials and the chromatic structure of graphs, J. Combinatorial Theory Ser. B 25 (1978), 135–142.Google Scholar
[12] , Sieve-equivalence and explicit bijections, J. Combinatorial Theory Ser. A 34 (1983), 90–93.Google Scholar
[13] and , The problem of the rooks and its applications, Duke Math. J. 13 (1946), 259–268.Google Scholar
[15] , On the vector representation of induced matroids, Bull. London Math. Soc. 5 (1973), 85–90.Google Scholar
[16] , Bijective proofs of some classical partition identities, J. Combinatorial Theory Ser. A 33 (1982), 273–286.Google Scholar
[18] , Bruhat intervals as rooks on skew Ferrers boards, J. Combinatorial Theory Ser. A 114 (2007), 1182–1198.Google Scholar
[19] , Ordered structures and partitions, Ph.D. thesis, Harvard University, 1971.
[20] , Ordered structures and partitions, Mem. Amer. Math. Soc. 119 (1972), iii+104 pages.Google Scholar
[21] , Binomial posets, Möbius inversion, and permutation enumeration, J. Combinatorial Theory 20 (1976), 336–356.Google Scholar
[22] , On the method of inclusion and exclusion, J. Amer. Stat. Soc. 62 (1967), 102–113.Google Scholar
[23] , Sieve-equivalence in generalized partition theory, J. Combinatorial Theory, Ser. A 34 (1983), 80–89.Google Scholar
[24] , Garsia and Milne's bijective proof of the inclusion-exclusion principle, Discrete Math. 51 (1984), 109–110.Google Scholar