Bijections for restricted inversion sequences and permutations with fixed points
From MaRDI portal
Publication:5000293
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 5855009 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 6985711 (Why is no real title available?)
- A Bijection in the Theory of Derangements
- A note on a recursion for the number of derangements
- A simple bijective proof of a familiar derangement recurrence
- Another interpretation of the number of derangements
- Consecutive patterns in inversion sequences
- Consecutive patterns in inversion sequences. II: Avoiding patterns of relations
- Pattern avoidance in inversion sequences
- Patterns in inversion sequences. I.
- Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
- Vincular patterns in inversion sequences
- Wilf equivalences between vincular patterns in inversion sequences
Cited in
(2)
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)