Bijections for restricted inversion sequences and permutations with fixed points

2020/06/24 by Elizalde, Sergi
#05A05 #05A19 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2006.13842

Abstract

We provide a bijective proof of a formula of Auli and the author expressing the number of inversion sequences with no three consecutive equal entries in terms of the number of non-derangements, that is, permutations with fixed points. Additionally, we give bijective proofs of two simple recurrences for the number of non-derangements.

Related

• Bijections for refined restricted permutations
• Lagrange Inversion Counts 35241-Avoiding Permutations
• On (102,000)-avoiding inversion sequences
• A simple bijective proof of a familiar derangement recurrence
• Consecutive patterns in inversion sequences II: avoiding patterns of relations