Search arXivSearch

arXiv · 2606.15394

Dominant Zeros of Nekrasov--Okounkov Polynomials

Abstract

We give an exact finite-dimensional Perron--Frobenius realization of the dominant zero of the Nekrasov--Okounkov polynomials $\nop _n(z)$. For a normalized positive sequence $h=(h(n))_{n\ge 1}$ with $h(1)=1$, define $\pol _0^h(z)=1$ and, for $n\ge 1$, \[ \pol _n^h(z)=\frac{z}{h(n)}\sum_{k=1}^n σ(k)\pol _{n-k}^h(z),\] where $σ(k)$ denotes the sum of divisors of $k$. The Nekrasov--Okounkov polynomials are obtained from the specialization $h(n)=n$ by the shift $\nop _n(z)=\pol _n^h(z+1)$. We derive a Hessenberg determinant representation for $\pol _n^h(z)$. After separating the trivial zero at the origin, the remaining zeros of $\pol _n^h(-z)$ are identified with the eigenvalues of an explicit $(n-1)\times(n-1)$ nonnegative matrix $M_n^h$. We prove that $M_n^h$ is primitive and apply Perron--Frobenius theory to show that $\pol _n^h(z)$ has a unique zero of maximal modulus; this zero is real, negative, and simple. As a consequence, the same property holds for the Nekrasov--Okounkov polynomials. We also prove strict monotonicity of the associated spectral radii.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bernhard Heim, Markus Neuhauser, with an appendix by Ken Ono. 2026-06-18. Dominant Zeros of Nekrasov--Okounkov Polynomials. https://arxiv.org/abs/2606.15394

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