Enumerative Combinatorics: Volume 1

By Richard P. Stanley. 2011

1,662 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/00c26c47cad9d79cc4e0a177ff50ff5b3cc21adc

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. James Haglund
2. Sarah K. Mason
3. Kurt W. Luoto
4. Liam Solus
5. Stephanie van Willigenburg
6. Matthew A. Masten
7. Petter Brand'en
8. Julius Borcea

Citations in the corpus

• Deep Learning for Symbolic Mathematics (2019, unknown): “They appear in different combinatorial problems (Stanley, 2011).”
• Symmetric Decompositions and Real-Rootedness (2018, background): “The following theorem provides a description of the operator Tk in terms of the Stirling numbers of the second kind, which we denote by S(m, k), see [41].”
• Random Coefficients on Endogenous Variables in Simultaneous Equations Models (2014, background): “12) on page 296 of Stanley (1999). The proof for the case i > j is analogous.”
• Refinements of the Littlewood-Richardson rule (2009, background): “(See [ 14, Chapter 7 ] for a discussion of the RSK algorithm.”