The combinatorics of Jeff Remmel (Q5056195)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7628163

Language	Label	Description	Also known as
English	The combinatorics of Jeff Remmel	scientific article; zbMATH DE number 7628163

Statements

scholarly article

0 references

The combinatorics of Jeff Remmel (English)

0 references

0 references

0 references

Enumerative Combinatorics and Applications

0 references

publication date

7 December 2022

0 references

full work available at URL

https://arxiv.org/abs/2102.07269

0 references

MaRDI profile type

MaRDI publication profile

0 references

Generating functions for descents over permutations which avoid sets of consecutive patterns

0 references

Bijections on \(m\)-level rook placements

0 references

\(m\)-level rook placements

0 references

The combinatorics of transition matrices between the bases of the symmetric functions and the \(B_ n\) analogues

0 references

(2+2)-free posets, ascent sequences and pattern avoiding permutations

0 references

\(m\)-rook numbers and a generalization of a formula of Frobenius to \(C_m \wr \mathcal S_n\)

0 references

A \(p,q\)-analogue of the generalized derangement numbers

0 references

Trace cocharacters and the Kronecker products of Schur functions

0 references

A combinatorial proof of the equivalence of the classical and combinatorial definitions of Schur function

0 references

A combinatorial rule for the schur function expansion of the Plethysm<i>S</i>(1<sup><i>a</i></sup>,<i>b</i>)[<i>P<sub>k</sub></i>]

0 references

Formulas for the expansion of the plethysms \(s_ 2[s_{(a,b)}]\) and \(s_ 2[s_{(n^ k)}]\).

0 references

0 references

On \(k\)-\(11\)-representable graphs

0 references

Enumerating \((2 + 2)\)-free posets by indistinguishable elements

0 references

Bijections for Cayley trees, spanning trees, and their q-analogues

0 references

A combinatorial interpretation of the inverse kostka matrix

0 references

Brick tabloids and the connection matrices between bases of symmetric functions

0 references

0 references

A CLASS OF GRAPHS WHICH HAS EFFICIENT RANKING AND UNRANKING ALGORITHMS FOR SPANNING TREES AND FORESTS

0 references

A combinatorial proof of the Giambelli identity for Schur functions

0 references

A combinatorial interpretation of q-derangement and q-Laguerre numbers

0 references

Shuffles of permutations and the Kronecker product

0 references

0 references

Q-counting rook configurations and a formula of Frobenius

0 references

0 references

Statistics on wreath products, perfect matchings, and signed words

0 references

Rook theory for perfect matchings

0 references

Cycles and perfect matchings.

0 references

\(p\)-rook numbers and cycle counting in \(C_p \wr S_n\)

0 references

The classification of 231-avoiding permutations by descents and maximum drop

0 references

Representing graphs via pattern avoiding words

0 references

0 references

A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern

0 references

Patterns in permutations and words.

0 references

0 references

Classifying descents according to equivalence \(\operatorname{mod} k\)

0 references

Place-Difference-Value Patterns: A Generalization of Generalized Permutation and Word Patterns

0 references

Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics

0 references

Simple marked mesh patterns

0 references

Quadrant marked mesh patterns in alternating permutations

0 references

Quadrant marked mesh patterns in alternating permutations. II

0 references

\((a, b)\)-rectangle patterns in permutations and words

0 references

A note on \(p\)-ascent sequences

0 references

Quadrant marked mesh patterns in 132-avoiding permutations I

0 references

Quadrant marked mesh patterns in 132-avoiding permutations II

0 references

Quadrant marked mesh patterns in 132-avoiding permutations III

0 references

Generating functions for Wilf equivalence under generalized factor order

0 references

The plethysm \(s_\lambda[s_\mu]\) at hook and near-hook shapes

0 references

Generating functions for permutations avoiding a consecutive pattern

0 references

0 references

Rook-by-rook rook theory: Bijective proofs of rook and hit equivalences

0 references

A computational and combinatorial exposé of plethystic calculus

0 references

Permutations and words counted by consecutive patterns

0 references

Counting with symmetric functions

0 references

A \(\lambda\)-ring Frobenius characteristic for \(G\wr S_n\)

0 references

Augmented rook boards and general product formulas

0 references

Counting consecutive pattern matches in \(\mathcal{S}_n(132)\) and \(\mathcal{S}_n(123)\)

0 references

Quadrant marked mesh patterns in 123-avoiding permutations

0 references

Schur function expansions and the rational shuffle theorem

0 references

Classical pattern distributions in $\mathcal{S}_{n}(132)$ and $\mathcal{S}_{n}(123)$

0 references

Combinatorics of the \(q\)-basis of symmetric functions

0 references

Bijective proofs of formulae for the number of standard Yound tableaux

0 references

Bijective proofs of some classical partition identities

0 references

0 references

Permutation statistics and \((k,\ell)\)-hook Schur functions

0 references

A formula for the Kronecker products of Schur functions of hook shapes

0 references

A bijective proof of a factorization theorem for (<i>k,l</i>)-hook schur functions

0 references

Combinatorial algorithms for the expansion of various products of Schur functions

0 references

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)}\)

0 references

Consecutive up-down patterns in up-down permutations

0 references

0 references

A simple proof of the Littlewood-Richardson rule and applications.

0 references

Rook theory, generalized {S}tirling numbers and {\((p,q)\)}-analogues

0 references

On the Kronecker product of Schur functions of two row shapes

0 references

Transition matrices and kronecker product expansions of symmetric functions

0 references

A bijective proof of the Hook formula for the number of column strict tableaux with bounded entries

0 references

A bijective proof of the generating function for the number of reverse plane partitions via lattice paths

0 references

Multiplying Schur functions

0 references

Block patterns in Stirling permutations

0 references

Special Rim Hook Tabloids and Some New Multiplicity-Free <i>S</i>-Series

0 references

Hook-Schur functions analogues of Littlewood's identities and their bijective proofs

0 references

Identifiers

zbMATH Open document ID

0 references

10.54550/ECA2021V1S2H2

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5056195

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5056195&oldid=37468607"