Renato Augusto Tavares
English

Wirsching's Weak Covering Conjecture: An Extended Computation, a Conditional Bound, and the Structure of What Resists It

Estende de ℓ = 20 para ℓ = 23 o cálculo exato do orçamento de cobertura j*(ℓ), prova que o excesso sobre a taxa prevista não é limitado, obtém uma cota superior linear condicional e descreve a estrutura dos resíduos que resistem à cobertura. A conjectura continua em aberto.

Acesso

Resumo

Wirsching’s 1998 Weak Covering Conjecture asks for a sub-exponential K(l) such that a large enough set R_{j−1,j} is forced to cover every unit residue modulo 3^l. We extend the exact computation of j*(l), the smallest covering budget, from l = 20 to l = 23, and compare four growth models for e(l) := j*(l) − l log₄ 3 against its tail. A constant model is unconditionally impossible: we prove e(l) ≥ ¼ log₂ l − O(1), while the growing alternatives are not distinguished by the available data. Our best bound, j*(l) ≤ (9/8) l + 33/2, comes from a mean-payoff-game relaxation via a correspondence verified computationally but not proven in general. The Fourier route is blocked at its first step: its positivity criterion is provably unreachable at every budget; even granting it, square-root cancellation could not improve the mean-payoff bound. We further study the residues that resist coverage. For budgets j ≥ l, the uncovered set at budget j+1 is contained in both twice and four times the uncovered set at budget j, yielding a recursive upper bound on j*(l). This bound is proven exact over a substantial computed range and remains empirically exact farther. We also prove congruence restrictions on the last uncovered residues, falsify a natural cost-1 repair rule, and identify narrower open questions suggested by the computations. The Weak Covering Conjecture itself remains open.

Resumo no idioma original da publicação. Uma apresentação em português, com os resultados classificados por situação, está em A Conjectura da Cobertura Fraca.

Palavras-chave

Collatz conjecture, 3n+1 problem, Wirsching weak covering conjecture, computational number theory, 3-adic dynamics, mean-payoff games, exponential sums.

Como citar

Tavares, R. A. (2026). Wirsching's Weak Covering Conjecture: An Extended Computation, a Conditional Bound, and the Structure of What Resists It. Preprint. doi:10.6084/m9.figshare.33260757.

@misc{Tavares2026WeakCovering,
  author = {Tavares, Renato Augusto},
  title = {{Wirsching's Weak Covering Conjecture: An Extended Computation, a Conditional Bound, and the Structure of What Resists It}},
  year = {2026},
  month = aug,
  howpublished = {Figshare},
  doi = {10.6084/m9.figshare.33260757},
  note = {Preprint. Também em SSRN, doi:10.2139/ssrn.7282479}
}