On the sparseness of the downsets of permutations via their number of separators

DOI10.54550/ECA2021V1S3R21zbMath1499.05004OpenAlexW3210716557MaRDI QIDQ5054897

Estrella Eisenberg, Moriah Sigron, Eli Bagno, Shulamit Reches

Publication date: 12 December 2022

Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.54550/eca2021v1s3r21

zbMATH Keywords

permutationpermutation statisticspatternpattern posetdownsetprolific permutation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07)

Related Items (1)

Counting king permutations on the cylinder

Cites Work

• Pattern matching for permutations
• Patterns in permutations and words.
• On two unimodal descent polynomials
• On the poset of non-attacking King permutations
• Two examples of unbalanced Wilf-equivalence
• The enumeration of permutations avoiding 3124 and 4312
• Prolific permutations and permuted packings: downsets containing many large patterns
• Egge triples and unbalanced Wilf-equivalence
• The Probability that Neighbors Remain Neighbors After Random Rearrangements
• Counting Fixed-Length Permutation Patterns
• The Asymptotic Distribution of Runs of Consecutive Elements
• Note on Runs of Consecutive Elements

This page was built for publication: On the sparseness of the downsets of permutations via their number of separators