2 citations · 2 across the 1 of their papers we have counts for
2 papers
math.CO2007★ 2 cited
Longest Common Separable Pattern between Permutations
Mathilde Bouvel, Dominique Rossin, Stephane Vialette
In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time algorithm when the number of input per…
math.CO2006
Some statistics on permutations avoiding generalized patterns
A. Bernini, m. Bouvel, L. Ferrari
In the last decade a huge amount of articles has been published studying pattern avoidance on permutations. From the point of view of enumeration, typically one tries to count perm…