English
Related papers

Related papers: A nearly-optimal method to compute the truncated t…

200 papers

We prove a Poisson summation formula for the zero locus of a quadratic form in an even number of variables with no assumption on the support of the functions involved. The key novelty in the formula is that all ``boundary terms'' are given…

Number Theory · Mathematics 2025-01-09 Jayce R. Getz

Solving a Poisson equation is generally reduced to solving a linear system with a coefficient matrix $A$ of entries $a_{ij}$, $i,j=1,2,...,n$, from the discretized Poisson equation. Although the variational quantum algorithms are promising…

Quantum Physics · Physics 2023-09-25 Hui-Min Li , Zhi-Xi Wang , Shao-Ming Fei

The paper develops the result of second Thomae theorem in hyperelliptic case. The main formula, called general Thomae formula, provides expressions for values at zero of the lowest non-vanishing derivatives of theta functions with singular…

Algebraic Geometry · Mathematics 2021-10-28 Julia Bernatska

We derive special forms of the Poisson summation formula for even and odd functions, which are applied to obtain representations for Euler-type numbers and to sum various series related to elliptic functions.

Mathematical Physics · Physics 2008-12-05 M. L. Glasser Nikos Bagis

Linear inequalities involving Euler's partition function $p(n)$ have been the subject of recent studies. In this article, we consider the partition function $Q(n)$ counting the partitions of $n$ into distinct parts. Using truncated theta…

Combinatorics · Mathematics 2020-06-16 Mircea Merca

The aim of this paper is to introduce truncated degenerate Bell polynomials and numbers and to investigate some of their properties. In more detail, we obtain explicit expressions, identities involving other special polynomials, integral…

Number Theory · Mathematics 2020-12-10 Taekyun Kim , Dae san Kim

We compute integral moments of partial sums of the Riemann zeta function on the critical line and obtain an expression for the leading coefficient as a product of the standard arithmetic factor and a geometric factor. The geometric factor…

Number Theory · Mathematics 2007-05-23 Brian Conrey , Alex Gamburd

An important step in the efficient computation of multi-dimensional theta functions is the construction of appropriate symplectic transformations for a given Riemann matrix assuring a rapid convergence of the theta series. An algorithm is…

Exactly Solvable and Integrable Systems · Physics 2017-01-27 J. Frauendiener , C. Jaber , C. Klein

We propose to generalize the work of R\'egis Dupont for computing modular polynomials in dimension $2$ to new invariants. We describe an algorithm to compute modular polynomials for invariants derived from theta constants and prove under…

Number Theory · Mathematics 2019-02-20 Enea Milio

We use Poisson summation formula to calculate integrals of producs of sinc functions (cf. [4]) and related integrals as in [5] and [3]. We also generalize the one in [5] and introduce other remarkable integrals. Finally we give a sum…

Classical Analysis and ODEs · Mathematics 2014-07-01 Gert Almkvist , Jan Gustavsson

We show that one can approximate the least fixed point solution for a multivariate system of monotone probabilistic polynomial equations in time polynomial in both the encoding size of the system of equations and in log(1/\epsilon), where…

Computational Complexity · Computer Science 2013-02-21 Kousha Etessami , Alistair Stewart , Mihalis Yannakakis

This paper describes a practical methodology for computing the Hardy function Z(t), using just O(((t/epsilon)^(1/3))*(log(t))^(2+o(1)))) standard computational operations, to a tolerance of epsilon in the relative error. The methodology is…

Numerical Analysis · Mathematics 2017-11-07 David Mark Lewis

In this paper, we present and prove a new truncated $\mathcal{V}$-fractional Taylor's formula using the truncated $\mathcal{V}$-fractional variation of constants formula. In this sense, we present the truncated $\mathcal{V}$-fractional…

Classical Analysis and ODEs · Mathematics 2017-07-10 J. Vanterler da C. Sousa , E. Capelas de Oliveira

In this paper we present a polynomial time algorithm to compute the local zeta function Z(s,f) attached to a polynomial f(x) in Z[x] (in one variable, with splitting field Q) and a prime p. The algorithm reduces in polynomial time the…

Number Theory · Mathematics 2007-05-23 W. A. Zúñiga-Galindo

We introduce the multiple zeta functions with structures similar to those of symmetric functions such as Schur $P$-, Schur $Q$-, symplectic and orthogonal functions in the representation theory. We first consider their basic properties such…

Number Theory · Mathematics 2022-08-26 Maki Nakasuji , Wataru Takeda

In the present paper, we construct an algorithm for the evaluation of real Riemann zeta function $\zeta(s)$ for all real $s$, $s>1$, in polynomial time and linear space on Turing machines in Ko-Friedman model. The algorithms is based on a…

Computational Complexity · Computer Science 2014-11-18 Sergey V. Yakhontov

The Riemann zeta function on the critical line can be computed using a straightforward application of the Riemann-Siegel formula, Sch\"onhage's method, or Heath-Brown's method. The complexities of these methods have exponents 1/2, 3/8…

Number Theory · Mathematics 2011-03-15 Ghaith Ayesh Hiary

Using the resonance method, we obtain refined estimates for joint extreme values of the Riemann zeta function at harmonic points, improving upon Levinson's 1972 results and providing new insight into the behavior of the Riemann zeta…

Number Theory · Mathematics 2026-01-07 Qiyu Yang , Shengbo Zhao

For the Tornheim double zeta function T(s1,s2,s3) of complex variables,we obtain its functional equations,which are new.Using the calculus of r-th order derivative of zeta(s,alpha) as a function of alpha(developed in author[7])as the…

Number Theory · Mathematics 2011-08-17 Vivek V. Rane

We give new algorithms based on the sum-of-squares method for tensor decomposition. Our results improve the best known running times from quasi-polynomial to polynomial for several problems, including decomposing random overcomplete…

Data Structures and Algorithms · Computer Science 2016-10-07 Tengyu Ma , Jonathan Shi , David Steurer