Search arXivSearch

arXiv · math/0603268

The Ring of Quasimodular Forms for a Cocompact Group

Abstract

We describe the additive structure of the graded ring $\widetilde{M}_*$ of quasimodular forms over any discrete and cocompact group $Γ\subset \rm{PSL}(2, \RM).$ We show that this ring is never finitely generated. We calculate the exact number of new generators in each weight $k$. This number is constant for $k$ sufficiently large and equals $\dim_{\CM}(I / I \cap \widetilde{I}^2),$ where $I$ and $\widetilde{I}$ are the ideals of modular forms and quasimodular forms, respectively, of positive weight. We show that $\widetilde{M}_*$ is contained in some finitely generated ring $\widetilde{R}_*$ of meromorphic quasimodular forms with $\dim \widetilde{R}_k = O(k^2),$ i.e. the same order of growth as $\widetilde{M}_*.$

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Najib Ouled Azaiez. 2006-03-13. The Ring of Quasimodular Forms for a Cocompact Group. https://doi.org/10.1016/j.jnt.2007.08.004

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