Bijections for restricted inversion sequences and permutations with fixed points

zbMATH Open1468.05006arXiv2006.13842MaRDI QIDQ5000293FDOQ5000293

Sergi Elizalde

Publication date: 12 July 2021

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.

Full work available at URL: https://arxiv.org/abs/2006.13842

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Patterns in inversion sequences. I.
• A note on a recursion for the number of derangements
• Wilf equivalences between vincular patterns in inversion sequences
• Another interpretation of the number of derangements
• A Bijection in the Theory of Derangements
• Pattern avoidance in inversion sequences
• Consecutive Patterns in Inversion Sequences
• A simple bijective proof of a familiar derangement recurrence
• Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations
• Vincular patterns in inversion sequences
• Consecutive patterns in inversion sequences II: avoiding patterns of relations

Cited In (1)

• Alphabetic Points and Records in Inversion Sequences

Uses Software

• OEIS

This page was built for publication: Bijections for restricted inversion sequences and permutations with fixed points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5000293)