davenport_box_three_odd_sequence
def
The sequence T(m) for odd m: (-m,-m,-m) repeated 4m^3-8m^2+5m-2 times, (-m,m-1,m) repeated 4m^3-2m^2+2m times, (m,-m,m-2) repeated 4m^3-2m^2+m times and (m-1,m,-m) repeated 4m^3-4m^2+2m times.
Statement
def davenport_box_three_odd_sequence (m : ℕ) : Multiset (Fin 3 → ℤ)- Defined in
- arXiv:2610.16562 (The Davenport constant of low-dimensional boxes), Sec. 4, the sequence T(m) for odd m (proof of Theorem 3).
- Verified
- 19 Oct 2026
- Axioms
- none listed
- Used by 4
- davenport_constant_support_four_int_box_three_ge_oddTheorem 3 of arXiv:2610.16562, odd m: for every odd m ≥ 2, the maximal length of a minimal zero-sum sequence over [[-m,m]]^3 with support…
- davenport_box_three_odd_sequence_sumThe sequence T(m) (odd case) is a zero-sum sequence, for every m ≥ 2.
- davenport_box_three_odd_sequence_minimalFor m ≥ 2 odd, T(m) is a minimal zero-sum sequence: no proper nonempty subsequence sums to zero.
- davenport_box_three_odd_sequence_cardThe sequence T(m) (odd case) has length 16m^3 - 16m^2 + 10m - 2.
Lean source view module on GitHub
/-- The odd-`m` sequence `T(m)` of arXiv:2610.16562 Sec. 4. -/ def davenport_box_three_odd_sequence (m : ℕ) : Multiset (Fin 3 → ℤ) := Multiset.replicate (4 * m ^ 3 - 8 * m ^ 2 + 5 * m - 2) ![-(m : ℤ), -m, -m] + Multiset.replicate (4 * m ^ 3 - 2 * m ^ 2 + 2 * m) ![-(m : ℤ), m - 1, m] + Multiset.replicate (4 * m ^ 3 - 2 * m ^ 2 + m) ![(m : ℤ), -m, m - 2] + Multiset.replicate (4 * m ^ 3 - 4 * m ^ 2 + 2 * m) ![(m : ℤ) - 1, m, -m]