Search arXivSearch

arXiv · 2510.19417

Escape of Mass of the $p$-Cantor Sequence

Abstract

Let $p$ be a prime. In 2017, Kemarsky, Paulin, and Shapira (KPS) conjectured that any Laurent series over $\mathbb{F}_p$ exhibits full escape of mass with respect to any irreducible polynomial $P(t)\in\mathbb{F}_p[t]$. In 2025, this was shown to be false in the case $p=2$ and $P(t)=t$ by Nesharim, Shapira and the first named author. This work shows that for any odd prime $p$ and any irreducible polynomial $P(t)\in\mathbb{F}_p[t]$, the so-called $p$-Cantor sequence provides a counterexample to the aforementioned conjecture over $\mathbb{F}_p$. Furthermore, the concepts of maximal escape of mass and generic escape of mass are introduced. These lead to two natural variations of the KPS conjecture, both of which are shown to hold for all previous counterexamples.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Noy Soffer Aranov, Steven Robertson. 2025-10-22. Escape of Mass of the $p$-Cantor Sequence. https://arxiv.org/abs/2510.19417

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT