Search arXivSearch

arXiv · 2603.16521

Quantitative bounds on integrality for post-critically finite maps

Abstract

Let $K$ be a number field with algebraic closure $\overline{K}$ and let $S$ be a finite set of places of $K$ that contain all the archimedean places. For an integer $d \ge 2$, consider the unicritical polynomial family $f_{d,c}(z) = z^d + c$. Recently, Benedetto and Ih studied the distribution of post-critically finite parameters $c$ that are $S$-integral relative to a fixed point $α\in \overline{K}$ such that $f_{d, α}$ is not post-critically finite. In this paper, we study the quantitative aspects of their result. In particular, under some additional assumptions we establish quantitative bounds on the number of $S$-integral post-critically finite parameters in the generalized Mandelbrot set $\mathcal{M}_{d, v}$ relative to a non post-critically finite parameter $α$ as $α$ varies over number fields of bounded degree.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rudranarayan Padhy, Sudhansu Sekhar Rout. 2026-03-25. Quantitative bounds on integrality for post-critically finite maps. https://arxiv.org/abs/2603.16521

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