Generating permutations with restricted containers

DOI10.1016/j.jcta.2018.02.006zbMath1385.05002arXiv1510.00269OpenAlexW2963419264MaRDI QIDQ1747767

Cheyne Homberger, Jay Pantone, Nathaniel Shar, Michael Henry Albert, Vincent R. Vatter

Publication date: 27 April 2018

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.00269

zbMATH Keywords

enumerationpermutation patternsstacksorting machine

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items

Patterns in Shi tableaux and Dyck paths, Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence, Sorting by shuffling methods and a queue, Inversion sequences avoiding pairs of patterns, Stieltjes moment sequences for pattern-avoiding permutations, Enumeration of inversion sequences avoiding triples of relations, Stack-sorting with consecutive-pattern-avoiding stacks, Finding and counting permutations via CSPs, On Stanley-Wilf limit of the pattern 1324, Unnamed Item, Slicings of parallelogram polyominoes: Catalan, Schröder, Baxter, and other sequences, On partially ordered patterns of length 4 and 5 in permutations, Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations, Permutations avoiding sets of patterns with long monotone subsequences

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using functional equations to enumerate 1324-avoiding permutations
• The enumeration of permutations with a prescribed number of ``forbidden patterns
• Handbook of weighted automata
• Forbidden subsequences and Chebyshev polynomials
• On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
• Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
• The permutation classes equinumerous to the smooth class
• Finite transition matrices for permutations avoiding pairs of length four patterns
• Postscript: ``Permutations with forbidden subsequences and a generalized Schröder number [Discrete Mathematics 218 (2000) 121--130]
• Regular closed sets of permutations.
• Sorting with two ordered stacks in series.
• On growth rates of closed permutation classes
• Pattern avoidance in matchings and partitions
• Permutations with forbidden subsequences and a generalized Schröder number
• On \(1324\)-avoiding permutations
• Finitely labeled generating trees and restricted permutations
• Polynomial equations with one catalytic variable, algebraic series and map enumeration
• Grid classes and the Fibonacci dichotomy for restricted permutations
• Wilf classes of pairs of permutations of length 4
• The insertion encoding of permutations
• Two Vignettes On Full Rook Placements
• Geometric grid classes of permutations
• Permutation classes
• Small permutation classes
• What is an Answer?
• On the effective and automatic enumeration of polynomial permutation classes