Proof of Dilks' bijectivity conjecture on Baxter permutations
From MaRDI portal
Publication:6133639
Abstract: Baxter permutations originally arose in studying common fixed points of two commuting continuous functions. In 2015, Dilks proposed a conjectured bijection between Baxter permutations and non-intersecting triples of lattice paths in terms of inverse descent bottoms, descent positions and inverse descent tops. We prove this bijectivity conjecture by investigating its connection with the Franc{c}on--Viennot bijection. As a result, we obtain a permutation interpretation of the -analog of the Baxter numbers frac{1}{{n+1�rack 1}_q{n+1�rack 2}_q}sum_{k=0}^{n-1}q^{3{k+1choose2}}{n+1�rack k}_q{n+1�rack k+1}_q{n+1�rack k+2}_qt^k, where denote the -binomial coefficients.
Recommendations
Cites work
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- A decomposition of ballot permutations, pattern avoidance and Gessel walks
- A good question won't go away: an example of mathematical research
- Baxter permutations and plane bipolar orientations
- Bijections for Baxter families and related objects
- Catalan Numbers
- Doubly alternating Baxter permutations are Catalan
- Eulerian Numbers
- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
- Interpretations combinatoires des nombres de Genocchi
- On Fixed Points of the Composite of Commuting Functions
- Pattern-avoiding inversion sequences and open partition diagrams
- Patterns in permutations and words.
- Permutations selon leurs pics, creux, doubles montees et double descentes, nombres d'Euler et nombres de Genocchi
- Shuffle of parenthesis systems and Baxter permutations
- The On-Line Encyclopedia of Integer Sequences
- The number of Baxter permutations
Cited in
(2)
This page was built for publication: Proof of Dilks' bijectivity conjecture on Baxter permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133639)