Searcharxiv⌕ Search

arXiv · 2610.28186

Sharp Euler-factor positivity for the BG-rank-refined five-core crank

Abstract

In this paper, we complete the resolution of Stanton's problem OPAC--005 by proving its fixed-BG-rank assertion. We further establish a sharp nine-factor positivity theorem for the joint generating function. Let $K_{n,j}(z)$ enumerate partitions of $5n+4$ with BG-rank $j$ by the integer five-core crank prescribed in OPAC--005, and put $[5]_z=1+z+z^2+z^3+z^4$. We prove that $K_{n,j}(z)/[5]_z$ has nonnegative integer Laurent coefficients for every $n\ge0$ and $j\in \mathbb Z$. The refined equidistribution theorem of Berkovich and Garvan gives divisibility; the new assertion is coefficientwise nonnegativity. Set $Ψ(u,z,q)=\sum_{n\ge0}\sum_{j\in \mathbb Z}q^{n+1}u^jK_{n,j}(z)$ and $D(q)=\prod_{d\ge1}(1-q^{2d})$. For every nonnegative integer $M$, we show that $D(q)^MΨ(u,z,q)/[5]_z$ has nonnegative coefficients if and only if $M\le9$. Thus positivity survives after removing nine of the ten partition factors supplied by the core--quotient decomposition. A coefficient equal to $-4$ at $M=10$ proves sharpness. The key step is a compensation between lattice terms of different core sizes that preserves both the BG-rank and the full integer crank. Theta identities and three local coefficient inequalities provide the required nonnegative contributions, and an explicit allocation ensures that none is used twice. The resulting factorization also yields a nine-color convolution and coefficientwise finite-difference inequalities through order nine.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Huan Xiong. 2026-10-20. Sharp Euler-factor positivity for the BG-rank-refined five-core crank. https://arxiv.org/abs/2610.28186

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

KEEP EXPLORING

Related papers

Transience of walks in the countable complete digraph with complex edge weights

We extend a fragment of the symbolic method in enumerative combinatorics by allowing coefficients in generating functions to be defined by infinite series and generalize Pólya's theorem on random walks. Pólya's theorem determines limits of the probabilities that walks in the grid graph on $\mathbb{Z}^d$, starting at the origin $\overline{0}$, visit the given vertex $\overline{v}$. We generalize the grid graph to the countable complete directed graph $\vec{K}_{\mathbb{N}}$ on the vertices $\mathbb{N}=\{1,2,\dots\}$ and weight its edges by complex numbers. We obtain 16 generalizations of Pólya's theorem. Our approach, in fact, generalizes Markov chains on $\mathbb{N}$ starting at $1$.

math.CO↗

Integral quasi-strongly regular Cayley graphs

Quasi-strongly regular graphs form a significant generalization of strongly regular graphs. We study the eigenvalues of a family of such graphs, $Γ_H(G)$, constructed from a finite group $G$ and a subgroup $H$. Our main results include a sufficient condition for $Γ_H(G)$ to be integral and an explicit computation of its entire spectrum when $H$ is normal, revealing that the spectrum in this case depends only on $|G|$ and the index $[G:H]$.

math.CO↗

Efficient total facial coloring of combinatorial maps

Let $1<k\in\mathbb{Z}$. A total coloring of a connected simple regular graph $G$ via color set $]k]_0=\{0,1,\ldots, k\}$ is efficient if each color yields an efficient dominating set, where efficient domination applies to each color class in $V(G)$. An efficient total coloring of $G$ via $[k]_0$ extends to an efficient total facial coloring $c$ of a map $M(G)$ of $G$ if it assigns a vertex-and-edge $k$-color set to the boundary cycle of each face, with the consequently missing color assigned to the face itself, so that the two adjacent faces along each edge are assigned different colors. Focus is set upon planar and toroidal maps. Modifications of $c$ are also treated by removing a perfect dominating set or a 1-factor from $G$.

math.CO↗