Search arXivSearch

arXiv · 2406.19335

$L^\infty$-sizes of the spaces Siegel cusp forms of degree $n$ via Poincaré series

Abstract

We prove the conjectures on the ($L^{\infty}$)-sizes of the spaces of Siegel cusp forms of degree $n$, weight $k$, for any congruence subgroup in the weight aspect as well as for all principal congruence subgroups in the level aspect, in particular. This size is measured by the size of the Bergman kernel of the space. More precisely we show that the aforementioned size is $\asymp_{n} k^{3n(n+1)/4}$. Our method uses the Fourier expansion of the Bergman kernel, and has wide applicability. We illustrate this by a simple algorithm. We also include some of the applications of our method, including individual sup-norms of small weights and non-vanishing of Poincaré series.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Soumya Das. 2026-03-22. $L^\infty$-sizes of the spaces Siegel cusp forms of degree $n$ via Poincaré series. https://arxiv.org/abs/2406.19335

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