6533b7d7fe1ef96bd1267b8b

RESEARCH PRODUCT

Restricted 123-avoiding Baxter permutations and the Padovan numbers

Toufik MansourVincent Vajnovszki

subject

Discrete mathematicsClass (set theory)Golomb–Dickman constantStirling numbers of the first kindApplied MathematicsPadovan numbersGenerating functionFixed pointCombinatoricsPermutationDiscrete Mathematics and CombinatoricsTree (set theory)Generating treesBaxter permutationsForbidden subsequencesMathematics

description

AbstractBaxter studied a particular class of permutations by considering fixed points of the composite of commuting functions. This class is called Baxter permutations. In this paper we investigate the number of 123-avoiding Baxter permutations of length n that also avoid (or contain a prescribed number of occurrences of) another certain pattern of length k. In several interesting cases the generating function depends only on k and is expressed via the generating function for the Padovan numbers.

yearjournalcountryeditionlanguage
2007-06-01Discrete Applied Mathematics
10.1016/j.dam.2007.03.002http://dx.doi.org/10.1016/j.dam.2007.03.002