6533b851fe1ef96bd12a8bb3
RESEARCH PRODUCT
Cyclic and lift closures for k…21-avoiding permutations
Jean-luc Barilsubject
CombinatoricsCatalan numberDiscrete mathematicsLift (mathematics)PermutationMathematics::CombinatoricsClosure (computer programming)Discrete Mathematics and CombinatoricsTheoretical Computer ScienceCyclic permutationMathematicsdescription
We prove that the cyclic closure of the permutation class avoiding the pattern k(k-1)...21 is finitely based. The minimal length of a minimal permutation is 2k-1 and these basis permutations are enumerated by (2k-1).c"k where c"k is the kth Catalan number. We also define lift operations and give similar results. Finally, we consider the toric closure of a class and we propose some open problems.
year | journal | country | edition | language |
---|---|---|---|---|
2011-01-01 | Discrete Mathematics |