Related papers: Efficient computation of non-archimedean theta fun…
Gradient algorithms are classical in adaptive control and parameter estimation. For instantaneous quadratic cost functions they lead to a linear time-varying dynamic system that converges exponentially under persistence of excitation…
We introduce a quantum-like classical computational model, called affine computation, as a generalization of probabilistic computation. After giving the basics of affine computation, we define affine finite automata (AfA) and compare it…
We prove some identities, which involve the non-trivial zeros of the Riemann zeta function. From them we derive some convergent asymptotic expansions related to the work by Cram\'er, and also new representations for some arithmetical…
We present a deterministic polynomial time algorithm for computing the zeta function of an arbitrary variety of fixed dimension over a finite field of small characteristic. One consequence of this result is an efficient method for computing…
We prove an explicit integral formula for computing the product of two shifted Riemann zeta functions everywhere in the complex plane. We show that this formula implies the existence of infinite families of exact exponential sum identities…
The present work is devoted to the eigenvalue asymptotic expansion of the Toeplitz matrix $T_{n}(a)$ whose generating function $a$ is complex valued and has a power singularity at one point. As a consequence, $T_{n}(a)$ is non-Hermitian and…
We prove the sufficient conditions for convergence of a certain iterative process of order 2 for solving nonlinear functional equations, which does not require inverting the derivative. We translate and detail our results for a system of…
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…
We introduce a new method to compute explicit formulae for various zeta functions associated to groups and rings. The specific form of these formulae enables us to deduce local functional equations. More precisely, we prove local functional…
In this paper we compute the Hilbert functions of irreducible (or smooth) and reduced arithmetically Gorenstein schemes that are twisted anti-canonical divisors on arithmetically Cohen-Macaulay schemes. We also prove some folklore results…
Computations in the cohomology of finite groups.
Exchangeable graphs arise via a sampling procedure from measurable functions known as graphons. A natural estimation problem is how well we can recover a graphon given a single graph sampled from it. One general framework for estimating a…
In this article, a fast algorithm based on time two-mesh (TT-M) finite element (FE) scheme, which aims at solving nonlinear problems quickly, is considered to numerically solve the nonlinear space fractional Allen-Cahn equations with smooth…
We investigate possibilities to speed up iterative algorithms for non-blind image deconvolution. We focus on algorithms in which convolution with the point-spread function to be deconvolved is used in each iteration, and aim at accelerating…
In this article we introduce a new type of local zeta functions and study some connections with pseudodifferential operators in the framework of non-Archimedean fields. The new local zeta functions are defined by integrating complex powers…
In this paper we introduce some new methods to understand the analytic behaviour of the zeta function of a group. We can then combine this knowledge with suitable Tauberian theorems to deduce results about the growth of subgroups in a…
Assuming the Tate conjecture and the computability of \'etale cohomology with finite coefficients, we give an algorithm that computes the N\'eron-Severi group of any smooth projective geometrically integral variety, and also the rank of the…
We exhibit a quantum algorithm for determining the zeta function of a genus g curve over a finite field F_q, which is polynomial in g and log(q). This amounts to giving an algorithm to produce provably random elements of the class group of…
The discrete class algorithm presented in this paper is an efficient simulation tool for stochastic processes governed by a reasonably small set of transition rates. The algorithm is presented, its performance compared to prevailing methods…
We use multiple zeta functions to prove, under suitable assumptions, precise asymptotic formulas for the averages of multivariable multiplicative functions. As applications, we prove some conjectures on the average number of cyclic…