Counting with symmetric functions
DOI10.1007/978-3-319-23618-6zbMATH Open1409.05004OpenAlexW4298857404MaRDI QIDQ495643FDOQ495643
Jeffrey Remmel, Anthony Mendes
Publication date: 14 September 2015
Published in: Developments in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-23618-6
generating functionssymmetric functionspermutation statistics[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=P%EF%BF%BD%EF%BF%BDlya%27s+enumeration+theorem&go=Go PοΏ½οΏ½lya's enumeration theorem]Robinson-Schensted-Knuth algorithm
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Symmetric functions and generalizations (05E05) Combinatorial identities, bijective combinatorics (05A19) Group actions on combinatorial structures (05E18) Other special functions (33E99)
Cited In (24)
- Gamma-positivity in combinatorics and geometry
- The \(e\)-positivity and Schur positivity of some spiders and broom trees
- Consecutive up-down patterns in up-down permutations
- Title not available (Why is that?)
- The Pelletier--Ressayre hidden symmetry for Littlewood--Richardson coefficients
- Position sequences and a \(q\)-analogue for the modular hook length formula
- Abacus proofs of Cauchy product identities for Schur polynomials
- Quasisymmetric and Schur expansions of cycle index polynomials
- Title not available (Why is that?)
- Generalized matrix polynomials of tree Laplacians indexed by symmetric functions and the GTS poset
- A combinatorial formula for the Schur coefficients of chromatic symmetric functions
- Chebyshev's bias for products of irreducible polynomials
- Title not available (Why is that?)
- Mutually disjoint Steiner systems from BCH codes
- A proof of the Murnaghan-Nakayama rule using Specht modules and tableau combinatorics
- Chebyshev's bias for products of \(k\) primes
- Kronecker powers of harmonics, polynomial rings, and generalized principal evaluations
- The combinatorics of Jeff Remmel
- Enumerative Combinatorics
- The \(e\)-positivity of two classes of cycle-chord graphs
- Symmetric functions and a natural framework for combinatorial and number theoretic sequences
- Title not available (Why is that?)
- Petrie symmetric functions
- The first infinite family of orthogonal Steiner systems \(\mathrm{S}(3,5,v)\)
Recommendations
- Enumerative applications of symmetric functions π π
- Counting rotation symmetric functions using Polya's theorem π π
- Bernoulli numbers and symmetric functions π π
- Reciprocal Sums and Counting Functions π π
- SYMMETRIC AND GENERATING FUNCTIONS π π
- Counting functions π π
- Symmetric functions π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- A constructive count of rotation symmetric functions π π
This page was built for publication: Counting with symmetric functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q495643)