Search arXiv⌕ Search

arXiv · math/0402135

q-Analogues of the Riemann zeta, the Dirichlet L-functions, and a crystal zeta function

Abstract

A q-analogue of the Riemann zeta function was studied in [Kaneko et al. 03] via a certain q-series of two variables. We introduce in a similar way a q-analogue of the Dirichlet L-functions and make a detailed study of them, including some issues concerning the classical limit of the q-analogue left open in [Kaneko et al. 03]. We also examine a "crystal" limit (i.e. q->0) behavior of the q-analogue. The q-trajectories of the trivial and essential zeros of the Riemann zeta function are investigated numerically when q moves in (0,1]. Moreover, conjectures for the crystal limit behavior of zeros of the q-analogue are given.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kenichi Kawagoe, Masato Wakayama, Yoshinori Yamasaki. 2005-01-20. q-Analogues of the Riemann zeta, the Dirichlet L-functions, and a crystal zeta function. https://doi.org/10.1515/forum.2008.001

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Sporadic points on $X_0(N)$

We determine all integers $N$ for which the modular curve $X_0(N)$ admits a sporadic CM point (of any degree), as well as all $N$ for which $X_0(N)$ admits a sporadic point, whether CM or non-CM. In a sense, our results generalize the classification of isogenies of elliptic curves over $\Q$ due to Mazur and Kenku: their work determines the $X_0(N)$ with degree 1 sporadic points, whereas we classify all $X_0(N)$ that have a sporadic point of arbitrary degree.

math.NT↗

On the Number of Prime Factors of Consecutive Integers

We prove that there are infinitely many $n$ such that $ω(n+k) \ll \log k$ for all integers $k \ge 2$. This improves on a result of Tao and Teräväinen (2025), who have $O(k)$ in place of $O(\log k)$. As corollaries, we make progress on a number of questions posed by Erdős. The proof is based on a quantitative refinement of the Tao-Teräväinen probabilistic argument, combining a refined sieve construction with upper bounds for high moments and the resulting tail estimates. Moreover, we formulate a conjecture on integers with many prime factors based on Cramér-type random models. Assuming this conjecture, the main bound is essentially sharp.

math.NT↗