postage_stamp_number_neg
def
n♭_h(k): the largest n_h(A) over sets A of k + 1 integers containing at least one negative integer.
Statement
noncomputable def postage_stamp_number_neg (h k : ℕ) : ℕ
- Defined in
- arXiv:2610.19470 (Positivity and negativity for h-bases for n), Sec. 1 (n♭_h(k)).
- Verified
- 17 Oct 2026
- Axioms
- none listed
- Built on 2
- int_mem_h_fold_sumsetm belongs to the h-fold sumset hA: m is a sum of exactly h, not necessarily distinct, elements of A.
- postage_stamp_basis_rangen_h(A): the largest n such that every integer in [0, n] belongs to hA (A is an h-basis for n).
- Used by 9
- postage_stamp_number_neg_two_add_one_eq_iffFor odd h ≥ 5, the negative-allowed three-stamp number misses n_h(2) = ⌊(h²+6h+1)/4⌋ by exactly one, n♭_h(2) = n_h(2) - 1, if and only if…
- postage_stamp_number_neg_two_add_four_le_of_mod_sixty_eqFor odd h ≥ 5 with h ≡ 59 (mod 60), n♭_h(2) ≤ n_h(2) - 4, where n_h(2) = ⌊(h²+6h+1)/4⌋.
- postage_stamp_number_neg_three_eight_gen♭_8(3) ≥ 99: some 4-element set of integers with a negative element is an 8-basis for 99 (namely {−4, 1, 13, 14}).
- postage_stamp_number_neg_four_one_nine_two_add_six_leFor h = 419 (h ≡ 59 mod 60), the negative-allowed three-stamp number satisfies n♭_h(2) ≤ n_h(2) - 6, where n_h(2) = ⌊(h²+6h+1)/4⌋ = 44519.…
- postage_stamp_number_neg_two_eq_of_mod_four_eq_twoIf h ≥ 2 and h ≡ 2 (mod 4), then n♭_h(2) = n_h(2) = (h² + 6h)/4.
- postage_stamp_number_three_eight_lt_negWith four stamps and h = 8, allowing a negative denomination strictly helps: n_8(3) = 89 < 99 ≤ n♭_8(3). (For three stamps the opposite…
- postage_stamp_number_neg_two_of_odd_sandwichIf every 3-set with a negative element has h-range ≤ n_h(2) - g and one such set reaches n_h(2) - g, then n♭_h(2) + g = n_h(2).
- not_postage_stamp_number_neg_two_of_oddThe statement
postage_stamp_number_neg_two_of_oddis false: at h = 419 (h ≡ 59 mod 60) the conjecture predicts n♭_h(2) = n_h(2) - 4, but… - postage_stamp_number_neg_two_of_odd_of_mod_sixty_neExact value of the negative-allowed three-stamp number for odd h ≥ 5 with h ≢ 59 (mod 60): n_h(2) - n♭_h(2) = 1 if h ≡ 9 (mod 12), 2 if h…
Lean source view module on GitHub
/-- `n♭_h(k)`: the largest `n_h(A)` over `(k+1)`-element sets `A ⊆ ℤ` with a negative element. -/ noncomputable def postage_stamp_number_neg (h k : ℕ) : ℕ := sSup {n | ∃ A : Finset ℤ, A.card = k + 1 ∧ (∃ a ∈ A, a < 0) ∧ postage_stamp_basis_range h A = n}