Graham's rearrangement conjecture in finite abelian groups

Peiru Kuang; Yan Wang

Home/Archive/arXiv

arXiv · 2610.34424

Graham's rearrangement conjecture in finite abelian groups

Peiru Kuang·Yan Wang

View original source ↗Read source document ↗Export metadata ↓

Abstract

Graham conjectured in 1971 that every subset of the nonzero elements of a prime cyclic group admits an ordering with pairwise distinct nonempty partial sums. Recently, the work of Pham and Sauermann, together with earlier results, settled this conjecture for all sufficiently large primes. In this paper, we prove that there is an absolute integer $n_0$ such that every subset $S\subseteq G\setminus\{0\}$ of a finite abelian group with $|S|\ge n_0$ admits such an ordering, which also solves a conjecture of Alspach and Liversidge for all sufficiently large sets. A key ingredient of our proof is a sufficient condition via additive dimension: If $|S|=n$ and $S$ contains a dissociated subset of size at least $Ω((\log n)^2/\log\log n)$, then $S$ has an ordering in which no proper nonempty interval of consecutive terms sums to zero. This bound is within a factor of $O(\log n/\log\log n)$ of the smallest possible additive dimension of an $n$-element set.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Peiru Kuang, Yan Wang. 2026-10-25. Graham's rearrangement conjecture in finite abelian groups. https://arxiv.org/abs/2610.34424

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

KEEP EXPLORING

Related papers

arXiv2026

A spanning tree model for chromatic homology

After the discovery of Khovanov homology, which categorifies the Jones polynomial, an analogous categorification of the chromatic polynomial, known as chromatic homology, was introduced. Its graded Euler characteristic recovers the chromatic polynomial. In this paper, we present a spanning tree model for the chromatic complex, i.e., we describe a chain complex generated by certain spanning trees of the graph that is chain homotopy equivalent to the chromatic complex. We employ the spanning tree model over $\mathcal{A}_m:= \frac{\mathbb{Z}[x]}{ }$ algebra to answer two open questions. First, we establish the conjecture posed by Sazdanovic and Scofield regarding the homological span of chromatic homology over $\mathcal{A}_m$ algebra, demonstrating that for any graph $G$ with $v$ vertices and $b$ blocks, the homological span is $v - b$. Additionally, we prove a conjecture of Helme-Guizon, Przytycki, and Rong concerning the existence of torsion of order dividing $m$ in chromatic homology over $\mathcal{A}_m$ algebra.

math.CO↗

arXiv2026

There Are No Nontrivial Perfect Codes in the Johnson Scheme

In his seminal work from 1973, Delsarte conjectured that the Johnson schemes admit no nontrivial perfect codes. We prove this fundamental conjecture which is central in combinatorial coding theory. Our arguments combine lower bounds on the design strength of a perfect code with divisibility conditions for the size of a metric ball. We show that the ball size divides the greatest common divisor of specified binomial coefficients. An exact formula for this gcd implies squarefreeness and localizes a power of each prime divisor of the ball size to a short interval. Lloyd polynomials, explicit prime estimates, and bounds for linear forms in logarithms then exclude all sufficiently large radii. Additional arithmetic arguments handle the remaining radii.

math.CO↗

arXiv2026

Upper $k$-Star-Forming Sets, $k$-Independence, and Upper Domination

For a positive integer $k$, let $β_k(G)$ be the maximum cardinality of a vertex set inducing maximum degree less than $k$, and let $SF_k(G)$ be the maximum cardinality of a minimal $k$-star-forming set. The known inequality $β_k(G)\le SF_k(G)$ suggests asking when equality holds. We place this question in the framework of upper domination: at $k=1$, $β_1(G)=α(G)$ and $SF_1(G)=Γ(G)$, so the classical equality $Γ=α$ on bipartite graphs is exactly the first member of the proposed hierarchy. We prove the equality for complete bipartite graphs for every $k$, obtaining \[ β_k(K_{a,b})=SF_k(K_{a,b})=\max\{a,b,2k-2\}\qquad(a,b\ge k), \] and record the elementary low-degree case $Δ(G)<k$. For $k=2$ we derive certificate restrictions for minimal $2$-star-forming sets in bipartite graphs. For chain graphs we go further: we prove $β_2(G)=SF_2(G)$ and obtain an exact formula for their common value. The proof uses the nested-neighborhood structure together with a classification of witnesses to the indispensability of a high internal-degree vertex. We retain the equality problem for chain graphs as a conjecture only for $k\ge3$, and formulate the broader bipartite conjecture. We also determine the upper domination number of every rectangular grid and combine it with the known exact dissociation number to compare $Γ$, $β_2$, and $SF_2$. In particular, $Γ=β_2$ on every even-by-even rectangular grid, while $β_2\le SF_2$ always; this motivates a grid equality conjecture whose even-by-even case would yield a three-parameter identity.

math.CO↗