Find link

language:

Find link is a tool written by Edward Betts.

searching for Enumerative combinatorics 86 found (197 total)

alternate case: enumerative combinatorics

Richard P. Stanley (442 words) [view diff] case mismatch in snippet view article find links to article

mathematical disciplines. Stanley is known for his two-volume book Enumerative Combinatorics (1986–1999). He is also the author of Combinatorics and Commutative

Eulerian poset (407 words) [view diff] case mismatch in snippet view article find links to article

interpretation. Enumerative Combinatorics, Vol. 1, 3.14, p. 138; formerly called the generalized h-vector. Enumerative Combinatorics, Vol. 1, Theorem

Igor Pak (281 words) [view diff] case mismatch in snippet view article find links to article

Zeilberger at the 2006 Harvey Mudd College Mathematics Conference on Enumerative Combinatorics. Pak is an Associate Editor for the journal Discrete Mathematics

David M. Jackson (286 words) [view diff] exact match in snippet view article find links to article

in 1969. Jackson has been responsible for many developments in enumerative combinatorics in his career, as well as being a mathematical consultant to the

Kostka number (1,255 words) [view diff] exact match in snippet view article find links to article

Stanley, Enumerative combinatorics, volume 2, p. 398. Stanley, Enumerative combinatorics, volume 2, p. 315. Stanley, Enumerative combinatorics, volume

History of combinatorics (2,149 words) [view diff] exact match in snippet view article find links to article

around 700 AD. Although China had relatively few advancements in enumerative combinatorics, around 100 AD they solved the Lo Shu Square which is the combinatorial

Covering relation (519 words) [view diff] case mismatch in snippet view article find links to article

Addison-Wesley, ISBN 0-321-33570-8. Stanley, Richard P. (1997), Enumerative Combinatorics, vol. 1 (2nd ed.), Cambridge University Press, ISBN 0-521-55309-1

Permutation Patterns (conference) (310 words) [view diff] case mismatch in snippet view article

Discrete Mathematics & Theoretical Computer Science (DMTCS), Enumerative Combinatorics and Applications, and Pure Mathematics and Applications. In addition

Sergey Kitaev (403 words) [view diff] case mismatch in snippet view article find links to article

"Permutation classes". In Bóna, Miklós (ed.). The Handbook of Enumerative Combinatorics. CRC Press. Sergey Kitaev | MathsciNet Mathematical Reviews Sergey

Locally finite poset (152 words) [view diff] case mismatch in snippet view article find links to article

and has been used as a model for spacetime. Stanley, Richard P. Enumerative Combinatorics, Volume I. Cambridge University Press, 1997. Pages 98, 113–116

Ranked poset (167 words) [view diff] case mismatch in snippet view article find links to article

one in which all maximal chains have length n. Richard Stanley, Enumerative Combinatorics, vol.1 p.99, Cambridge Studies in Advanced Mathematics 49, Cambridge

Chunwei Song (574 words) [view diff] case mismatch in snippet view article find links to article

Chinese Mathematical Society. Song is on the editorial boards of Enumerative Combinatorics and Applications, Advances and Applications in Discrete Mathematics

Lagrange inversion theorem (2,428 words) [view diff] exact match in snippet view article find links to article

edition (January 2, 1927), pp. 129–130 Richard, Stanley (2012). Enumerative combinatorics. Volume 1. Cambridge Stud. Adv. Math. Vol. 49. Cambridge: Cambridge

BEST theorem (545 words) [view diff] case mismatch in snippet view article find links to article

Reading, Mass.: Addison-Wesley. Stanley, Richard P. (1999), Enumerative Combinatorics, vol. 2, Cambridge University Press, ISBN 0-521-56069-1. Theorem

Jeffrey Shallit (488 words) [view diff] case mismatch in snippet view article find links to article

Mansour, Toufik (2022). "Interview with Jeffrey Shallit" (PDF). Enumerative Combinatorics and Applications. 2 (2): Interview #S3I5. doi:10.54550/ECA2022V2S2I5

Q-Pochhammer symbol (2,654 words) [view diff] exact match in snippet view article find links to article

\ |z|<1.} The q-Pochhammer symbol is closely related to the enumerative combinatorics of partitions. The coefficient of q m a n {\displaystyle q^{m}a^{n}}

Durfee square (455 words) [view diff] case mismatch in snippet view article find links to article

32. doi:10.37236/1370. MR 1631751. Stanley, Richard P. (1999) Enumerative Combinatorics, Volume 2, p. 289. Cambridge University Press. ISBN 0-521-56069-1

Turnstile (symbol) (1,167 words) [view diff] case mismatch in snippet view article

www.jsoftware.com. Iverson 1987 Stanley, Richard P. (1999). Enumerative Combinatorics. Vol. 2 (1st ed.). Cambridge: Cambridge University Press. p. 287

Integer partition (3,403 words) [view diff] case mismatch in snippet view article find links to article

Abramowitz & Stegun 1964, p. 826, 24.2.2 eq. II(A) Richard Stanley, Enumerative Combinatorics, volume 1, second edition. Cambridge University Press, 2012. Chapter

Genocchi number (373 words) [view diff] case mismatch in snippet view article find links to article

Eric W. "Genocchi Number". MathWorld. Richard P. Stanley (1999). Enumerative Combinatorics, Volume 2, Exercise 5.8. Cambridge University Press. ISBN 0-521-56069-1

Alternant matrix (1,047 words) [view diff] case mismatch in snippet view article find links to article

Ltd. pp. 111–123. OCLC 271302373. Stanley, Richard P. (1999). Enumerative Combinatorics (2nd ed.). Cambridge University Press. pp. 334–342. doi:10.1017/CBO9781139058520

Craige Schensted (298 words) [view diff] exact match in snippet view article find links to article

Longman, ISBN 978-0-582-18635-4 Stanley, Richard P. (1999), Enumerative combinatorics. Vol. 2, Cambridge Studies in Advanced Mathematics, vol. 62, Cambridge

Undergraduate Texts in Mathematics (4,190 words) [view diff] case mismatch in snippet view article find links to article

ISBN 978-0-387-98649-4. Martin, George E. (2001). Counting: The Art of Enumerative Combinatorics. doi:10.1007/978-1-4757-4878-9. ISBN 978-0-387-95225-3. Hilton

Adriano Garsia (394 words) [view diff] case mismatch in snippet view article find links to article

à Montréal. Adriano M. Garsia and Ömer Eğecioğlu, Lessons in Enumerative Combinatorics, Graduate Texts in Mathematics 290, Springer Nature, Switzerland

Frobenius characteristic map (2,092 words) [view diff] case mismatch in snippet view article find links to article

edition. p. 63. ISBN 9780198739128. Stanley, Richard (1999). Enumerative Combinatorics: Volume 2 (Cambridge Studies in Advanced Mathematics Book 62)

Quasi-polynomial (402 words) [view diff] case mismatch in snippet view article find links to article

{\displaystyle \leq \deg F+\deg G+1.} Stanley, Richard P. (1997). Enumerative Combinatorics, Volume 1. Cambridge University Press. ISBN 0-521-55309-1, 0-521-56069-1

Power sum symmetric polynomial (1,180 words) [view diff] case mismatch in snippet view article find links to article

ISBN 0-19-850450-0 (paperback, 1998). Richard P. Stanley (1999), Enumerative Combinatorics, Vol. 2. Cambridge: Cambridge University Press. ISBN 0-521-56069-1

Q-Vandermonde identity (859 words) [view diff] case mismatch in snippet view article find links to article

Solution to exercise 1.100, p. 188. Richard P. Stanley (2011). Enumerative Combinatorics, Volume 1 (PDF) (2 ed.). Retrieved April 30, 2025. Exton, H. (1983)

Addition principle (829 words) [view diff] exact match in snippet view article find links to article

multiplication principle. Biggs 2002, p. 91. mps (22 March 2013). "enumerative combinatorics". PlanetMath. Archived from the original on 23 July 2014. Retrieved

Henry Crapo (mathematician) (707 words) [view diff] exact match in snippet view article

1016/s0021-9800(66)80009-1. MR 0193018. Stanley, Richard (2012). Enumerative combinatorics. New York: Cambridge University Press. ISBN 978-1-107-60262-5

Multiset (4,983 words) [view diff] case mismatch in snippet view article find links to article

(1997). Enumerative Combinatorics. Vol. 1. Cambridge University Press. ISBN 0-521-55309-1. Stanley, Richard P. (1999). Enumerative Combinatorics. Vol. 2

Central binomial coefficient (1,238 words) [view diff] case mismatch in snippet view article find links to article

Integer Sequences. OEIS Foundation. Stanley, Richard P. (2012), Enumerative Combinatorics, vol. 1 (2 ed.), Cambridge University Press, Example 1.1.15,

Upper set (1,290 words) [view diff] exact match in snippet view article find links to article

44. ISBN 0-521-78451-4. LCCN 2001043910. Stanley, R.P. (2002). Enumerative combinatorics. Cambridge studies in advanced mathematics. Vol. 1. Cambridge

Ring of symmetric functions (3,850 words) [view diff] case mismatch in snippet view article find links to article

Quasisymmetric function Stanley, Richard P.; Fomin, Sergey P. Enumerative Combinatorics. Vol. 2. Cambridge University Press. Macdonald, I. G. Symmetric

Order polynomial (1,272 words) [view diff] exact match in snippet view article find links to article

Reciprocity theorem for linear homogeneous diophantine equations". Enumerative combinatorics. Volume 1 (2nd ed.). New York: Cambridge University Press. ISBN 9781139206549

Partition function (number theory) (4,364 words) [view diff] case mismatch in snippet view article

function record: p(1020) computed Stanley, Richard P. (1997), Enumerative Combinatorics 1, Cambridge Studies in Advanced Mathematics, vol. 49, Cambridge

Graded poset (1,934 words) [view diff] case mismatch in snippet view article find links to article

1967, p.5 See reference [2], p.722. Stanley, Richard (1997). Enumerative Combinatorics (vol.1, Cambridge Studies in Advanced Mathematics 49). Cambridge

Fibonacci cube (1,727 words) [view diff] case mismatch in snippet view article find links to article

Combinatoria, 87: 105–117, MR 2414008. Stanley, Richard P. (1986), Enumerative Combinatorics, Wadsworth, Inc. Exercise 3.23a, page 157. Stojmenovic, Ivan (1998)

Multinomial theorem (2,294 words) [view diff] case mismatch in snippet view article find links to article

Combinatorial Theory, Springer, p. 77 Stanley, Richard (2012), Enumerative Combinatorics, vol. 1 (2 ed.), Cambridge University Press, §1.2 National Institute

Christian Krattenthaler (429 words) [view diff] case mismatch in snippet view article find links to article

41–54. "Christian Krattenthaler – Determinants and Pfaffians in Enumerative Combinatorics (2011)". YouTube. 17 November 2017. "Christian Krattenthaler –

Arrangement of hyperplanes (1,806 words) [view diff] case mismatch in snippet view article find links to article

MR 1217488. Stanley, Richard (2011). "3.11 Hyperplane Arrangements". Enumerative Combinatorics. Vol. 1 (2nd ed.). Cambridge University Press. ISBN 978-1107602625

Rank of a partition (1,359 words) [view diff] case mismatch in snippet view article find links to article

Retrieved 24 November 2012. Stanley, Richard P. (1999) Enumerative Combinatorics, Volume 2, p. 289. Cambridge University Press. ISBN 0-521-56069-1

Fa-Yueh Wu (640 words) [view diff] exact match in snippet view article find links to article

Journal of Physics, Band 40, 2002, No. 4) Maillard: A challenge in enumerative combinatorics: the graph of contributions of Prof. Fa-Yueh Wu. 2002, arXiv:cond-mat/0205063

Holonomic function (1,977 words) [view diff] case mismatch in snippet view article find links to article

(Thesis). Retrieved 4 June 2013. Stanley, Richard P. (1999). Enumerative Combinatorics. Vol. 2. Cambridge University Press. ISBN 978-0-521-56069-6. Zeilberger

Dan Romik (750 words) [view diff] exact match in snippet view article find links to article

Davis. Much of Romik's work is in the areas of algebraic and enumerative combinatorics. He was an invited speaker at the FPSAC 2017 and AofA 2017 conferences

Order polytope (1,416 words) [view diff] case mismatch in snippet view article find links to article

doi:10.1007/BF02187680, MR 0824105 Stanley, Richard (2011), Enumerative Combinatorics, Volume 1, second edition, version of 15 July 2011 (PDF), pp. 571–572

Tree (graph theory) (3,385 words) [view diff] case mismatch in snippet view article

book}}: CS1 maint: location (link) Stanley, Richard P. (2012), Enumerative Combinatorics, Vol. I, Cambridge Studies in Advanced Mathematics, vol. 49, Cambridge

Jeu de taquin (1,656 words) [view diff] case mismatch in snippet view article find links to article

1007/BFb0090012, ISBN 978-3-540-08143-2 Stanley, Richard P. (1999), Enumerative Combinatorics, Cambridge Studies in Advanced Mathematics 62, vol. 2, Cambridge

Differential poset (1,601 words) [view diff] case mismatch in snippet view article find links to article

Stanley 2011, p. 386, Theorem 3.21.10. Stanley, Richard (2011), Enumerative Combinatorics (PDF), vol. 1 (2 ed.), archived from the original (PDF) on 2011-05-31

Narayana polynomials (1,096 words) [view diff] case mismatch in snippet view article find links to article

1016/0012-365X(81)90259-4. Retrieved 2 December 2023. R.P. Stanley (1999). Enumerative Combinatorics, Vol. 2. Cambridge University Press. Rodica Simian and Daniel

Longest alternating subsequence (991 words) [view diff] case mismatch in snippet view article find links to article

subsequence Longest common subsequence Stanley, Richard P. (2011), Enumerative Combinatorics, Volume I, second edition, Cambridge University Press Romik, Dan

Murnaghan–Nakayama rule (1,282 words) [view diff] case mismatch in snippet view article find links to article

( 3 , 3 , 1 , 1 ) ( 5 , 2 , 1 ) = − 2 {\displaystyle \chi _{(3,3,1,1)}^{(5,2,1)}=-2} , as before. Richard Stanley, Enumerative Combinatorics, Vol. 2

Derangement (2,212 words) [view diff] case mismatch in snippet view article find links to article

doi:10.2307/2315337. JSTOR 2315337. Stanley, Richard (2012). Enumerative Combinatorics, volume 1 (2 ed.). Cambridge University Press. Example 2.2.1.

Michael D. Atkinson (804 words) [view diff] case mismatch in snippet view article find links to article

(2015). "Permutation classes". In Bóna, Miklós (ed.). Handbook of Enumerative Combinatorics. Boca Raton, Florida: CRC Press. p. 793. doi:10.1201/b18255.

Elementary symmetric polynomial (2,911 words) [view diff] case mismatch in snippet view article find links to article

Clarendon Press. ISBN 0-19-850450-0. Stanley, Richard P. (1999). Enumerative Combinatorics, Vol. 2. Cambridge: Cambridge University Press. ISBN 0-521-56069-1

Robinson–Schensted–Knuth correspondence (2,102 words) [view diff] case mismatch in snippet view article find links to article

{\displaystyle \mathrm {column} (A)=\nu } . Stanley, Richard P. (1999). Enumerative Combinatorics. Vol. 2. New York: Cambridge University Press. pp. 316–380. ISBN 0-521-55309-1

Jim Pitman (941 words) [view diff] exact match in snippet view article find links to article

research in the theory of probability, stochastic processes and enumerative combinatorics. In particular, for long-running collaborations with Marc Yor

Jeffrey B. Remmel (568 words) [view diff] case mismatch in snippet view article find links to article

Anthony (February 19, 2021). "The Combinatorics of Jeff Remmel". Enumerative Combinatorics and Applications. 1 (2) S1H2. arXiv:2102.07269. QID 124254336

Graduate Texts in Mathematics (5,056 words) [view diff] case mismatch in snippet view article find links to article

Applications, Jane M. Hawkins (2020, ISBN 978-3-030-59242-4) Lessons in Enumerative Combinatorics, Omer Egecioglu, Adriano Garsia (2021, ISBN 978-3-030-71249-5)

Permutation (11,657 words) [view diff] case mismatch in snippet view article find links to article

as it gives (45) instead of (54).] Stanley, Richard P. (2012). Enumerative Combinatorics: Volume I, Second Edition. Cambridge University Press. p. 30,

Young subgroup (529 words) [view diff] case mismatch in snippet view article find links to article

"Hurwitz Numbers for Reflection Groups I: Generatingfunctionology", Enumerative Combinatorics and Applications, 2 (3): Article #S2R20, arXiv:2112.03427, doi:10

H-vector (2,250 words) [view diff] case mismatch in snippet view article find links to article

Birkhäuser Boston, Inc., ISBN 0-8176-3836-9. Stanley, Richard (1997), Enumerative Combinatorics, vol. 1, Cambridge University Press, ISBN 0-521-55309-1.

Leroy P. Steele Prize (2,239 words) [view diff] case mismatch in snippet view article find links to article

Stanley in recognition of the completion of his two-volume work Enumerative Combinatorics. 2000 John H. Conway in recognition of his many expository contributions

Schur polynomial (3,773 words) [view diff] case mismatch in snippet view article find links to article

parts of length k. A proof of this can be found in R. Stanley's Enumerative Combinatorics Volume 2, Corollary 7.17.5. The integers χλ ρ can be computed

List of conjectures (1,461 words) [view diff] exact match in snippet view article find links to article

combinatorics 1995 Doron Zeilberger Alternating sign matrix conjecture, enumerative combinatorics 1996 Vladimir Voevodsky Milnor conjecture algebraic K-theory Voevodsky's

Symmetric polynomial (3,833 words) [view diff] case mismatch in snippet view article find links to article

ISBN 0-19-850450-0 (paperback, 1998). Richard P. Stanley (1999), Enumerative Combinatorics, Vol. 2. Cambridge: Cambridge University Press. ISBN 0-521-56069-1

Birkhoff's representation theorem (2,980 words) [view diff] case mismatch in snippet view article find links to article

1112/plms/s3-24.3.507, hdl:10338.dmlcz/134149. Stanley, R. P. (1997), Enumerative Combinatorics, Volume I, Cambridge Studies in Advanced Mathematics 49, Cambridge

Complete homogeneous symmetric polynomial (3,192 words) [view diff] case mismatch in snippet view article find links to article

ISBN 0-19-850450-0 (paperback, 1998). Richard P. Stanley (1999), Enumerative Combinatorics, Vol. 2. Cambridge: Cambridge University Press. ISBN 0-521-56069-1

Partially ordered set (5,351 words) [view diff] case mismatch in snippet view article find links to article

Birkhäuser. ISBN 978-3-319-29788-0. Stanley, Richard P. (1997). Enumerative Combinatorics 1. Cambridge Studies in Advanced Mathematics. Vol. 49. Cambridge

Symmetric group (6,212 words) [view diff] case mismatch in snippet view article find links to article

"Hurwitz Numbers for Reflection Groups I: Generatingfunctionology", Enumerative Combinatorics and Applications, 2 (3), Proposition 2.1, arXiv:2112.03427, doi:10

Lattice (order) (5,451 words) [view diff] case mismatch in snippet view article

15 in sec II.8. ISBN 9780821810255. Stanley, Richard P (1997), Enumerative Combinatorics (vol. 1), Cambridge University Press, pp. 103–104, ISBN 0-521-66351-2

Weak ordering (4,360 words) [view diff] case mismatch in snippet view article find links to article

Proposition 1.9, p. 10, ISBN 9783540276593. Stanley, Richard P. (1997), Enumerative Combinatorics, Vol. 2, Cambridge Studies in Advanced Mathematics, vol. 62, Cambridge

Representation theory of the symmetric group (2,840 words) [view diff] case mismatch in snippet view article find links to article

Quantum Chemistry, CRC Press, Boca Raton, Florida Richard Stanley, Enumerative Combinatorics, Vol. 2 Burnside, William (1955), Theory of groups of finite order

Binary tree (5,236 words) [view diff] case mismatch in snippet view article find links to article

authors list (link) "full binary tree". NIST. Richard Stanley, Enumerative Combinatorics, volume 2, p.36 "perfect binary tree". NIST. "complete binary

Stirling numbers of the first kind (7,265 words) [view diff] case mismatch in snippet view article find links to article

section 6.2 and 6.5 of Concrete Mathematics. Richard P. Stanley, Enumerative Combinatorics, volume 1 (2nd ed.). Page 34 of the online version. Adamchik,

Lindström–Gessel–Viennot lemma (3,677 words) [view diff] case mismatch in snippet view article find links to article

(2001), The symmetric group, Springer Stanley, Richard P. (1999), Enumerative Combinatorics, volume 2, CUP Talaska, Kelli (2012), Determinants of weighted

Fibonacci sequence (12,946 words) [view diff] case mismatch in snippet view article find links to article

169–177, MR 2278830 Lucas 1891, p. 7. Stanley, Richard (2011), Enumerative Combinatorics I (2nd ed.), Cambridge Univ. Press, p. 121, Ex 1.35, ISBN 978-1-107-60262-5

Polyhedron (10,656 words) [view diff] case mismatch in snippet view article find links to article

128, ISBN 0-691-08304-5, MR 1435975 Stanley, Richard P. (1997), Enumerative Combinatorics, Volume I (1 ed.), Cambridge University Press, pp. 235–239,

Trigonometric functions (10,653 words) [view diff] case mismatch in snippet view article find links to article

& Sherbert 1999, p. 247. Whitaker and Watson, p 584 Stanley, Enumerative Combinatorics, Vol I., p. 149 Abramowitz; Weisstein. Lambert, Johann Heinrich

Newton's identities (7,650 words) [view diff] case mismatch in snippet view article find links to article

doi:10.2307/2324242. JSTOR 2324242. Stanley, Richard P. (1999). Enumerative Combinatorics, Vol. 2. Cambridge University Press. ISBN 0-521-56069-1. (hardback)

Twelvefold way (5,609 words) [view diff] case mismatch in snippet view article find links to article

way. Stars and bars (combinatorics) Richard P. Stanley (1997). Enumerative Combinatorics, Volume I. Cambridge University Press. ISBN 0-521-66351-2. p.41

Word-representable graph (3,653 words) [view diff] case mismatch in snippet view article find links to article

Gothenburg–Reykjavík–Strathclyde Combinatorics Group" (PDF). Enumerative Combinatorics and Applications. 3 (1): Article S1H1. doi:10.54550/ECA2023V3S1H1

Constant-recursive sequence (5,035 words) [view diff] case mismatch in snippet view article find links to article

Vienna. p. 66. ISBN 978-3-7091-0444-6. Stanley, Richard P. (2011). Enumerative Combinatorics (PDF). Vol. 1 (2 ed.). Cambridge studies in advanced mathematics

Generating function (14,462 words) [view diff] case mismatch in snippet view article find links to article

Example from Stanley, Richard P.; Fomin, Sergey (1997). "§6.3". Enumerative Combinatorics: Volume 2. Cambridge Studies in Advanced Mathematics. Vol. 62

List of women in mathematics (23,412 words) [view diff] exact match in snippet view article find links to article

Silvia Heubach, German-American mathematician specializing in enumerative combinatorics, combinatorial game theory, and bioinformatics Gloria Conyers

Generating function transformation (11,140 words) [view diff] case mismatch in snippet view article find links to article

Transformations". arXiv:1609.02803 [math.NT]. Stanley, R. P. (1999). Enumerative Combinatorics. Vol. 2. Cambridge University Press. ISBN 978-0-521-78987-5. Why