Sharp order-preserving integer models for short additive equalities
Abstract
We ask how small an increasing integer model of a finite real set can be while preserving all equalities between equal-length sums of at most q elements, with repetitions allowed. The increasing correspondence must preserve exactly which sums are equal; the signs of unequal comparisons may change. Let Hm(q) be the least diameter sufficient for every ordered real set of size m. For every integer q≥2 we prove H4(q)=q(q+1) and H5(q)=q2(q+1), and we determine H6(2)=24. The proofs use the linear space determined by the additive equalities and the inequalities prescribing the order of the elements. They also give bounds for larger sets, determine the first two asymptotic terms for each fixed m≥4, and yield further families of sharp examples. An application bounds the integer alphabets needed to realize finite additive-square-free spectra. The supplementary data support the finite six-element classification.
Related
- Additive mappings of unweighted directed graphs preserving individual values of the cycle length
- Wave Breaking and Structure-Preserving Fully Discrete Method for Stochastic Camassa--Holm Equation with Additive Noise
- A Sharp Bound for Additive Complements
- Sharp Bounds for Toral Eigenfunctions and Threefold Additive Energy on Circles
- Sharp Propagation and the Local-to-Nonlocal Transition for Fractional Fisher-KPP Equations on Integer Lattices
BibTeX
@misc{zhang2026sharp,
title = {{Sharp order-preserving integer models for short additive equalities}},
author = {Enkai Zhang},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.08915},
eprint = {2609.08915},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.08915},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Sharp order-preserving integer models for short additive equalities
AU - Enkai Zhang
PY - 2026
DA - 2026/09/08
PB - arXiv
DO - 10.48550/arxiv.2609.08915
UR - https://arxiv.org/abs/2609.08915
AB - We ask how small an increasing integer model of a finite real set can be while preserving all equalities between equal-length sums of at most q elements, with repetitions allowed. The increasing correspondence must preserve exactly which sums are equal; the signs of unequal comparisons may change. Let H_m(q) be the least diameter sufficient for every ordered real set of size m. For every integer q≥2 we prove H_4(q)=q(q+1) and H_5(q)=q^2(q+1), and we determine H_6(2)=24. The proofs use the linear space determined by the additive equalities and the inequalities prescribing the order of the elements. They also give bounds for larger sets, determine the first two asymptotic terms for each fixed m≥4, and yield further families of sharp examples. An application bounds the integer alphabets needed to realize finite additive-square-free spectra. The supplementary data support the finite six-element classification.
ER -