32 citations · 135 across the 28 of their papers we have counts for
Showing 2013 · math.COShow all
2 papers · 2 filters
math.CO2013
An algorithm for deciding the finiteness of the number of simple permutations in permutation classes
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot +1
In this article, we describe an algorithm to determine whether a permutation class C given by a finite basis B of excluded patterns contains a finite number of simple permutations.…
math.CO2013
Combinatorics of non-ambiguous trees
Jean-Christophe Aval, Adrien Boussicault, Mathilde Bouvel +1
This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a…