Search arXivSearch

arXiv · 2209.03590

Volumes of spheres and special values of zeta functions of $\mathbb{Z}$ and $\mathbb{Z}/n\mathbb{Z}$

Abstract

The volume of the unit sphere in every dimension is given a new interpretation as a product of special values of the zeta function of $\mathbb{Z}$, akin to volume formulas of Minkowski and Siegel in the theory of arithmetic groups. A product formula is found for this zeta function that specializes to Catalan numbers. Moreover, certain closed-form expressions for various other zeta values are deduced, in particular leading to an alternative perspective on Euler's values of the Riemann zeta function.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anders Karlsson, Massimiliano Pallich. 2022-09-08. Volumes of spheres and special values of zeta functions of $\mathbb{Z}$ and $\mathbb{Z}/n\mathbb{Z}$. https://arxiv.org/abs/2209.03590

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