Search arXivSearch

arXiv · 2605.04411

Thin subbases of Piatetski-Shapiro sequences

Abstract

For a non-integral real number $c>1$, let $\mathbb{N}_{(c)}:=\{\lfloor n^c\rfloor ~|~ n\in\mathbb{N}\}$. We show that $\mathbb{N}_{(c)}$ contains thin subbases of every order $h\geq 5$ when $1 2$. In fact, for every regularly varying function $F$ such that \[ \frac{F(x)}{\log x}\to\infty\quad\text{ and } \quad F(x)\leq (1+o(1))\frac{Γ(1+1/c)^h}{Γ(h/c)} x^{h/c-1}, \] there exists $A\subseteq\mathbb{N}_{(c)}$ with $r_{A,h}(n)\sim F(n)$. We also establish analogous results for $k$-th powers of Piatetski-Shapiro numbers and Piatetski-Shapiro primes for small $c$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christian Táfula. 2026-05-06. Thin subbases of Piatetski-Shapiro sequences. https://arxiv.org/abs/2605.04411

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