Related papers: Computing zeta functions of large polynomial syste…

In this article, we study the multiple zeta functions (MZF) and some of its variants at identical arguments. Using the harmonic product, these functions can be expressed as polynomials in the Riemann zeta function. Firstly, we note that an…

Given a function from $\mathbb{Z}_n$ to itself one can determine its polynomial representability by using Kempner function. In this paper we present an alternative characterization of polynomial functions over $\mathbb{Z}_n$ by constructing…

We describe an algorithm to numerically evaluate Riemann theta functions in any dimension in quasi-linear time in terms of the required precision, uniformly on reduced input. This algorithm is implemented in the FLINT number theory library…

In this paper we develop the analytic theory of a multiple zeta function in d independent complex variables defined over a global function field. This is the function field analog of the Euler-Zagier multiple zeta function of depth d.

We present a randomized quantum algorithm for polynomial factorization over finite fields. For polynomials of degree $n$ over a finite field $\F_q$, the average-case complexity of our algorithm is an expected $O(n^{1 + o(1)} \log^{2 +…

Multiple zeta functions of Arakawa-Kaneko and Euler-Zagier types are known as generalizations of the Riemann zeta function. In 2018, Kaneko and Tsumura proved that the multiple zeta functions of Arakawa-Kaneko type can be expressed as a…

Fast algorithms for integer and polynomial multiplication play an important role in scientific computing as well as in other disciplines. In 1971, Sch{\"o}nhage and Strassen designed an algorithm that improved the multiplication time for…

Inspired by the theory of Hodge correlators due to Goncharov and by the plectic principle of Nekov\'a\v{r} and Scholl, we construct higher plectic Green functions and give a higher order generalization of Hecke's formula for abelian…

In this work we introduce a new polynomial representation of the Bernoulli numbers in terms of polynomial sums allowing on the one hand a more detailed understanding of their mathematical structure and on the other hand provides a…

Jacobi's $\theta$ function has numerous applications in mathematics and computer science; a naive algorithm allows the computation of $\theta(z,\tau)$, for $z, \tau$ verifying certain conditions, with precision $P$ in $O(\mathcal{M}(P)…

We introduce a new type of multiple zeta functions, which we call bilateral zeta functions, analogous to the Barnes zeta functions. The bilateral zeta function is a periodic function and shares certain basic properties of Barnes zeta…

We introduce an "$L$-function" $\mathcal{L}$ built up from the integral representation of the Barnes' multiple zeta function $\zeta$. Unlike the latter, $\mathcal{L}$ is defined on a domain equipped with a non-trivial action of a group $G$.…

We provide a framework for relating certain q-series defined by sums over partitions to multiple zeta values. In particular, we introduce a space of polynomial functions on partitions for which the associated q-series are q-analogues of…

Let $g(X)$ be a polynomial over a finite field ${\mathbb F}_q$ with degree $o(q^{1/2})$, and let $\chi$ be the quadratic residue character. We give a polynomial time algorithm to recover $g(X)$ (up to perfect square factors) given the…

We propose a Las Vegas probabilistic algorithm to compute the zeta function of a genus-3 hyperelliptic curve defined over a finite field $\mathbb F_q$, with explicit real multiplication by an order $\mathbb Z[\eta]$ in a totally real cubic…

The hypergeometric zeta function is defined in terms of the zeros of the Kummer function M(a, a + b; z). It is established that this function is an entire function of order 1. The classical factorization theorem of Hadamard gives an…

In this paper we define and study a Dedekind-like zeta function for the algebra of multicomplex numbers. By using the idempotent representations for such numbers, we are able to identify this zeta function with the one associated to a…

A function $f:\mathbb{Z}_n \to \mathbb{C}$ can be represented as a linear combination $f(x)=\sum_{\alpha \in \mathbb{Z}_n}\widehat{f}(\alpha) \chi_{\alpha,n}(x)$ where $\widehat{f}$ is the (discrete) Fourier transform of $f$. Clearly, the…

We present a new algorithm for computing $m$-th roots over the finite field $\F_q$, where $q = p^n$, with $p$ a prime, and $m$ any positive integer. In the particular case $m=2$, the cost of the new algorithm is an expected $O(\M(n)\log (p)…

Recently, a new polynomial basis over binary extension fields was proposed such that the fast Fourier transform (FFT) over such fields can be computed in the complexity of order $\mathcal{O}(n\lg(n))$, where $n$ is the number of points…