Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2406.07838

Capacity bounds on integral flows and the Kostant partition function

Jonathan Leake·Alejandro H. Morales
View original source ↗Read source document ↗Export metadata ↓

Abstract

The type $A$ Kostant partition function is an important combinatorial object with various applications: it counts integer flows on the complete directed graph, computes Hilbert series of spaces of diagonal harmonics, and can be used to compute weight and tensor product multiplicities of representations. In this paper we study asymptotics of the Kostant partition function, improving on various previously known lower bounds and settling conjectures of O'Neill and Yip. Our methods build upon recent results and techniques of Brändén-Leake-Pak, who used Lorentzian polynomials and Gurvits' capacity method to bound the number of lattice points of transportation and flow polytopes. Finally, we also give new two-sided bounds using the Lidskii formulas from subdivisions of flow polytopes.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jonathan Leake, Alejandro H. Morales. 2024-11-22. Capacity bounds on integral flows and the Kostant partition function. https://arxiv.org/abs/2406.07838

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗