Related papers: Efficient computation of non-archimedean theta fun…
We introduce new non-abelian zeta functions for curves defined over finite fields. There are two types, i.e., pure non-abelian zetas defined using semi-stable bundles, and group zetas defined for pairs consisting of (reductive group,…
This paper is devoted to the investigation of inertial dynamical systems with implicit Hessian-driven damping for strongly quasiconvex optimization which is a specific class of nonconvex optimization problems. We first establish exponential…
We present a general diagrammatic approach to the construction of efficient algorithms for computing a Fourier transform on a semisimple algebra. This extends previous work wherein we derive best estimates for the computation of a Fourier…
The Iterative Filtering method is a technique developed recently for the decomposition and analysis of non-stationary and non-linear signals. In this work we propose two alternative formulations of the original algorithm which allows to…
In this paper, we present formulas for the edge zeta function and the second weighted zeta function with respect to the group matrix of a finite abelian group $\Gamma $. Furthermore, we give another proof of Dedekind Theorem for the group…
In this article, we study local zeta functions over non-Archimedean locals fields of arbitrary characteristic attached to rational functions and characters $\chi$ of the units of the ring of integers $\mathcal{O}_{K}$, by using an approach…
In this paper we established a class of optimal fourth-order methods which is obtained by existing third-order method for solving nonlinear equations for simple roots by using weight functions. Some physical examples are given to illustrate…
We define unramified Whittaker functions on the p-adic points of an affine Kac-Moody group, and establish an analogue of the Casselman-Shalika formula for these functions.
The usual formulation of efficient division uses Newton iteration to compute an inverse in a related domain where multiplicative inverses exist. On one hand, Newton iteration allows quotients to be calculated using an efficient…
A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.
We define certain higher-dimensional Dedekind sums that generalize the classical Dedekind-Rademacher sums, and show how to compute them effectively using a generalization of the continued-fraction algorithm. We present two applications.…
We describe two algorithms for finding representatives of the nilpotent orbits of a theta-group. The algorithms have been implemented in the computer algebra system GAP (inside the package SLA). We comment on their performance. We apply the…
We give an efficient quantum algorithm for the Moebius function $\mu(n)$ from the natural numbers to $\{-1,0,1\}$. The cost of the algorithm is asymptotically quadratic in $\log n$ and does not require the computation of the prime…
We describe an algorithm for arbitrary-precision computation of the elementary functions (exp, log, sin, atan, etc.) which, after a cheap precomputation, gives roughly a factor-two speedup over previous state-of-the-art algorithms at…
We describe some "unrestricted" algorithms which are useful for the computation of elementary and special functions when the precision required is not known in advance. Several general classes of algorithms are identified and illustrated by…
We report a novel approach for the efficient computation of solutions of a broad class of large-scale systems of non-linear ordinary differential equations, describing aggregation kinetics. The method is based on a new take on the…
We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.
We prove a dichotomy between rationality and a natural boundary for the analytic behavior of the Reidemeister zeta function for automorphisms of non-finitely generated torsion abelian groups and for endomorphisms of groups $\mathbb Z_p^d,$…
In this paper, we enumerate Newton polygons asymptotically. The number of Newton polygons is computable by a simple recurrence equation, but unexpectedly the asymptotic formula of its logarithm contains growing oscillatory terms. As the…
We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address…