Related papers: Efficient computation of non-archimedean theta fun…
A discrete rotation algorithm can be apprehended as a parametric application $f\_\alpha$ from $\ZZ[i]$ to $\ZZ[i]$, whose resulting permutation ``looks like'' the map induced by an Euclidean rotation. For this kind of algorithm, to be…
Inspired by work surrounding Igusa's local zeta function, we introduce topological representation zeta functions of unipotent algebraic groups over number fields. These group-theoretic invariants capture common features of established…
For a finite group $G$, we consider the zeta function $\zeta_G(s) = \sum_{H} \abs{H}^{-s}$, where $H$ runs over the subgroups of $G$. First we give simple examples of abelian $p$-group $G$ and non-abelian $p$-group $G'$ of order $p^m, \; m…
We use partial zeta functions to analyse the asymptotic behaviour of certain smooth arithmetical sums over smooth k-free integers.
We describe a method for calculating the roots of special functions satisfying second order linear ordinary differential equations. It exploits the recent observation that the solutions of a large class of such equations can be represented…
For a Brylinski-Deligne covering group of a general linear group, we calculate some values of unramified Whittaker functions for certain representations that are analogous to the theta representations.
We present a new package Theta.jl for computing with the Riemann theta function. It is implemented in Julia and offers accurate numerical evaluation of theta functions with characteristics and their derivatives of arbitrary order. Our…
In the literature, two main approaches have been used to establish explicit formulas or propagation formulas for Whittaker functions over Archimedean local fields: one based on Jacquet integrals, and the other on the analysis of systems of…
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…
We introduce a new method to calculate local normal zeta functions of finitely generated, torsion-free nilpotent groups. It is based on an enumeration of vertices in the Bruhat-Tits building for Sl_n(Q_p). It enables us to give explicit…
In this paper we will give the computation of the etale fundamental group of an arithmetic scheme.
We propose an approach to determine the continual progression of algorithmic efficiency, as an alternative to standard calculations of time complexity, likely, but not exclusively, when dealing with data structures with unknown maximum…
The object of the present paper is to extend the third-order iterative method for solving nonlinear equations into systems of nonlinear equations. Since our motive is to develop the method which improve the order of convergence of Newton's…
A three-point iterative method for solving scalar non-linear equations was selected and then adapted to solve systems of non-linear equations. Subsequently, by applying Taylor's theorem to functions of $\R^{n}$ in $\R^{n}$, it is shown that…
The main purpose of this paper is to develop new algorithms for computing invariant rings in a general setting. This includes invariants of nonreductive groups but also of groups acting on algebras over certain rings. In particular, we…
A practical method to compute the Riemann zeta function is presented. The method can compute $\zeta(1/2+it)$ at any $\lfloor T^{1/4} \rfloor$ points in $[T,T+T^{1/4}]$ using an average time of $T^{1/4+o(1)}$ per point. This is the same…
In this paper, we introduce (local and) global non-abelian zeta functions for general curves. As an example, we compute the so-called rank two zeta functions for genus two curves by studying non-abelian Brill-Noether loci and their…
A poly-log time method to compute the truncated theta function, its derivatives, and integrals is presented. The method is elementary, rigorous, explicit, and suited for computer implementation. We repeatedly apply the Poisson summation…
We give an explicit formula for the motivic zeta function in terms of a log smooth model. It generalizes the classical formulas for snc-models, but it gives rise to much fewer candidate poles, in general. As an illustration, we explain how…
We introduce a new method which enables us to calculate the coefficients of the poles of local zeta functions very precisely and prove some explicit formulas. Some vanishing theorems for the candidate poles of local zeta functions will be…