Universal optimality on finite Lee tori

We study subsets of finite Lee tori that minimize pair energy among sets of the same cardinality for every discretely completely monotone potential. At half occupancy on a product of even cycles, the two checkerboards minimize both total pair energy and maximum individual energy. They are the only minimizers for every nonconstant classical completely monotone potential on $(0,\infty)$, proving the checkerboard conjecture of Bouman, Draisma, and van Leeuwaarden for this class. At the independence number of the distance one graph on $\Z_q^n$, universally optimal sets exist exactly when $q$ is even, $q=3$, $n=1$, or $(q,n)=(5,2)$. In these cases they are precisely the maximum independent sets and form a single Lee isometry class. At density $1/5$ in $\Z_5^n$, $n\ge2$, universal optimality is characterized by a weighted count of pairs at distances one and two. We prove these results using integer box occupancy bounds that strengthen Fourier linear programming and, in the quinary case, Fourier certificates with a common zero set.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.16377
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Universal optimality on finite Lee tori

Tao Zhang
arXiv (Cornell University)
Advanced Combinatorial Mathematics
preprint

Universal optimality on finite Lee tori

Tao Zhang
preprint en

Abstract

We study subsets of finite Lee tori that minimize pair energy among sets of the same cardinality for every discretely completely monotone potential. At half occupancy on a product of even cycles, the two checkerboards minimize both total pair energy and maximum individual energy. They are the only minimizers for every nonconstant classical completely monotone potential on $(0,\infty)$, proving the checkerboard conjecture of Bouman, Draisma, and van Leeuwaarden for this class. At the independence number of the distance one graph on $\Z_q^n$, universally optimal sets exist exactly when $q$ is even, $q=3$, $n=1$, or $(q,n)=(5,2)$. In these cases they are precisely the maximum independent sets and form a single Lee isometry class. At density $1/5$ in $\Z_5^n$, $n\ge2$, universal optimality is characterized by a weighted count of pairs at distances one and two. We prove these results using integer box occupancy bounds that strengthen Fourier linear programming and, in the quinary case, Fourier certificates with a common zero set.

arXiv (Cornell University)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon