Search arXivSearch

arXiv · 2603.25554

Counting 3-way contingency tables via quiver semi-invariants

Abstract

Let $\mathbf{T}_{\mathbf{a},\mathbf{b}}$ be the number of $3$-way contingency tables of size $m \times n \times p$ with two of its three plane-sum margins fixed by $\mathbf{a}=(a_1, \ldots, a_m) \in \mathbb{N}^m$ and $\mathbf{b}=(b_1, \ldots, b_n) \in \mathbb{N}^n$. When $p=1$, this is the number of $m \times n$ non-negative integer matrices whose row and column sums are fixed by $\mathbf{a}$ and $\mathbf{b}$. In this paper, we study the numbers $\mathbf{T}_{\mathbf{a},\mathbf{b}}$ through the lens of quiver invariant theory. Let $\mathcal{Q}^{p}_{m,n}$ be the $p$-complete bipartite quiver with $m$ source vertices, $n$ sink vertices, and $p$ arrows from each source to each sink. Let $\mathbf{1}$ denote the dimension vector of $\mathcal{Q}^{p}_{m,n}$ that takes value $1$ at every vertex of $\mathcal{Q}^{p}_{m,n}$, and let $θ_{\mathbf{a}, \mathbf{b}}$ denote the integral weight that assigns $a_i$ to the $i^{th}$ source vertex and $-b_j$ to the $j^{th}$ sink vertex of $\mathcal{Q}^{p}_{m,n}$. We begin by realizing $\mathbf{T}_{\mathbf{a},\mathbf{b}}$ as the dimension of the space of semi-invariants associated to $(\mathcal{Q}^{p}_{m,n}, \mathbf{1}, θ_{\mathbf{a}, \mathbf{b}})$. Using this connection and methods from quiver invariant theory, we show that $\mathbf{T}_{\mathbf{a},\mathbf{b}}$ is a parabolic Kostka coefficient. In the case $p=1$, this recovers the formula for the number of the $m \times n$ contingency tables with row and column sums fixed by $\mathbf{a}$ and $\mathbf{b}$, which in the classical $2$-way setting can also be obtained via the Robinson-Schensted-Knuth correspondence.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Calin Chindris, Deepanshu Prasad. 2026-08-06. Counting 3-way contingency tables via quiver semi-invariants. https://arxiv.org/abs/2603.25554

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO