Colored Multipermutations and a Combinatorial Generalization of Worpitzky's Identity
From MaRDI portal
Publication:5139707
zbMath1453.05002arXiv1910.02977MaRDI QIDQ5139707
Jay Pantone, John Engbers, Christopher Stocker
Publication date: 10 December 2020
Full work available at URL: https://arxiv.org/abs/1910.02977
Combinatorial identities, bijective combinatorics (05A19) Bernoulli and Euler numbers and polynomials (11B68) Permutations, words, matrices (05A05)
Cites Work
- Counting descent pairs with prescribed colors in the colored permutation groups
- The colored Eulerian descent algebra
- Labeled partitions with colored permutations
- The \(r\)-multipermutations
- Some applications of the generalized Eulerian numbers
- Combinatorics of Permutations
- Eulerian Numbers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Colored Multipermutations and a Combinatorial Generalization of Worpitzky's Identity