English
Related papers

Related papers: Two elementary formulae and some complicated prope…

200 papers

In this paper we give an algorithm for computing the mth base-b digit (m=1 is the least significant digit) of an integer n (actually, it finds sharp approximations to n/b^m mod 1), where n is defined as the last number in a sequence of…

Number Theory · Mathematics 2007-05-23 Ernie Croot

Solving dual quaternion equations is an important issue in many fields such as scientific computing and engineering applications. In this paper, we first introduce a new metric function for dual quaternion matrices. Then, we reformulate…

Optimization and Control · Mathematics 2024-11-11 Chen Ling , Chenjian Pan , Liqun Qi

The general Poisson summation formula of Mellin analysis can be considered as a quadrature formula for the positive real axis with remainder. For Mellin bandlimited functions it becomes an exact quadrature formula. Our main aim is to study…

Numerical Analysis · Mathematics 2018-02-13 Carlo Bardaro , Paul L. Butzer , Ilaria Mantellini , Gerhard Schmeisser

In classical prime number theory there are several asymptotic formulas said to be "equivalent" to the PNT. One is the bound $M(x) = o(x)$ for the sum function of the Moebius function. For Beurling generalized numbers, this estimate is not…

Number Theory · Mathematics 2019-11-22 Gregory Debruyne , Harold G. Diamond , Jasson Vindas

A fast new algorithm is used compute the zeros of the quadratic character L-functions for all negative fundamental discriminants with absolute value 10^12<d<10^12+10^7. These are compared to the 1-level density, including various lower…

Number Theory · Mathematics 2010-06-30 Jeffrey Stopple

We give new algorithms for the computation of square roots and reciprocals of power series in C[[x]]. If M(n) denotes the cost of multiplying polynomials of degree n, the square root to order n costs (1.333... + o(1)) M(n) and the…

Symbolic Computation · Computer Science 2009-10-13 David Harvey

The Riemann theta function is a complex-valued function of g complex variables. It appears in the construction of many (quasi-) periodic solutions of various equations of mathematical physics. In this paper, algorithms for its computation…

Exactly Solvable and Integrable Systems · Physics 2007-05-23 Bernard Deconinck , Matthias Heil , Alexander Bobenko , Mark van Hoeij , Markus Schmies

We give two widest Mehler's formulas for the univariate complex Hermite polynomials $H_{m,n}^\nu$, by performing double summations involving the products $u^m H_{m,n}^\nu (z,\overline{z}) \overline{H_{m,n}^\nu (w,\overline{w})}$ and $u^m…

Classical Analysis and ODEs · Mathematics 2018-02-14 Allal Ghanmi

Mean values of Witten $L$-functions in the "character" aspect are investigated. After giving a general formula for mean values with the first and the second power, we explicitly calculate the cubic moment for $SU(2)$.

Number Theory · Mathematics 2015-03-13 Shin-ya Koyama , Nobushige Kurokawa

We obtain an effective analytic formula, with explicit constants, for the number of distinct irreducible factors of a polynomial $f \in \mathbb{Z}[x]$. We use an explicit version of Mertens' theorem for number fields to estimate a related…

Number Theory · Mathematics 2020-12-11 Stephan Ramon Garcia , Ethan Simpson Lee , Josh Suh , Jiahui Yu

An arithmetic formula is an expression involving only the constant $1$, and the binary operations of addition and multiplication, with multiplication by $1$ not allowed. We obtain an asymptotic formula for the number of arithmetic formulas…

Combinatorics · Mathematics 2014-06-09 Edinah K. Gnang , Maksym Radziwill , Carlo Sanna

Let $\Lambda\left(n\right)$ be the von Mangoldt function and $r_{SP}\left(n\right)=\sum_{m_{1}+m_{2}^{2}+m_{3}^{2}=n}\Lambda\left(m_{1}\right)\Lambda\left(m_{2}\right)\Lambda\left(m_{3}\right)$ be the counting function for the numbers that…

Number Theory · Mathematics 2017-08-24 Marco Cantarini

It is shown that the exponential of a complex power series up to order n can be implemented via (23/12+o(1))M(n) binary arithmetic operations over complex field, where M(n) stands for the (smoothed) complexity of multiplication of…

Data Structures and Algorithms · Computer Science 2012-03-20 Igor S. Sergeev

We establish effective mean-value estimates for a wide class of multiplicative arithmetic functions, thereby providing (essentially optimal) quantitative versions of Wirsing's classical estimates and extending those of Hal\'asz. Several…

Number Theory · Mathematics 2025-07-23 Gérald Tenenbaum

We embed the somewhat unusual multiplicative function, which was serendipitously discovered in 2010 during a study of mutually unbiased bases in the Hilbert space of quantum physics, into two families of multiplicative functions that we…

Number Theory · Mathematics 2021-08-17 Heng Huat Chan , Berthold-Georg Englert

The Mersenne primes are primes which can be written as some prime power of 2 minus 1. These primes were studied from antiquity in that their close connection with perfect numbers and even to present day in that their easiness for primality…

Number Theory · Mathematics 2022-08-09 Taekyun Kim , Dae san Kim

For integer $n\geqslant 1$ and real number $z\geqslant 1$, define $M(n,z):=\sum_{d|n,\,d\leqslant z}\mu(d)$ where $\mu$ denotes the M\"obius function. Put ${\cal L}(y):=\exp\left\{(\log y)^{3/5}/(\log_2y)^{1/5}\right\}$ $(y\geqslant 3)$. We…

Number Theory · Mathematics 2019-07-12 Régis de la Bretèche , François Dress , Gérald Tenenbaum

This note simplifies the proof of a recent result on the oscillation of the prime product in Martens Theorem, and provides a quantitative expression for the error term. In addition, the corresponding oscillation results for the finite sums…

Number Theory · Mathematics 2013-07-11 N. A. Carella

For a large integer $m,$ we obtain an asymptotic formula for the number of solutions of a certain congruence modulo $m$ with four variables, where the variables belong to special sets of residue classes modulo $m.$ This formula are applied…

Number Theory · Mathematics 2007-05-23 M. Z. Garaev , A. A. Karatsuba

We study the asymptotic behaviour of $\sum_{m,n\le x} \tau_{1,2}(mn)$, where $\tau_{1,2}(n) = \sum_{a b^2 = n} 1$, using multidimensional Perron formula and complex integration method. An asymptotic formula with an error term $O(x^{10/7})$…

Number Theory · Mathematics 2014-12-09 Andrew V. Lelechenko
‹ Prev 1 4 5 6 7 8 10 Next ›