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

We give an explicit formula of the coefficients of the Zeta-Function's L-polynomial for algebraic function fields over finite constant fields. Thus, we deduce an expression of the class number of algebraic function fields defined over…

Given a way to evaluate an unknown polynomial with integer coefficients, we present new algorithms to recover its nonzero coefficients and corresponding exponents. As an application, we adapt this interpolation algorithm to the problem of…

Motivated by broad applications in reinforcement learning and federated learning, we study local stochastic approximation over a network of agents, where their goal is to find the root of an operator composed of the local operators at the…

We describe a solution of the Gauss hypergeometric equation, $F(\alpha,\beta,\gamma;z)$ by power series in paramaters $\alpha,\beta,\gamma$ whose coefficients are $\Z$ linear combinations of multiple polylogarithms. And using the…

In this paper, we establish a new zeta function based on the Bartholdi zeta function for an undirected graph G called the reduced Bartholdi zeta function. We study the relation between its coefficients and the structure of the graph, and…

In this expository article we show explicitly how to compute Gamma(p/q) in terms of Beta function values which in turn are Kontsevich-Zagier Periods.

If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…

Based upon the fast computation of the coefficients of the interpolation polynomials at Chebyshev-type points by FFT, DCT and IDST, respectively, together with the efficient evaluation of the modified moments by forwards recursions or by…

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, a polynomial-time algorithm is given to compute the generalized Hermite normal form for a matrix F over Z[x], or equivalently, the reduced Groebner basis of the Z[x]-module generated by the column vectors of F. The algorithm…

Let $Q(x)$ be a quadratic form over $\mathbb{R}^n$. The Epstein zeta function associated to $Q(x)$ is a well known function in number theory. We generalize the construction of the Epstein zeta function to a class of function $\phi(x)$…

Let a polytope $P$ be defined by a system $A x \leq b$. We consider the problem of counting the number of integer points inside $P$, assuming that $P$ is $\Delta$-modular, where the polytope $P$ is called $\Delta$-modular if all the rank…

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…

The fundamental objective of this paper is to obtain some interesting properties for $\left(h,q\right)$-Genocchi numbers and polynomials by using the fermionic $p$-adic $q$-integral on $\mathbb{Z}_{p}$ and mentioned in the paper…

Consider a sparse polynomial in several variables given explicitly as a sum of non-zero terms with coefficients in an effective field. In this paper, we present several algorithms for factoring such polynomials and related tasks (such as…

We prove by an elementary method the Riemann hypothesis for the local Euler factor of the zeta function of quadratic orders.

This is the first of two papers in which we introduce and study two bivariate zeta functions associated to unipotent group schemes over rings of integers of number fields. One of these zeta functions encodes the numbers of isomorphism…

We devise a polynomial-time approximation scheme for the classical geometric problem of finding an approximate short path amid weighted regions. In this problem, a triangulated region P comprising of n vertices, a positive weight associated…

We show a new algorithm and its implementation for multiplying bit-polynomials of large degrees. The algorithm is based on evaluating polynomials at a specific set comprising a natural set for evaluation with additive FFT and a high order…

To infer a function value on a specific point $x$, it is essential to assign higher weights to the points closer to $x$, which is called local polynomial / multivariable regression. In many practical cases, a limited sample size may ruin…