/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/modulepublicimportFormalConjecturesUtil
[Aa19] Aaronson, James. "Maximising the number of solutions to a linear equation in a set of integers."
Bulletin of the London Mathematical Society 51.4 (2019): 577-594.
[HaL28] Hardy, G. H., and J. E. Littlewood. "Notes on the theory of series (VIII): an inequality."
Journal of the London Mathematical Society 1.2 (1928): 105-110.
@[expose]publicsectionopenFilternamespaceGreen24
The maximum number of $\lbrace 0,1,3 \rbrace$ affine translates that a set of size $n$ can
contain.
noncomputabledefmax013AffineTranslates(n:ℕ):ℕ:=sSup{k|∃A:Finsetℤ,A.card=n∧-- Iterate over (x,y) = (a, a + d) in A × A (x ≠ y), and check if a + 3d = x + 3(y - x) ∈ Ak=((A×ˢA).filter(fun(x,y)↦x≠y∧x+3*(y-x)∈A)).card}defgreen_24.answer:ℕ→ℕ:=sorry
If $A$ is a set of $n$ integers, what is the maximum number of affine translates of the set
$\lbrace 0,1,3 \rbrace$ that $A$ can contain?
Conjectured in [Aa19] p.579: $\left(\frac{1}{3} + o(1)\right) n^2$.