1 - What Is Enumerative Combinatorics?
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. 1 - 194Publisher: Cambridge University PressPrint publication year: 2011
References
[1] , Développement de sec x and tg x, C. R. Math. Acad. Sci. Paris 88 (1879), 965–979.Google Scholar
[3] , ed., Percy Alexander MacMahon, Collected Papers, vol. 1, M.I.T. Press, Cambridge, Mass. 1978.Google Scholar
[5] , A lifting theorem for formal power series, Proc. Amer. Math. Soc. 42 (1974), 16–22.Google Scholar
[6] , Asymptotic methods in enumeration, SIAM Review 16 (1974), 485–515. Errata, SIAM Review18 (1976), 292.Google Scholar
[7] , On Buckheister's enumeration of n × n matrices, J. Combinatorial Theory, Ser. A 17 (1974), 273–274.Google Scholar
[9] and , q-Hook length formulas for forests, J. Combinatorial Theory Ser. A 52 (1989), 165–187.Google Scholar
[10] , A combinatorial proof of a result of Hetyei and Reiner on Foata-Strehl type permutation trees, Ann. Combinatorics 1 (1997), 119–122.Google Scholar
[12] , Éléments de Mathématique, Livre II, Algèbre, Ch. 4–5, 2e ed., Hermann, Paris, 1959.Google Scholar
[14] , The number of n × n matrices of rank r and trace α over a finite field, Duke Math. J. 39 (1972), 695–699.Google Scholar
[15] , , , and , Juggling drops and descents, Amer. Math. Monthly 101 (1994), 507–519.Google Scholar
[18] and , Classification of bijections between 321-and 132-avoiding permutations, Sém. Lothar. Combinatoire 60 (2008), B60d.Google Scholar
[19] , Une code pour les graphes planaires et ses applications, Astérisque, no. 27, Société Mathématique de France, Paris, 1975.Google Scholar
[20] , Alternating permutations and binary increasing trees, J. Combinatorial Theory Ser. A 18 (1975), 141–148.Google Scholar
[21] , Morse theory for convex polytopes, unpublished manuscript, 1985.
[24] , On the Netto inversion number of a sequence, Proc. Amer. Math. Soc. 19 (1968), 236–240.Google Scholar
[25] , Distributions eulériennes et mahoniennes sur le groupe des permutations, in Higher Combinatorics (Proc. NATO Advanced Study Inst., Berlin, 1976), Reidel, Dordrecht-Boston, Mass., 1977, pp. 27–49.Google Scholar
[26] and , Théorie géométrique des polynômes Eulériens, Lecture Notes in Math., no. 138, Springer, Berlin, 1970.Google Scholar
[27] and , Nombres d'Euler et permutations alternantes, in A Survey of Combinatorial Theory ( et al., eds.), North-Holland, Amsterdam, 1973, pp. 173–187.Google Scholar
[28] and , Major index and inversion number of permutations, Math. Machr. 83 (1978), 143–159.Google Scholar
[29] and , Euler numbers and variations of permutations, in Colloquio Internazionale sulle Teorie Combinatorie (Roma, 1973), Tomo I, Atti dei Convegni Lincei, No. 17, Accad. Naz. Lincei, Rome, 1976, pp. 119–131.Google Scholar
[30] and , Rearrangements of the symmetric group and enumerative properties of the tangent and secant numbers, Math. Z. 137 (1974), 257–264.Google Scholar
[31] , Random matrix theory over finite fields, Bull. Amer. Math. Soc. (N.S.) 39 (2002), 51–85.Google Scholar
[33] , Mathematical games, Scientific American 238 (May 1978), 24–30; reprinted (with an addendum) in Fractal Music, Hypercards, and More, Freeman, New York, 1992, pp. 24–38.Google Scholar
[35] , The characters of the finite general linear groups, Trans. Amer. Math. Soc. 80 (1955), 402–447.Google Scholar
[36] , Abelian p-groups and related modules, unpublished manuscript.
[37] , A partition formula connected with Abelian groups, Comm. Math. Helv. 11 (1938/39), 126–129.Google Scholar
[38] , A few seedlings of research, in Proc. Sixth Berkeley Symposium on Mathematical Statistics and Probability (Berkeley, 1970/1971), Vol. 1: Theory of statistics, Univ. California Press, Berkeley, Calif., 1972, pp. 345–394.Google Scholar
[39] and , Asymptotic formulae in combinatory analysis, Proc. London Math. Soc. (2) 17 (1918), 75–117. Also in Collected Papers of S. Ramanunan, Cambridge University Press, London and New York, 1927; reprinted by Chelsea, New York, 1962.Google Scholar
[41] and , Permutations trees and variation statistics, European J. Combinatorics 19 (1998), 847–866.Google Scholar
[42] and , Combinatorics and Compositions on Words, Chapman and Hall/CRC, Boca Raton, 2010.Google Scholar
[43] , Lectures in Abstract Algebra, vol. II–Linear Algebra, D. van Nostrand Co., Princeton, N.J., 1953.Google Scholar
[44] , Review of Mathematics and Social Utopias in France: Olinde Rodrigues and His Times, Amer. Math. Monthly 114 (2007), 752–758.Google Scholar
[48] , The Art of Computer Programming, vol. 3, Sorting and Searching. Addison-Wesley, Reading, Mass., 1973; 2nd ed., 1998.Google Scholar
[49] , The Art of Computer Programming, vol. 4, Fascicle 4, Addison-Wesley, Upper Saddle River, N.J., 2006.Google Scholar
[50] , The cycle structure of a linear transformation over a finite field, Linear Algebra Appl. 36 (1981), 141–155.Google Scholar
[51] , , and , Increasing trees and alternating permutations, Russian Math. Surveys 49:6 (1994), 79–114; translated from Uspekhi Mat. Nauk49:6 (1994), 79–110.Google Scholar
[52] , Second memoir on the compositions of integers, Phil. Trans. 207 (1908), 65–134; reprinted in [1.3], pp. 687–756.Google Scholar
[53] , The indices of permutations and the derivation therefrom of functions of a single variable associated with the permutations of any assemblage of objects, Amer. J. Math. 35 (1913), 281–322; reprinted in [1.3], pp. 508–549.Google Scholar
[54] , Two applications of general theorems in combinatory analysis: (1) to the theory of inversions of permutations; (2) to the ascertainment of the numbers of terms in the development of a determinant which has amongst its elements an arbitrary number of zeros, Proc. London Math. Soc. (2) 15 (1916), 314–321; reprinted in [1.3], pp. 556–563.Google Scholar
[55] , Combinatory Analysis, vols. 1 and 2, Cambridge University Press, 1916; reprinted by Chelsea, New York, 1960, and by Dover, New York, 2004.Google Scholar
[56] , Integer sequences and matrices over finite fields, J. Integer Sequences (electronic) 9 (2006), Article 06.2.1.Google Scholar
[57] and , On the solutions of xd = 1 in symmetric groups, Canad. J. Math. 7 (1955), 159–168.Google Scholar
[59] , A combinatorial problem of finite sequences, Nieuw Arch. Wisk. 16 (1968), 116–123.Google Scholar
[61] , Asymptotic enumeration methods, in Handbook of Combinatorics, vol. 2 (, , and , eds.), Elsevier, Amsterdam, 1995, pp. 1063–1229.Google Scholar
[63] and , Twenty combinatorial examples of asymptotics derived from multivariate generating functions, SIAM Review 50 (2008), 199–272.Google Scholar
[64] , Let's expand Rota's Twelvefold Way for counting partitions!, preprint; arXiv:math/0606404.
[65] , André permutations, lexicographic shellability and the cd-index of a convex polytope, Trans. Amer. Math. Soc. 338 (1993), 77–104.Google Scholar
[66] , On the partition function p(n), Proc. London Math. Soc. (2) 43 (1937), 241–254.Google Scholar
[67] , Théorie des éléments saillants d'une suite d'observations, in Colloq. Combinatorial Methods in Probability Theory, August 1–10, 1962, Matematisk Institut, Aarhus Universitet, 1962, pp. 104–115.Google Scholar
[68] , Note sur les inversions, ou dérangements produits dans les permutations, J. Math. Pures Appl. 4 (1839), 236–240.Google Scholar
[69] , On a correspondence between binary trees and a certain type of permutation, Inf. Proc. Letters 4 (1975/76), 58–61.Google Scholar
[71] , A brief history of enumeration, in Science and Computers, a volume dedicated to Nicolas Metropolis (, ed.), Academic Press, New York, 1986, pp. 169–206.Google Scholar
[72] , Some asymptotic results on finite vector spaces, Advances in Applied Math. 9 (1988), 167–199.Google Scholar
[73] , On elementary calculus and the Good formula, J. Combinatorial Theory 18 (1975), 97–137.Google Scholar
[74] , The complexity of enumeration and reliability problems, SIAM J. Comput. 8 (1979), 410–421.Google Scholar
- 29
- Cited by