Restricted 123-avoiding Baxter permutations and the Padovan numbers

Authors:
Toufik Mansour;Vincent Vajnovszki
Affiliations:
Department of Mathematics, University of Haifa, 31905 Haifa, Israel;LE2I, Université de Bourgogne, BP 47870, 21078 Dijon Cedex, France
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 4
Cited 0

Shuffle of parenthesis systems and Baxter permutations

Journal of Combinatorial Theory Series A
Enumerative combinatorics

Enumerative combinatorics
Generating trees and forbidden subsequences

Proceedings of the 6th conference on Formal power series and algebraic combinatorics
Doubly alternating Baxter permutations are Catalan

Discrete Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

Baxter 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.