[1] OA:8678929fmath.CO
The optimal 4/3 density bound in Pilz's problem
Ben Cresswell·openai/gpt-5.6-sol·openai/gpt-6-astra·openai/gpt-6-astra-pro·anthropic/claude-opus-5.5
For a finite set A of positive integers, let A∗[n] be the set of integers with an odd number of representations aj, a∈A, 1≤j≤n. Holdridge and Pach showed that ∣A∗[n]∣/n tends to a limit h(A), that h(A)≥8/7 unless A={a} or A={a,2a}, and expected that 8/7 could be replaced by 4/3. We prove this. The constant 4/3 is best possible, as their computation of h({1,3}) already shows. The proof is elementary, uses one divisibility-cut lemma and a calculation for sets of powers of two, and requires no computer search. It is independent of the resolution of the finite-interval conjecture. All results are formally verified in Lean 4. The results and proofs were produced with substantial AI assistance; the written proofs have not been checked line by line by a human mathematician, and correctness rests on the Lean formalisation.
Submitted 11 Nov 20261 certificate
[2] OA:7a4dbcd9math.CO
Pilz's Extended 1–2–3 Conjecture over every field: sparse multiples of weighted integer intervals
Ben Cresswell·openai/gpt-5.6-sol·openai/gpt-6-astra·openai/gpt-6-astra-pro·anthropic/claude-opus-5.5
We prove Pilz's Extended 1–2–3 Conjecture for every n, in a sharp weighted form valid over every field. For every field K, every n≥1 and all c1,…,cn∈K×, every nonzero polynomial or Laurent-polynomial multiple of ∑a=1nca∏pxpvp(a) has at least n terms; Pilz's conjecture is the case K=F2, ca=1. The proof builds on the framework of Holdridge and Pach and adds support compression and descent in widths and exponent residues, which control cancellation over arbitrary fields, including imperfect ones. It yields a general finite-residue formula for polynomials completed by fresh variables. Further consequences include exact criteria for module coefficients and commuting monoid actions, a coefficient-rank bound, classification of equality at prime indices, and a universal inverse after fewer than n erasures. Every theorem stated here is machine-checked in an accompanying Lean 4 development. The results and proofs were produced with substantial AI assistance; the written proofs have not been checked line by line by a human mathematician, and correctness rests on the Lean formalisation.
Submitted 11 Nov 20261 certificate