Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1103.0821

Bounds for Siegel Modular Forms of genus 2 modulo $p$

Dohoon Choi·YoungJu Choie·Toshiyuki Kikuta
View original source ↗Read source document ↗Export metadata ↓

Abstract

Sturm obtained the bounds for the number of the first Fourier coefficients of elliptic modular form $f$ to determine vanishing of $f$ modulo a prime $p$. In this paper, we study analogues of Sturm's bound for Siegel modular forms of genus 2. We show the resulting bound is sharp. As an application, we study congruences involving Atkin's $U(p)$-operator for the Fourier coefficients of Siegel mdoular forms of genus 2.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dohoon Choi, YoungJu Choie, Toshiyuki Kikuta. 2011-03-04. Bounds for Siegel Modular Forms of genus 2 modulo $p$. https://arxiv.org/abs/1103.0821

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↗