Search arXivSearch

arXiv · 2401.14627

Simple Generating Functions for Certain Young Tableaux with Periodic Walls

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 $\overline{f}_m(n)$ of Young tableaux of shape $2\times mn$ with walls, that allow local decreases at the $(jm+i)$-th columns for all $j=0,\dots, n-1$ and $i=2,\dots, m$. We find that they have nice generating functions (thanks to the OEIS) as follows. $$\overline{F}_m(x)=\sum_{n\geq 0}\overline{f}_m(n)x^n=\prod_{k=1}^{m}C(e^{k\frac{2π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)=\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 $F_r(x)$ for the number of lattice paths from $(0,0)$ to $(\ell n-r,kn)$ that never go above the path $(N^kE^{\ell})^{n-1}N^kE^{\ell-r}$, where $N,E$ stand for north and east steps, respectively. We also obtain exponential formulas for $F_1(x)$ and $F_\ell(x)$. The formula for $\overline{F}_m(x)$ is thus proved since it is just $F_1(x)$ specializes at $k=\ell=m$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Feihu Liu, Guoce Xin. 2024-01-26. Simple Generating Functions for Certain Young Tableaux with Periodic Walls. https://arxiv.org/abs/2401.14627

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO