Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0502254

A Mean Value Theorem for Closed Geodesics on Congruence Surfaces

Vladimir Lukianov
View original source ↗Read source document ↗Export metadata ↓

Abstract

We define a weighted multiplicity function for closed geodesics of given length on a finite area Riemann surface. These weighted multiplicities appear naturally in the Selberg trace formula, and in particular their mean square plays an important role in the study of statistics of the eigenvalues of the Laplacian on the surface. In the case of the modular domain, E. Bogomolny, F. Leyvraz and C. Schmit gave a formula for the mean square, which was rigorously proved by M. Peter. In this paper we calculate the mean square of weighted multiplicities for some surfaces associated to congruence subgroups of the unit group of a rational quaternion algebra, in particular for congruence subgroups of the modular group. Remarkably, the result turns out to be a rational multiple of the mean square for the modular domain.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vladimir Lukianov. 2005-02-12. A Mean Value Theorem for Closed Geodesics on Congruence Surfaces. https://arxiv.org/abs/math/0502254

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗