Matching works

2 works

math.NT — Number Theory

Explicit positive lower density for the Collatz Conjecture

Contributed by Kenny Lau

Lech Mazur proved that a positive proportion of integers nn reach 11 under the Collatz map in at most 10.46log⁡n10.46\log n steps. We give a quantitative refinement of his construction. For every NN, at least ⌊N/222163⌋\lfloor N/2^{2^{2^{163}}} \rfloor odd positive integers n<Nn<N reach 11 within 10.46log⁡n10.46\log n ordinary steps and 3.4881log⁡n3.4881\log n accelerated steps. We also obtain results for paths that include any prescribed integer tt not divisible by 33. AxiomProver was used to obtain and formalize this result in Lean.

A mix of human-written and AI-generated textHuman understanding: some partsCollatz conjecturearithmetic dynamics
Oct 14, 202671 pages
PDFView work

math.PR — Probability

On the escape rate of favorite sites of planar random walks

Contributed by Heng Ma

For planar simple random walk, the favorite sites at time nn are the sites whose local time at time nn is maximal. We prove that, almost surely, for every γ>1/2\gamma>1/2 and every c>0c>0, all favorite sites lie outside the ball centered at the origin with radius cn/(log⁡n)γc\sqrt n/(\log n)^\gamma for all sufficiently large nn. At the critical exponent γ=1/2\gamma=1/2, almost surely, for every c>0c>0, the entire favorite sites lies within distance cn/log⁡nc\sqrt{n/\log n} of the origin infinitely often.

Primarily AI-generated textHuman understanding: no parts
Oct 01, 202660 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations