nus_min_card
def
m(p): the least size of a subset of Z/pZ with no unique sums.
Statement
noncomputable def nus_min_card (p : ℕ) : ℕ
- Defined in
- arXiv:2610.09349 (A near-quadratic lower bound for sets with no unique sums), Sec. 1 (m(p) = min{|A| : A ⊆ F_p NUS}); written as an infimum over subsets of ZMod p.
- Verified
- 09 Oct 2026
- Axioms
- none listed
- Built on 1
- finset_has_no_unique_sumsA has no unique sums (is NUS): |A| ≥ 2 and every sum a + b with a, b ∈ A has at least two representations as an unordered pair from A.
- Used by 7
- nus_min_card_ge_near_quadratic_of_rank_hadamard_boundIf every NUS set A ⊆ Z/pZ satisfies log p ≤ K(√|A| + |A|/log p)·log|A| with K ≥ 1, then m(p) ≥ (1/(32K²))(log p/log log p)² for every…
- nus_min_card_five_eq_fourThe minimal size of a set with no unique sums in Z/5Z is exactly 4 (witness {0,1,2,3}; no set of size ≤ 3 works).
- nus_min_card_seven_eq_fiveThe minimal size of a set with no unique sums in Z/7Z is exactly 5 (witness {0,1,2,3,4}; every set of size ≤ 4 fails).
- nus_min_card_three_eq_threeThe minimal cardinality of a set with no unique sums in Z/3Z is exactly 3.
- nus_min_card_le_of_has_no_unique_sumsIf A is a subset of Z/pZ with no unique sums, then m(p) ≤ |A|.
- nus_min_card_le_sq_of_midpoint_balancedIf B is a midpoint-balanced subset of Z/pZ, then m(p) ≤ |B|².
- nus_min_card_ge_one_add_clogFor an odd prime p, m(p) ≥ 1 + ⌈log₂ p⌉: every subset of Z/pZ with no unique sums has at least 1 + ⌈log₂ p⌉ elements.
Lean source view module on GitHub
/-- `m(p)`: the least size of a subset of `ZMod p` with no unique sums. -/ noncomputable def nus_min_card (p : ℕ) : ℕ := sInf {k | ∃ A : Finset (ZMod p), finset_has_no_unique_sums A ∧ A.card = k}