English
Related papers

Related papers: Accurate Computations of Euler Products over Prime…

200 papers

This note provides an effective lower bound for the number of primes in the quadratic progression $p=n^2+1 \leq x$ as $x \to \infty$.

General Mathematics · Mathematics 2024-07-09 N. A. Carella

We investigate the approximation of quadratic Dirichlet $L$-functions over function fields by truncations of their Euler products. We first establish representations for such $L$-functions as products over prime polynomials times products…

Number Theory · Mathematics 2018-02-14 J. C. Andrade , S. M. Gonek , J. P. Keating

In this paper we introduce elementary and completely explicit formulas for the derivative of any order of any function of the type 1/p, where p is a polynomial with known zeros.

Classical Analysis and ODEs · Mathematics 2020-02-04 Shahar Nevo , Irina Raichik

In this paper, we calculate the absolute tensor square of the Dirichlet $L$-functions and show that it is expressed as an Euler product over pairs of primes. The method is to construct an equation to link primes to a series which has the…

Number Theory · Mathematics 2020-09-14 Hidenori Tanaka

We discuss a product formula for $F$-polynomials in cluster algebras, and provide two proofs. One proof is inductive and uses only the mutation rule for $F$-polynomials. The other is based on the Fock-Goncharov decomposition of mutations.…

Combinatorics · Mathematics 2024-07-09 Feiyang Lin , Gregg Musiker , Tomoki Nakanishi

In this paper Euler shows how, if we have recursive functions f,g,h and an infinite sequence A,B,C,... which satisfies fA=gB+hC, f'B=g'C+h'D, f''C=g''D+h''E, f'''D=g'''E+h'''F, etc., where the primes denote an index not a derivative, then…

History and Overview · Mathematics 2007-05-23 Leonhard Euler

We investigate the continued fraction expansion of the infinite products $g(x) = x^{-1}\prod_{t=0}^\infty P(x^{-d^t})$ where polynomials $P(x)$ satisfy $P(0)=1$ and $\deg(P)<d$. We construct relations between partial quotients of $g(x)$…

Number Theory · Mathematics 2018-03-08 Dmitry Badziahin

We give several families of reasonably small integers $k, \ell \ge 1$ and real positive $\alpha, \beta \le 1$, such that the products $p_1\ldots p_k s$, where $p_1, \ldots, p_k \le m^\alpha$ are primes and $s \le m^\beta$ is a product of at…

Number Theory · Mathematics 2017-05-18 Igor E. Shparlinski

We establish several sum-product estimates over finite fields that involve polynomials and rational functions. First, |f(A)+f(A)|+|AA| is substantially larger than |A| for an arbitrary polynomial f over F_p. Second, a characterization is…

Combinatorics · Mathematics 2014-02-26 Boris Bukh , Jacob Tsimerman

We establish a function field analogue of Mertens' formula for Euler products restricted to primes in arithmetic progressions over the polynomial ring F_q[t]. Our results are in direct correspondence with those of Languasco and Zaccagnini…

Number Theory · Mathematics 2026-02-06 Hwanyup Jung

The purpose of this paper is to study products of Fourier coefficients of an elliptic cusp form, $a(n)a(n + r)$ $(n \geq 1)$ for a fixed positive integer $r$, concerning both non-vanishing and non-negativity.

Number Theory · Mathematics 2016-06-15 Eric Hofmann , Winfried Kohnen

We consider different generalizations of the Euler formula and discuss the properties of the associated trigonometric functions. The problem is analyzed from different points of view and it is shown that it can be formulated in a natural…

Classical Analysis and ODEs · Mathematics 2011-03-15 D. Babusci , G. Dattoli , E. Di Palma , E. Sabia

We present an algorithm for computing Borcherds products, which has polynomial runtime. It deals efficiently with the bounds on Fourier expansion indices originating in Weyl chambers. Naive multiplication has exponential runtime due to…

Number Theory · Mathematics 2019-02-20 Dominic Gehre , Judith Kreuzer , Martin Raum

In the present paper, we were mainly concerned with obtaining estimates for the general Taylor-Maclaurin coefficients for functions in a certain general subclass of analytic bi-univalent functions. For this purpose, we used the Faber…

Complex Variables · Mathematics 2019-05-01 Ala Amourah

For any two arithmetic functions $f,g$ let $\bullet$ be the commutative and associative arithmetic convolution $(f\bullet g)(k):=\sum_{m=0}^k \left( \begin{array}{c} k m \end{array} \right)f(m)g(k-m)$ and for any $n\in\mathbb{N},$…

Number Theory · Mathematics 2017-03-08 Jitender Singh

We give conditions for when two Euler products are the same given that they satisfy a functional equation and their coefficients are not too large and do not differ from each other by too much. Additionally, we prove a number of…

Number Theory · Mathematics 2025-05-13 David W. Farmer , Ameya Pitale , Nathan C. Ryan , Ralf Schmidt

We study \emph{unimodular fake} $\mu's$, i.e. multiplicative functions $\mathfrak f: \N \to \mathbb{S}^1 \cup \{0\} $ determined by a fixed sequence $\{\varepsilon_k\}_{k\ge 0} \subset \mathbb{S}^1 \, \cup \, \{0\}$ via the rule $\mathfrak…

Number Theory · Mathematics 2026-01-01 Ali Saraeb

Let $p_k(n)$ be given by the $k$-th power of the Euler Product $\prod _{n=1}^{\infty}(1-q^n)^k=\sum_{n=0}^{\infty}p_k(n)q^{n}$. By investigating the properties of the modular equations of the second and the third order under the Atkin…

Combinatorics · Mathematics 2018-03-14 Julia Q. D. Du , Edward Y. S. Liu , Jack C. D. Zhao

This paper is about the product z^q/(1 - z)^(q + 1)(1 + (z/(1 - z)))^p, Euler gives the Talylor-Series and takes a closer look at the coefficient.

History and Overview · Mathematics 2012-02-02 Leonhard Euler , Artur Diener , Alexander Aycock

In this paper, we will deal with some new formulae for two product Genocchi polynomials together with both Euler polynomials and Bernoulli polynomials. We get some applications for Genocchi polynomials. Our applications possess a number of…

Number Theory · Mathematics 2019-07-04 Serkan Araci , Mehmet Acikgoz , Erdoğan Şen