Counting king permutations on the cylinder
From MaRDI portal
Publication:6155995
DOI10.54550/eca2022v2s4pp5zbMath1512.05006arXiv2001.02948OpenAlexW4210572672MaRDI QIDQ6155995
Shulamit Reches, Estrella Eisenberg, Eli Bagno, Moriah Sigron
Publication date: 9 June 2023
Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.02948
permutationpermutation statisticspatternpattern posetdownsetprolific permutationcylindrical king permutation
Cites Work
- Cyclic Eulerian elements
- The minimum Manhattan distance and minimum jump of permutations
- An answer to a question by Wilf on packing distinct patterns in a permutation
- On the poset of non-attacking King permutations
- Prolific permutations and permuted packings: downsets containing many large patterns
- Cyclic descents and \(P\)-partitions.
- The Probability that Neighbors Remain Neighbors After Random Rearrangements
- On the sparseness of the downsets of permutations via their number of separators
- Counting Fixed-Length Permutation Patterns
- Permutations without Rising or Falling $\omega$-Sequences
- Unnamed Item
- Unnamed Item
This page was built for publication: Counting king permutations on the cylinder