Search arXivSearch

arXiv · 2204.08310

Average estimates and sign change of Fourier coefficients of cusp forms at integers represented by binary quadratic form of fixed discriminant

Abstract

In this article, we establish an average behaviour of the normalised Fourier coefficients of the Hecke eigenforms supported at the integers represented by any primitive integral positive definite binary quadratic form of fixed discriminant $D < 0$ when the class number $h(D) = 1$. We also obtain a quantitative result for the number of sign changes of the sequence of the normalised Fourier coefficients $λ_{f}(n)$ of the Hecke eigenforms $f$ where $n$ is represented by any primitive integral positive definite binary quadratic form of fixed discriminant $D < 0$ when the class number $h(D) = 1$ in the interval $(x,2x]$, for sufficiently large $x$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lalit Vaishya. 2022-04-18. Average estimates and sign change of Fourier coefficients of cusp forms at integers represented by binary quadratic form of fixed discriminant. https://arxiv.org/abs/2204.08310

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