English

Simple Generating Functions for Certain Young Tableaux with Periodic Walls

Combinatorics 2024-01-29 v1

Abstract

Recently, Banderier et. al. considered Young tableaux with walls, which are similar to standard Young tableaux, except that local decreases are allowed at some walls. We count the numbers fm(n)\overline{f}_m(n) of Young tableaux of shape 2×mn2\times mn with walls, that allow local decreases at the (jm+i)(jm+i)-th columns for all j=0,,n1j=0,\dots, n-1 and i=2,,mi=2,\dots, m. We find that they have nice generating functions (thanks to the OEIS) as follows. Fm(x)=n0fm(n)xn=k=1mC(ek2πimx1m)=exp(n1(2mn1mn1)xnn),\overline{F}_m(x)=\sum_{n\geq 0}\overline{f}_m(n)x^n=\prod_{k=1}^{m}C(e^{k\frac{2\pi i}{m}} x^\frac{1}{m})=\exp \left(\sum_{n\geq 1}\binom{2mn-1}{mn-1}\frac{x^n}{n}\right), where C(x)=114x2xC(x)=\frac{1-\sqrt{1-4x}}{2x} is the well-known Catalan generating function. We prove generalizations of this result. Firstly, we use the Yamanouchi word to transform Young tableaux with horizontal walls into lattice paths. This results in a determinant formula. Then by lattice path counting theory, we obtain the generating functions Fr(x)F_r(x) for the number of lattice paths from (0,0)(0,0) to (nr,kn)(\ell n-r,kn) that never go above the path (NkE)n1NkEr(N^kE^{\ell})^{n-1}N^kE^{\ell-r}, where N,EN,E stand for north and east steps, respectively. We also obtain exponential formulas for F1(x)F_1(x) and F(x)F_\ell(x). The formula for Fm(x)\overline{F}_m(x) is thus proved since it is just F1(x)F_1(x) specializes at k==mk=\ell=m.

Cite

@article{arxiv.2401.14627,
  title  = {Simple Generating Functions for Certain Young Tableaux with Periodic Walls},
  author = {Feihu Liu and Guoce Xin},
  journal= {arXiv preprint arXiv:2401.14627},
  year   = {2024}
}
R2 v1 2026-06-28T14:27:45.680Z