davenport_constant_support
def
D^{(k)}(X): the maximal length (a supremum in ℕ∞) of a minimal zero-sum sequence over X whose support has exactly k elements.
Statement
noncomputable def davenport_constant_support {G : Type*} [AddCommMonoid G] [DecidableEq G] (k : ℕ) (X : Set G) : ℕ∞
- Defined in
- arXiv:2610.16562 (The Davenport constant of low-dimensional boxes), Sec. 1 (the quantity D^{(d+1)}).
- Verified
- 19 Oct 2026
- Axioms
- none listed
- Built on 1
- multiset_is_minimal_zero_sumA minimal zero-sum sequence: a nonempty finite sequence (multiset) with sum zero, no nonempty proper subsequence of which has sum zero.
- Used by 3
- 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_constant_support_le_davenport_constantRestricting the support size can only lower the maximal length: D^{(k)}(X) ≤ D(X).
- davenport_constant_support_four_int_box_three_ge_evenTheorem 3 of arXiv:2610.16562, even m: for every even m ≥ 2, the maximal length of a minimal zero-sum sequence over [[-m,m]]^3 with…
Lean source view module on GitHub
/-- `D^{(k)}(X)`: the supremum of the lengths of minimal zero-sum sequences over `X` whose support has exactly `k` elements. -/ noncomputable def davenport_constant_support {G : Type*} [AddCommMonoid G] [DecidableEq G] (k : ℕ) (X : Set G) : ℕ∞ := sSup {n | ∃ s : Multiset G, (∀ x ∈ s, x ∈ X) ∧ multiset_is_minimal_zero_sum s ∧ s.toFinset.card = k ∧ (Multiset.card s : ℕ∞) = n}