Search arXivSearch

arXiv · 1212.0674

A numerical study on exceptional eigenvalues of certain congruence subgroups of SO(n,1) and SU(n,1)

Abstract

In a previous work we apply lattice point theorems on hyperbolic spaces obtaining asymptotic formulas for the number of integral representations of negative integers by quadratic and hermitian forms of signature (n,1) lying in Euclidean balls of increasing radius. This formula involves an error term that depends on the first nonzero eigenvalue of the Laplace-Beltrami operator on the corresponding congruence hyperbolic manifolds. The aim of this paper is to compare the error term obtained by experimental computations, with the error term mentioned above, for several choices of quadratic and hermitian forms. Our numerical results give evidences of the existence of exceptional eigenvalues for some arithmetic subgroups of SU(3,1), SU(4,1) and SU(5,1), thus they contradicts the generalized Selberg (and Ramanujan) conjecture in these cases. Furthermore, for several arithmetic subgroups of SO(4,1), SO(6,1), SO(8,1) and SU(2,1), there are evidences of a lower bound on the first nonzero eigenvalue better than the already known lower bound for congruences subgroups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Emilio A. Lauret. 2012-12-16. A numerical study on exceptional eigenvalues of certain congruence subgroups of SO(n,1) and SU(n,1). https://doi.org/10.1007/s11139-014-9590-7

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