Search arXivSearch

arXiv · math/0606578

Shimura correspondence for level p^2 and the central values of L-series

Abstract

Given a weight 2 and level p^2 modular form f, we construct two weight 3/2 modular forms (possibly zero) of level 4p^2 and non trivial character mapping to f via the Shimura correspondence. Then we relate the coefficients of the constructed forms to the central value of the L-series of certain imaginary quadratic twists of f. Furthermore, we give a general framework for our construction that applies to any order in definite quaternion algebras, with which one can, in principle, construct weight 3/2 modular forms of any level, provided one knows how to compute ideal classes representatives.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ariel Pacetti, Gonzalo Tornaría. 2006-06-23. Shimura correspondence for level p^2 and the central values of L-series. https://doi.org/10.1016/j.jnt.2006.10.011

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