Large supremum norms and small Shannon entropy for Hecke eigenfunctions of quantized cat maps

Rikard Olofsson

doi:10.1007/s00220-008-0627-x

Home/Archive/arXiv

arXiv · 0711.4509

Large supremum norms and small Shannon entropy for Hecke eigenfunctions of quantized cat maps

Rikard Olofsson

View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper concerns the behavior of eigenfunctions of quantized cat maps and in particular their supremum norm. We observe that for composite integer values of N, the inverse of Planck's constant, some of the desymmetrized eigenfunctions have very small support and hence very large supremum norm. We also prove an entropy estimate and show that our functions satisfy equality in this estimate. In the case when N is a prime power with even exponent we calculate the supremum norm for a large proportion of all desymmetrized eigenfunctions and we find that for a given N there is essentially at most four different values these assume.

Explore related subjects

math.NT math-ph math.MP

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Rikard Olofsson. 2007-11-28. Large supremum norms and small Shannon entropy for Hecke eigenfunctions of quantized cat maps. https://doi.org/10.1007/s00220-008-0627-x

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

Integers for Simple Radical Extensions

The ring of integers and the discriminant are determined for number fields which are simple radical extensions.

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↗