Kummer sets

Claims · 10 dated claims on Kummer sets, each with its tag and its witness; newest 2026-10-05.

10 claims
  • Proved At every prime p >= 5 the integers k with p not dividing C(3k, k) are the words accepted by a two-state carry automaton read from the units digit: in state c a digit d moves to state 0 when 3d + c <= p - 1, to state 1 when 2d + c >= p and 3d + c <= 2p - 1, and is refused otherwise; the kernels are four intervals, each state keeps (p+1)/2 digits and the pair {0, 1}, the set is a width-2 rule and no digit design. Witness: notes/kummer.md, section The carry automaton.
  • Verified The carry automaton of {k : p does not divide C(3k, k)} agrees with Kummer's carry count (s_p(k) + s_p(2k) - s_p(3k))/(p - 1) at every k < p^5 for p = 5, 7, 11, 13 and 101, the last through the exact split k = 101^2 q + r, with 0 mismatches and 345025251 = 51^5 members below 101^5. Witness: lab/py/kummer-carry, verb kummer.
  • Proved For every a > b >= 1 and prime p > a every carry state of the automaton of {k : p does not divide C(ak, bk)} keeps exactly (p+1)/2 digits, so the set holds exactly ((p+1)/2)^L integers below p^L, the half interval's mass exponent log((p+1)/2)/log p at every pair, and at p >= 2a - 1 every state keeps the pair {0, 1} into state (0, 0). Witness: notes/kummer.md, section The mass of every Kummer set.
  • Proved At every prime p >= 13 the set K of k with p not dividing C(3k, k) carries a shifted-grid matrix transfer certificate in the row-0 basis, C_F = 1 + eta and p^alpha_1 = lambda/fill with lambda the Perron root of an explicit 2 x 2 matrix of closed forms, and lambda/fill <= 1.180479 log p + 7.482879. Witness: notes/kummer.md, section The certificate.
  • Proved The matrix certificate of {k : p does not divide C(3k, k)} has alpha_1 < 1/5 at every prime p >= 13567831, certified at 120 bits at all 34446 primes 13567831..14133194 with a monotone tail beyond and failing at 13567811, and alpha_1 < 1/4 at every prime p >= 227189. Witness: notes/kummer.md, section The certificate, bullet The wall; lab/py/kummer-carry, verb wall.
  • Proved At every prime p >= 13567831, with K = {k : p does not divide C(3k, k)} and A_K(x), M_K(x), psi_K(x) the count and the sums of mu(k) and Lambda(k) over k in K up to x, abs(M_K(x)) <= C A_K(x) exp(-c sqrt(log x)) and abs(psi_K(x) - (p/(p+1)) A_K(x)) <= C A_K(x) exp(-c sqrt(log x)) at every x >= 2, with C and c computable from p. Witness: notes/kummer.md, section The theorem on the Kummer set.
  • Proved For every a > b >= 1 and prime p >= 2a - 1 at which {k : p does not divide C(ak, bk)} carries a matrix transfer certificate below 1/5, the Mobius bound and the prime count with constant p/(p+1) hold on it with a saving exp(-c sqrt(log x)). Witness: notes/kummer.md, section Every pair (a, b), bullet The theorem on a certificate.
  • Proved The row-0 design of {k : p does not divide C(ak, bk)} has limit numerator of mean 3 - 4 gcd(a, b)/a over a period at shift 0, which is 1 at (2, 1), 5/3 at (3, 1) and 2 at (4, 1). Witness: notes/kummer.md, section Every pair (a, b), bullet The row-0 constant; lab/py/kummer-carry, verb family.
  • Conjecture The row-0 transfer operator of {k : p does not divide C(3k, k)} has rate (10/(3 pi)) log p + O(1) against (p+1)/2; power iteration reads offsets 3.25 to 3.40 at primes 1009 to 100003, and the exact grid sums of the set read offsets 1.39 to 1.49, within 0.065 of the row-0 design, which carried to the bar 1/5 meet p^(1/5) near 2.44 * 10^6 and 1.15 * 10^6. Witness: lab/py/kummer-carry, verb rate.
  • Conjecture For every a > b >= 1 the row-0 operator of {k : p does not divide C(ak, bk)} has rate (2/pi)(3 - 4 gcd(a, b)/a) log p + O_a(1) against (p+1)/2, so the set carries a certificate below 1/5 and the Mobius bound and prime count from some prime P_0(a, b); the rate is read only at (3, 1), and at a <= 7 only the limit constant and the row deviations at p = 10007 are computed. Witness: lab/py/kummer-carry, verbs rate and family.