Search arXivSearch

arXiv · 2609.17561

A closed form for the block-statistic generating function of the $2\times n$ rectangle: the two-row case of Kahane's conjecture

Abstract

Kahane (arXiv:2607.11225) proves that for a fence poset $P$ of size $n$, $n!\,Ω(P;t)=\sum_{σ\in S_n} t^{\mathrm{bl}(σ)}$, with $\mathrm{bl}(σ)$ a canonical block count, and conjectures (Conjecture 4.4) that the identity extends to the cell poset of any skew shape, with $\mathrm{bl}$ replaced by a constructively-defined extension $\widetilde{\mathrm{bl}}$. We prove the conjecture for every $2\times n$ rectangle -- the first genuinely two-dimensional case, where blocks are no longer path-intervals and the statistic is a correlated function of both rows. We introduce a two-parameter growth-state generating function $W_n(α,β;t)$ refining $\sum_σt^{\widetilde{\mathrm{bl}}(σ)}$ by the rank $α$ of the bottom-row minimum and the rank $β$ of the rightmost top cell's block-root, and prove the closed form $W_n(α,β;t)=(α-1)!\,B(n,β-2)\,S_n(α,β;t)$ ($n\ge 1$), where $B(n,k)$ is the Catalan triangle and $S_n$ a rising-factorial skeleton. The proof is an induction on $n$ through Kahane's column-insertion transition, whose load-bearing structural fact -- the block-root below a newly inserted top cell is always the global bottom-row minimum -- reduces the induction to a Catalan-triangle computation. Summing over $(α,β)$ telescopes to $C_n\,t^{\overline{n}}(t+1)^{\overline{n}}$, which by MacMahon's product formula equals $(2n)!\,Ω(R_{2,n};t)$. Every load-bearing step is a complete general-$n$ argument; the transition table and the inductive step are cross-checked by exhaustive enumeration (through $n=8$ and $n=9$) via an independent from-scratch implementation. General skew shapes and $m>2$ rows remain open.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Patrick White. 2026-07-22. A closed form for the block-statistic generating function of the $2\times n$ rectangle: the two-row case of Kahane's conjecture. https://arxiv.org/abs/2609.17561

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