An algorithm for deciding the finiteness of the number of simple permutations in permutation classes

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

Type: Article

Publication Date: 2015-01-06

Citations: 6

DOI: https://doi.org/10.1016/j.aam.2014.12.001

View Publication

Locations

Advances in Applied Mathematics - View
arXiv (Cornell University) - View - PDF
HAL (Le Centre pour la Communication Scientifique Directe) - View - PDF

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Deciding the finiteness of simple permutations contained in a wreath-closed class is polynomial	2009	Frédérique Bassino Mathilde Bouvel Adeline Pierrot Dominique Rossin
+ PDF Chat	An algorithm computing combinatorial specifications of permutation classes	2017	Frédérique Bassino Mathilde Bouvel Adeline Pierrot Carine Pivoteau Dominique Rossin
+	A Survey of Simple Permutations	2008	Robert Brignall
+	A survey of simple permutations	2010	Robert Brignall
+	Permutation classes	2014	Vincent Vatter
+	A loopless algorithm for generating the permutations of a multiset	2003	Vincent Vajnovszki
+	Permutation Groups: A Complexity Overview	2003	Ákos Seress
+	Finding the order of a permutation group	1981	Jeffrey S. Leon
+	Sorting of permutations	1974	P. Nivat
+	An algorithm for deciding the finiteness of the number of simple permutations in permutation classes	2013	Frédérique Bassino Mathilde Bouvel Adeline Pierrot Dominique Rossin
+	An algorithm for deciding the finiteness of the number of simple permutations in permutation classes	2013	Frédérique Bassino Mathilde Bouvel Adeline Pierrot Dominique Rossin
+	Enumeration of permutations and sequences with restrictions	1973	L. Carlitz Richard Scoville Theresa P. Vaughan
+ PDF Chat	On the effective and automatic enumeration of polynomial permutation classes	2015	Cheyne Homberger Vincent Vatter
+	Enumeration of permutations with forbidden templates	2001	Yuang-Sheng Zhang
+	Enumerating Permutations Avoiding Three Babson-Steingrímsson Patterns	2005	Antonio Bernini Luca Ferrari Renzo Pinzani
+	Combinatorics of Permutations	2004	Miklós Bóna Miklós Bóna
+	Combinatorics of permutations	2005
+	Modern enumeration theory of permutations with restricted positions	1993	Vladimir Shevelev
+	Polyominoes Determined by Permutations: Enumeration via Bijections	2011	Filippo Disanto Enrica Duchi Renzo Pinzani Simone Rinaldi
+	Intersection theorem for finite permutations	2011	Vladimir Blinovsky

Works That Cite This (6)

Action	Title	Year	Authors
+ PDF Chat	Universal limits of substitution-closed permutation classes	2020	Frédérique Bassino Mathilde Bouvel Valentin Féray Lucas Gerin Mickaël Maazoun Adeline Pierrot
+ PDF Chat	Characterising inflations of monotone grid classes of permutations	2017	Michael Albert Aistis Atminas Robert Brignall
+	Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs	2018	Robert Brignall Ho‐Jin Choi Jisu Jeong Sang‐il Oum
+ PDF Chat	An algorithm computing combinatorial specifications of permutation classes	2017	Frédérique Bassino Mathilde Bouvel Adeline Pierrot Carine Pivoteau Dominique Rossin
+ PDF Chat	Automatic discovery of structural rules of permutation classes	2018	Christian Bean Bjarki Ágúst Guðmundsson Henning Úlfarsson
+ PDF Chat	Growth rates of permutation classes: from countable to uncountable	2019	Vincent Vatter

Works Cited by This (28)

Action	Title	Year	Authors
+	Statistics on pattern-avoiding permutations	2004	Sergi Elizalde
+	Finding All Common Intervals of k Permutations	2001	Steffen Heber Jens Stoye
+ PDF Chat	The Insertion Encoding of Permutations	2005	Michael Albert Steve Linton Nik Ruškuc
+	Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial	2010	Frédérique Bassino Mathilde Bouvel Adeline Pierrot Dominique Rossin
+	Average-case analysis of perfect sorting by reversals (Journal Version)	2012	Mathilde Bouvel Cédric Chauve Marni Mishna Dominique Rossin
+	Analytic Combinatorics	2009	Philippe Flajolet Robert Sedgewick
+	Simple permutations and pattern restricted permutations	2005	Michael Albert M. D. Atkinson
+	On constants in the Füredi–Hajnal and the Stanley–Wilf conjecture	2008	Josef Cibulka
+ PDF Chat	On Partial Well-Order for Monotone Grid Classes of Permutations	2010	Vincent Vatter Steve Waton
+ PDF Chat	Substitution-closed pattern classes	2010	M. D. Atkinson Nik Ruškuc Rebecca Smith