davenport_constant
def
The Davenport constant D(X) of a subset X of an abelian group: the supremum (in ℕ ∪ {∞}) of the lengths of minimal zero-sum sequences with all terms in X.
Statement
noncomputable def davenport_constant {G : Type*} [AddCommMonoid G] (X : Set G) : ℕ∞
- Defined in
- arXiv:2610.16562 (The Davenport constant of low-dimensional boxes), Sec. 1 (Davenport constant of a subset; taken in ℕ∞ so that no finiteness argument is needed to state it).
- Verified
- 14 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 2
- davenport_constant_support_le_davenport_constantRestricting the support size can only lower the maximal length: D^{(k)}(X) ≤ D(X).
- 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 Davenport constant `D(X)`, as a supremum in `ℕ∞`. -/ noncomputable def davenport_constant {G : Type*} [AddCommMonoid G] (X : Set G) : ℕ∞ := sSup {n | ∃ s : Multiset G, (∀ x ∈ s, x ∈ X) ∧ multiset_is_minimal_zero_sum s ∧ (Multiset.card s : ℕ∞) = n}