Search arXivSearch

arXiv · 1207.6479

A-expansions of Drinfeld modular forms

Abstract

We introduce the notion of Drinfeld modular forms with $A$-expansions, where instead of the usual Fourier expansion in $t^n$ ($t$ being the uniformizer at `infinity'), parametrized by $n \in \mathbb{N}$, we look at expansions in $t_a$, parametrized by $a \in A = \Fq [T]$. We construct an infinite family of eigenforms with $A$-expansions. Drinfeld modular forms with $A$-expansions have many desirable properties that allow us to explicitly compute the Hecke action. The applications of our results include: (i) various congruences between Drinfeld eigenforms; (ii) the computation of the eigensystems of Drinfeld modular forms with $A$-expansions; (iii) examples of failure of multiplicity one result, as well as a restrictive multiplicity one result for Drinfeld modular forms with $A$-expansions; (iv) examples of eigenforms that can be represented as `non-trivial' products of eigenforms; (v) an extension of a result of Böckle and Pink concerning the Hecke properties of the space of cuspidal modulo double-cuspidal forms for $Γ_1(T)$ to the groups $\text{GL}_2 (\Fq [T])$ and $Γ_0(T)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aleksandar Petrov. 2013-06-09. A-expansions of Drinfeld modular forms. https://doi.org/10.1016/j.jnt.2012.12.012

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