Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Haviv and Levy, Symmetric complete sum-free sets in cyclic groups, Israel J. Math. 227 (2018), no. 2, 931--956, DOI 10.1007/s11856-018-1754-5 (Crossref record read); arXiv:1703.04118, first version 2017-03-12, the claim's date; an extended abstract appeared in Electron. Notes Discrete Math. 61 (2017), 585--591 (card).

The result. Theorem 1.5: there is a constant c>0c>0 such that every sufficiently large cyclic group Zn\mathbb Z_n contains a symmetric complete sum-free subset of size at most cnc\sqrt n (symmetric: S=−SS=-S; sum-free: no a+b=ca+b=c in SS; complete: every element outside S∪{0}S\cup\{0\} is a sum of two elements of SS). The paper's Section 1 records the observation of Hanson and Seyffarth that the Cayley graph of Zn\mathbb Z_n with connection set SS is then an ∣S∣|S|-regular triangle-free graph of diameter 22 on nn vertices: symmetry makes the graph undirected, sum-freeness excludes triangles, and completeness gives every nonadjacent pair a common neighbor. Hence f(n)≤cnf(n)\le c\sqrt n for every large nn, and with the trivial bound f(n)≥n−1f(n)\ge\sqrt{n-1} the order of growth of f(n)f(n) is n\sqrt n; the Erdős--Pach question whether f(n)/n→∞f(n)/\sqrt n\to\infty is answered no. The paper presents the theorem as extending Hanson and Seyffarth's construction, which covers the sequence n=m2+5m+2n=m^2+5m+2, to every nn. The constant cc is not made explicit, and the site's commentary records the paper as giving an alternative construction of the symmetric complete sum-free sets behind Hanson and Seyffarth's bound. The sequence case is Hanson and Seyffarth's and the sharper constant for all large nn is Füredi and Seress's; this claim uses neither.

Depends on. Nothing in this wiki.

Acceptance. Refereed publication in the Israel Journal of Mathematics, cited with its venue above. The site's curator, Thomas Bloom, marks the problem DISPROVED and credits the paper, under the reference [HaLe18], with an alternative construction of the complete sum-free sets behind the bound; that credit is the reviewed evidence, and Bloom took no part in the paper. No independent review of the argument was made here; the theorem and the deduction to f(n)f(n) were read, and no proof step of Theorem 1.5 was checked.