davenport_box_extremal_sequence
def
The sequence S(m): q(m)(m−1)+m copies of (m, m), 2m² − m·q(m) copies of (−m, m−1), and 2m² − m copies of (m − q(m), −m).
Statement
noncomputable def davenport_box_extremal_sequence (m : ℕ) : Multiset (ℤ × ℤ)
- Defined in
- arXiv:2610.16562 (The Davenport constant of low-dimensional boxes), Sec. 2 (the sequence S(m), before Theorem 1).
- Verified
- 14 Oct 2026
- Axioms
- none listed
- Built on 1
- nat_least_prime_not_dvdq(m): the smallest prime number not dividing m (0 by convention for m = 0, which no prime fails to divide).
- Used by 1
- davenport_constant_int_box_two_geFor every m ≥ 2, the Davenport constant of the box ⟦−m, m⟧² is at least 4m² − q(m), q(m) the smallest prime not dividing m: S(m) is a…
Lean source view module on GitHub
/-- The sequence `S(m)` of arXiv:2610.16562. -/ noncomputable def davenport_box_extremal_sequence (m : ℕ) : Multiset (ℤ × ℤ) := Multiset.replicate (nat_least_prime_not_dvd m * (m - 1) + m) ((m : ℤ), (m : ℤ)) + Multiset.replicate (2 * m ^ 2 - m * nat_least_prime_not_dvd m) (-(m : ℤ), (m : ℤ) - 1) + Multiset.replicate (2 * m ^ 2 - m) ((m : ℤ) - nat_least_prime_not_dvd m, -(m : ℤ))