Combinatorial generation via permutation languages. I. Fundamentals
From MaRDI portal
Publication:5863047
DOI10.1090/tran/8199zbMath1484.05009arXiv1906.06069OpenAlexW3028952982MaRDI QIDQ5863047
Aaron Williams, Hung P. Hoang, Torsten Mütze, Elizabeth J. Hartung
Publication date: 10 March 2022
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.06069
Hamilton pathGray codeweak orderpattern-avoiding permutationlattice congruencerectangulationexhaustive generation algorithmquotientope
(n)-dimensional polytopes (52B11) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Permutations, words, matrices (05A05) Structure theory of lattices (06B05) Lattice ideals, congruence relations (06B10) Eulerian and Hamiltonian graphs (05C45)
Related Items (3)
Combinatorial generation via permutation languages. III: Rectangulations ⋮ Combinatorial Generation via Permutation Languages. V. Acyclic Orientations ⋮ Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality
Uses Software
Cites Work
- Pattern matching for permutations
- Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths
- Permutation patterns, Stanley symmetric functions, and generalized Specht modules
- Generic rectangulations
- Efficient oracles for generating binary bubble languages
- Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
- Patterns in permutations and words.
- Classical sequences revisited with permutations avoiding dotted pattern
- Binary bubble languages and cool-lex order
- The X-class and almost-increasing permutations
- The Hopf algebra of diagonal rectangulations.
- The enumeration of permutations with a prescribed number of ``forbidden patterns
- When is a Schubert variety Gorenstein?
- Gray coding cubic planar maps
- Combinatorial Gray codes for classes of pattern avoiding permutations
- Skew Dyck paths
- Gray codes for reflectable languages
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- More restrictive Gray codes for some classes of pattern avoiding permutations
- A general exhaustive generation algorithm for Gray structures
- Decompositions and statistics for \(\beta \)(1,0)-trees and nonseparable permutations
- Schubert polynomials and the Littlewood-Richardson rule
- A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length \(n\) is \(2(3n)\)!/(\((n+1)\)!\((2n+1)\)!)
- A Gray code for set partitions
- Forbidden subsequences
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Permutations which are the union of an increasing and a decreasing subsequence
- Pattern avoidance in permutations: Linear and cyclic orders
- Generalized permutation patterns and a classification of the Mahonian statistics
- A combinatorial proof of J. West's conjecture
- A counterexample regarding labelled well-quasi-ordering
- Avoidance of boxed mesh patterns on permutations
- Exhaustive generation of combinatorial objects by ECO
- Reverse search for enumeration
- Permutations with forbidden subsequences and nonseparable planar maps
- Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations
- Restricted compositions and permutations: from old to new Gray codes
- Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations
- Combinatorial generation via permutation languages. II. Lattice congruences
- Exhaustive generation for permutations avoiding (colored) regular sets of patterns
- Enumeration schemes for permutations avoiding barred patterns
- Cambrian Hopf algebras
- Generating trees for permutations avoiding generalized patterns
- A bijection between permutations and floorplans, and its applications
- Grid classes and the Fibonacci dichotomy for restricted permutations
- Permutations generated by a stack of depth 2 and an infinite stack in series
- Cambrian lattices.
- Partially ordered generalized patterns
- Zero-one Schubert polynomials
- $2\times 2$ monotone grid classes are finitely based
- The Greedy Gray Code Algorithm
- Geometric grid classes of permutations
- A stack and a pop stack in series
- Combinatorics of Permutations
- A unification of permutation patterns related to Schubert varieties
- Lattice Theory of the Poset of Regions
- Finite Coxeter Groups and the Weak Order
- Efficient generation of the binary reflected gray code and its applications
- On Rotations and the Generation of Binary Trees
- A Survey of Combinatorial Gray Codes
- A Note on Flips in Diagonal Rectangulations
- Permutation patterns are hard to count
- Hardness of Permutation Pattern Matching
- ECO:a methodology for the enumeration of combinatorial objects
- From the Tamari Lattice to Cambrian Lattices and Beyond
- Quotientopes
- Combinatorial generation via permutation languages
- Finding small patterns in permutations in linear time
- Generation of Permutations by Adjacent Transposition
- Magical Mathematics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Combinatorial generation via permutation languages. I. Fundamentals
