Search arXivSearch

arXiv · 2412.00991

On the minimal polynomials of the arguments of dilogarithm ladders

Abstract

Letting $L_{n}(N, u)$ denote a polylogarithm ladder of weight $n$ and index $N$ with $u$ as an algebraic number, there is a rich history surrounding how mathematical objects of this form can be constructed for a given weight or index. This raises questions as to what minimal polynomials for $u$ are permissible in such constructions. Classical relations for the dilogarithm $\text{Li}_{2}$ provide families of weight-2 ladders in such a way so that the base equations for $u$ consist of a fixed number of terms, and subsequent constructions for dilogarithm ladders rely on sporadic cases whereby $u$ is defined via a cyclotomic equation, as in the supernumary ladders due to Abouzahra and Lewin. This motivates our construction of an infinite family of dilogarithm ladders so as to obtain arbitrarily many terms with nonzero coefficients for the minimal polynomials for $u$. Our construction relies on a derivation of a dilogarithm identity introduced by Khoi in 2014 via the Seifert volumes of manifolds obtained from the use of Dehn surgery.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

John M. Campbell. 2024-12-01. On the minimal polynomials of the arguments of dilogarithm ladders. https://arxiv.org/abs/2412.00991

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