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

In 2011 Lemahieu and Van Proeyen proved the Monodromy Conjecture for the local topological zeta function of a non-degenerated surface singularity. We start from their work and obtain the same result for Igusa's p-adic and the motivic zeta…

We approximate the Riemann Zeta-Function by polynomials and Dirichlet polynomials with restricted zeros.

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…

This paper settles the computational complexity of the problem of integrating a polynomial function f over a rational simplex. We prove that the problem is NP-hard for arbitrary polynomials via a generalization of a theorem of Motzkin and…

The zeta function of an integral lattice $\Lambda$ is the generating function $\zeta_{\Lambda}(s) = \sum\limits_{n=0}^{\infty} a_n n^{-s}$, whose coefficients count the number of left ideals of $\Lambda$ of index $n$. We derive a formula…

Let $\mathbf{f}=(f\_1,\ldots,f\_m)$ and $\mathbf{g}=(g\_1,\ldots,g\_m)$ be two sets of $m\geq 1$ nonlinear polynomials over $\mathbb{K}[x\_1,\ldots,x\_n]$ ($\mathbb{K}$ being a field). We consider the computational problem of finding -- if…

We present an efficient deterministic algorithm which outputs exact expressions in terms of $n$ for the number of monic degree $n$ irreducible polynomials over $\mathbb{F}_{q}$ of characteristic $p$ for which the first $l < p$ coefficients…

The objective of this paper is to derive symmetric property of (h,q)-Zeta function with weight alpha. By using this property, we give some interesting identities for (h,q)-Genocchi polynomials with weight alpha. As a result, our…

In 2005, Kayal suggested that Schoof's algorithm for counting points on elliptic curves over finite fields might yield an approach to factor polynomials over finite fields in deterministic polynomial time. We present an exposition of his…

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…

This paper gives some results for the logarithm of the Riemann zeta-function and its iterated integrals. We obtain a certain explicit approximation formula for these functions. The formula has some applications, which are related with the…

We derive formulas for the number of points on the basic stratum of certain Kottwitz varieties in terms of automorphic representations and certain explicit polynomials, for which we present efficient algorithms for computation. We obtain…

For input $x$, let $F(x)$ denote the set of outputs that are the "legal" answers for a computational problem $F$. Suppose $x$ and members of $F(x)$ are so large that there is not time to read them in their entirety. We propose a model of…

For an analytic family P_s of polynomials in n variables (depending on a complex number s, and defined in a neighborhood of s = 0), there is defined a monodromy transformation h of the zero level set V_s= {P_s=0} for s different from 0,…

Let g >= 1 and let Q be a monic, squarefree polynomial of degree 2g + 1 in Z[x]. For an odd prime p not dividing the discriminant of Q, let Z_p(T) denote the zeta function of the hyperelliptic curve of genus g over the finite field F_p…

Let $f: {\Bbb R}^n \longrightarrow {\Bbb R}$ be a positive definite quadratic form and let $y \in {\Bbb R}^n$ be a point. We present a fully polynomial randomized approximation scheme (FPRAS) for computing $\sum_{x \in {\Bbb Z}^n}…

We first review our previous works of Arakawa and the authors on two, closely related single-variable zeta functions. Their special values at positive and negative integer arguments are respectively multiple zeta values and poly-Bernoulli…

We bound the running time of an algorithm that computes the genus-two class polynomials of a primitive quartic CM-field K. This is in fact the first running time bound and even the first proof of correctness of any algorithm that computes…

Langlands provides a formula for certain product of orbital integrals in $GL(2, \mathbb{Q})$. Its generalization has become an important question for the strategy of Beyond Endoscopy. Arthur predicts this formula should coincide with a…

We present three new, practical algorithms for polynomials in $\mathbb{Z}[x]$: one to test if a polynomial is cyclotomic, one to determine which cyclotomic polynomials are factors, and one to determine whether the given polynomial is…