6533b854fe1ef96bd12aec2a

RESEARCH PRODUCT

Equivalence classes of permutations modulo descents and left-to-right maxima

Jean-luc BarilArmen Petrossian

subject

Discrete mathematicsMathematics::CombinatoricsModulo[ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO][MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]CombinatoricsCatalan numberPermutationMotzkin numberComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]MaximaEquivalence classComputingMilieux_MISCELLANEOUSDescent (mathematics)Bell numberMathematicsMathematicsofComputing_DISCRETEMATHEMATICS

description

Abstract In a recent paper [2], the authors provide enumerating results for equivalence classes of permutations modulo excedances. In this paper we investigate two other equivalence relations based on descents and left-to-right maxima. Enumerating results are presented for permutations, involutions, derangements, cycles and permutations avoiding one pattern of length three.

yearjournalcountryeditionlanguage
2014-06-23
https://hal.archives-ouvertes.fr/hal-01021461