Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1710.00928

Congruences modulo prime powers of Hecke eigenvalues in level $1$

Nadim Rustom
View original source ↗Read source document ↗Export metadata ↓

Abstract

We continue the study of strong, weak, and $dc$-weak eigenforms introduced by Chen, Kiming, and Wiese. We completely determine all systems of Hecke eigenvalues of level $1$ modulo $128$, showing there are finitely many. This extends results of Hatada and can be considered as evidence for the more general conjecture formulated by the author together with Kiming and Wiese on finiteness of systems of Hecke eigenvalues modulo prime powers at any fixed level. We also discuss the finiteness of systems of Hecke eigenvalues of level $1$ modulo $9$, reducing the question to the finiteness of a single eigenvalue. Furthermore, we answer the question of comparing weak and $dc$-weak eigenforms and provide the first known examples of non-weak $dc$-weak eigenforms.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nadim Rustom. 2018-03-16. Congruences modulo prime powers of Hecke eigenvalues in level $1$. https://doi.org/10.1007/s40993-018-0147-5

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↗