English

Proof of Dilks' bijectivity conjecture on Baxter permutations

Combinatorics 2021-12-23 v1

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 Fran\c{c}on--Viennot bijection. As a result, we obtain a permutation interpretation of the (t,q)(t,q)-analog of the Baxter numbers 1[n+11]q[n+12]qk=0n1q3(k+12)[n+1k]q[n+1k+1]q[n+1k+2]qtk, \frac{1}{{n+1\brack 1}_q{n+1\brack 2}_q}\sum_{k=0}^{n-1}q^{3{k+1\choose2}}{n+1\brack k}_q{n+1\brack k+1}_q{n+1\brack k+2}_qt^k, where [nk]q{n\brack k}_q denote the qq-binomial coefficients.

Keywords

Cite

@article{arxiv.2112.11698,
  title  = {Proof of Dilks' bijectivity conjecture on Baxter permutations},
  author = {Zhicong Lin and Jing Liu},
  journal= {arXiv preprint arXiv:2112.11698},
  year   = {2021}
}

Comments

11 pages, 3 figures

R2 v1 2026-06-24T08:27:25.055Z