The combinatorics of Jeff Remmel
From MaRDI portal
Publication:5056195
DOI10.54550/ECA2021V1S2H2zbMath1499.01030arXiv2102.07269MaRDI QIDQ5056195
Publication date: 7 December 2022
Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.07269
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bijections on \(m\)-level rook placements
- A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern
- Consecutive up-down patterns in up-down permutations
- Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
- Representing graphs via pattern avoiding words
- Counting with symmetric functions
- Statistics on wreath products, perfect matchings, and signed words
- A computational and combinatorial exposé of plethystic calculus
- Patterns in permutations and words.
- Enumerating \((2 + 2)\)-free posets by indistinguishable elements
- Generating functions for permutations avoiding a consecutive pattern
- A \(p,q\)-analogue of the generalized derangement numbers
- Schur function expansions and the rational shuffle theorem
- Permutations and words counted by consecutive patterns
- The classification of 231-avoiding permutations by descents and maximum drop
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- Augmented rook boards and general product formulas
- Rook-by-rook rook theory: Bijective proofs of rook and hit equivalences
- A bijective proof of the Hook formula for the number of column strict tableaux with bounded entries
- Shuffles of permutations and the Kronecker product
- Bijections for Cayley trees, spanning trees, and their q-analogues
- Q-counting rook configurations and a formula of Frobenius
- A combinatorial proof of the Giambelli identity for Schur functions
- Permutation statistics and \((k,\ell)\)-hook Schur functions
- A combinatorial interpretation of q-derangement and q-Laguerre numbers
- Bijective proofs of some classical partition identities
- Brick tabloids and the connection matrices between bases of symmetric functions
- Formulas for the expansion of the Kronecker products \(S_{(m,n)} \otimes{}S_{(1^{p-r},r)}\) and \(S_{(1^ k2^ l)} \otimes{}S_{(1^{p-r},r)}\)
- Hook-Schur functions analogues of Littlewood's identities and their bijective proofs
- On the Kronecker product of Schur functions of two row shapes
- Cycles and perfect matchings.
- The plethysm \(s_\lambda[s_\mu\) at hook and near-hook shapes]
- Formulas for the expansion of the plethysms \(s_ 2[s_{(a,b)}\) and \(s_ 2[s_{(n^ k)}]\).]
- A simple proof of the Littlewood-Richardson rule and applications.
- Counting consecutive pattern matches in \(\mathcal{S}_n(132)\) and \(\mathcal{S}_n(123)\)
- Rook theory, generalized {S}tirling numbers and {\((p,q)\)}-analogues
- Combinatorial algorithms for the expansion of various products of Schur functions
- A formula for the Kronecker products of Schur functions of hook shapes
- Trace cocharacters and the Kronecker products of Schur functions
- A \(\lambda\)-ring Frobenius characteristic for \(G\wr S_n\)
- A combinatorial proof of the equivalence of the classical and combinatorial definitions of Schur function
- The combinatorics of transition matrices between the bases of the symmetric functions and the \(B_ n\) analogues
- \(p\)-rook numbers and cycle counting in \(C_p \wr S_n\)
- \((a, b)\)-rectangle patterns in permutations and words
- Block patterns in Stirling permutations
- A note on \(p\)-ascent sequences
- On \(k\)-\(11\)-representable graphs
- Quadrant marked mesh patterns in alternating permutations
- \(m\)-level rook placements
- Quadrant marked mesh patterns in alternating permutations. II
- \(m\)-rook numbers and a generalization of a formula of Frobenius to \(C_m \wr \mathcal S_n\)
- Classifying descents according to equivalence \(\operatorname{mod} k\)
- Combinatorics of the \(q\)-basis of symmetric functions
- Generating functions for descents over permutations which avoid sets of consecutive patterns
- Generating functions for Wilf equivalence under generalized factor order
- A CLASS OF GRAPHS WHICH HAS EFFICIENT RANKING AND UNRANKING ALGORITHMS FOR SPANNING TREES AND FORESTS
- Transition matrices and kronecker product expansions of symmetric functions
- Quadrant marked mesh patterns in 132-avoiding permutations III
- Multiplying Schur functions
- A bijective proof of the generating function for the number of reverse plane partitions via lattice paths
- Place-Difference-Value Patterns: A Generalization of Generalized Permutation and Word Patterns
- Bijective proofs of formulae for the number of standard Yound tableaux
- A bijective proof of a factorization theorem for (k,l)-hook schur functions
- Special Rim Hook Tabloids and Some New Multiplicity-Free S-Series
- Quadrant marked mesh patterns in 123-avoiding permutations
- A combinatorial interpretation of the inverse kostka matrix
- A combinatorial rule for the schur function expansion of the PlethysmS(1a,b)[Pk]
- Quadrant marked mesh patterns in 132-avoiding permutations I
- Classical pattern distributions in $\mathcal{S}_{n}(132)$ and $\mathcal{S}_{n}(123)$
- Quadrant marked mesh patterns in 132-avoiding permutations II
- Simple marked mesh patterns
- Rook theory for perfect matchings
This page was built for publication: The combinatorics of Jeff Remmel
