Search arXivSearch

arXiv · 2602.18017

Modules of Jacobi forms of degree two of small levels

Abstract

The purpose of this paper is to describe explicitly the modules of (Siegel-)Jacobi forms of degree two of index one of any scalar valued weight with respect to some congruence subgroups of small levels $N\leq 4$. Such a structure for the full Siegel modular group as a module over scalar valued Siegel modular forms of even weight has been explicitly given by T.~Ibukiyama. There we used an explicit structure theorem of rings of scalar valued Siegel modular forms by Igusa and that of vector valued Siegel modular forms of weight $\det^k\, \Sym^2$ by T. Satoh and T. Ibukiyama. On the other hand, for levels $N=2$, $3$, $4$, ring structures of scalar valued case have been also known by H. Aoki and T. Ibukiyama and $\det^k \Sym^2$-valued case by H. Aoki. In this paper, by merging these results, we give the same sort of simple structure theorems on modules of Jacobi forms of degree of two of index one for level $2$, $3$ and $4$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hiroki Aoki, Tomoyoshi Ibukiyama. 2026-02-20. Modules of Jacobi forms of degree two of small levels. https://arxiv.org/abs/2602.18017

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