Related papers: Computing Igusa's local zeta functions of univaria…

We study a class of functional problems reducible to computing $f^{(n)}(x)$ for inputs $n$ and $x$, where $f$ is a polynomial-time bijection. As we prove, the definition is robust against variations in the type of reduction used in its…

In this article, we give evidence that computing Fourier coefficients of the Hecke eigenforms for composite indices is no easier than factoring integers. In particular, we show that the existence of a polynomial time algorithm that, given…

For a scheme $X$ whose $\mathbb F_q$-rational points are counted by a polynomial $N(q)=\sum a_iq^i$, the $\mathbb{F}_1$-zeta function is defined as $\zeta(s)=\prod(s-i)^{-a_i}$. Define $\chi=N(1)$. In this paper we show that if $X$ is a…

Let $q$ be a prime power, let $\mathbb F_q$ be the finite field with $q$ elements and let $\theta$ be a generator of the cyclic group $\mathbb F_q^*$. For each $a\in \mathbb F_q^*$, let $\log_{\theta} a$ be the unique integer $i\in \{1,…

A formula for the Hurwitz zeta function at the positive integers $k$, $\zeta(k,b)$, is created by solving the real and the imaginary parts separately and then combining them. A few different formulae for the Hurwitz zeta function are known…

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…

The Function Field Sieve algorithm is dedicated to computing discrete logarithms in a finite field GF(q^n), where q is small an prime power. The scope of this article is to select good polynomials for this algorithm by defining and…

This paper studies the poles of the real Archimedean zeta function for a weighted homogeneous polynomial $f \in \mathbb{R}[x, y]$ with an isolated singularity at the origin. By applying a weighted blow-up, we derive the meromorphic…

Endowing the set of functional graphs (FGs) with the sum (disjoint union of graphs) and product (standard direct product on graphs) operations induces on FGs a structure of a commutative semiring R. The operations on R can be naturally…

We obtain an effective analytic formula, with explicit constants, for the number of distinct irreducible factors of a polynomial $f \in \mathbb{Z}[x]$. We use an explicit version of Mertens' theorem for number fields to estimate a related…

Let $f$ be a polynomial function over the complex numbers and let $\phi$ be a smooth function over $\mathbb{C}$ with compact support. When $f$ is non-degenerate with respect to its Newton polyhedron, we give an explicit list of candidate…

In the present paper, we investigate special generalized q-Euler numbers and polynomials. Some earlier results of T. Kim in terms of q-Euler polynomials with weight alpha can be deduced. For presentation of our formulas we apply the method…

The reason why Cooley-Tukey Fast Fourier Transform (FFT) over $\mathbb{Q}$ can be efficiently implemented using complex roots of unity is that the cyclotomic extensions of the completion $\mathbb{R}$ of $\mathbb{Q}$ are at most quadratic,…

Stark and Terras introduced the edge zeta function of a finite graph in 1996. The edge zeta function is the reciprocal of a polynomial in twice as many variables as edges in the graph and can be computed in polynomial time. We look at graph…

This work formalizes efficient Fast Fourier-based multiplication algorithms for polynomials in quotient rings such as $\mathbb{Z}_{m}[x]/\left<x^{n}-a\right>$, with $n$ a power of 2 and $m$ a non necessarily prime integer. We also present a…

The derivation of zonal polynomials involves evaluating the integral \[ \exp\left( - \frac{1}{2} \operatorname{tr} D_{\beta} Q D_{l} Q \right) \] with respect to orthogonal matrices \(Q\), where \(D_{\beta}\) and \(D_{l}\) are diagonal…

By introducing a generalized notion of multiple zeta values associated with an arbitrary finite subset $S\subset \mathbb{P}^1(\mathbb{C})$ and studying their transformation properties under rational functions, we show that multiple…

Recently, several fast algorithms have been proposed to decompose predicted value into Shapley values, enabling individualized feature contribution analysis in tree models. While such local decomposition offers valuable insights, it…

We give results on zeros of a polynomial of $\zeta(s),\zeta'(s),\ldots,\zeta^{(k)}(s)$. First, we give a zero free region and prove that there exist zeros corresponding to the trivial zeros of the Riemann zeta function. Next, we estimate…

We study an algorithm for approximating the multivariate independence polynomial $Z(\mathbf{z})$, with negative and complex arguments, an object that has strong connections to combinatorics and to statistical physics. In particular, the…