An algorithm computing combinatorial specifications of permutation classes

DOI10.1016/j.dam.2017.02.013zbMath1361.05004arXiv1506.00868OpenAlexW2963990188MaRDI QIDQ526814

Mathilde Bouvel, Adeline Pierrot, Dominique Rossin, Carine Pivoteau, Frédérique Bassino

Publication date: 15 May 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

generating functionpattern avoidancepermutation classcombinatorial specificationrandom sampler

Mathematics Subject Classification ID

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

Related Items (5)

Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers ⋮ Scaling limits of permutation classes with a finite specification: a dichotomy ⋮ Exact-Size Sampling of Enriched Trees in Linear Time ⋮ Automatic discovery of structural rules of permutation classes ⋮ Combinatorial specifications for juxtapositions of permutation classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pattern matching for permutations
• The shape of random pattern-avoiding permutations
• Algorithms for combinatorial structures: well-founded systems and Newton iterations
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Counting \(\mathbf {(3+1)}\)-avoiding permutations
• A calculus for the random generation of labelled combinatorial structures
• The Brownian limit of separable permutations
• An algorithm for deciding the finiteness of the number of simple permutations in permutation classes
• Inflations of geometric grid classes of permutations
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• Simple permutations and algebraic generating functions
• Enumerating indices of Schubert varieties defined by inclusions
• Simple permutations: Decidability and unavoidable substructures
• Simple permutations and pattern restricted permutations
• Structure of random 312-avoiding permutations
• Geometric grid classes of permutations
• The enumeration of permutations avoiding 2143 and 4231
• Permutation classes
• A Survey of Simple Permutations
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• Large Deviations and Ratio Limit Theorems for Pattern-Avoiding Permutations
• Pattern‐avoiding permutations and Brownian excursion part I: Shapes and fluctuations

This page was built for publication: An algorithm computing combinatorial specifications of permutation classes