相关论文: Computing Igusa's local zeta functions of univaria…

Let $K$ be a local field and $f(x)\in K[x]$ be a non-constant polynomial. The local zeta function $Z_f(s, \chi)$ was first introduced by Weil, then studied in detail by Igusa. When ${\rm char}(K)=0$, Igusa proved that $Z_f(s, \chi)$ is a…

We extend the approach Abbott, Kedlaya and Roe to computation of the zeta function of a projective hypersurface with $\tau$ isolated ordinary double points over a finite field $\mathbb{F}_q$ given by the reduction of a homogeneous…

We compute the local pro-isomorphic zeta functions at all but finitely many primes for a certain family of class-two-nilpotent Lie lattices of even rank, parametrized by irreducible non-linear polynomials $f(x) \in \mathbb{Z} [x]$, that…

The reciprocal of the Ihara zeta function of a graph is a polynomial invariant introduced by Ihara in 1966. Scott and Storm gave a method to determine the coefficients of the polynomial. Here we simplify their calculation and determine the…

This paper provides specific results on the Igusa local zeta function for the curves $x^n+y^m$. In addition to specific results, we give an introduction to $p$-adic analysis and a discussion of various methods which have been used to…

We introduce and study new versions of polylogarithms and a zeta function on a completion of $\mathbb F_q (x)$ at a finite place. The construction is based on the use of the Carlitz differential equations for $\mathbb F_q$-linear functions.

We provide the formula of motivic zeta function for semi-quasihomogeneous singularities and in dimension two, we determine the poles of zeta functions. We also give another formula for stringy E-function using embedded…

Let K be a global field and f in K[X] be a polynomial. We present an efficient algorithm which factors f in polynomial time.

Finding an irreducible factor, of a polynomial $f(x)$ modulo a prime $p$, is not known to be in deterministic polynomial time. Though there is such a classical algorithm that {\em counts} the number of irreducible factors of $f\bmod p$. We…

We define motivic analogues of Igusa's local zeta functions. These functions take their values in a Grothendieck group of Chow motives. They specialize to p-adic Igusa local zeta functions and to the topological zeta functions we introduced…

We propose the construction of an ensemble of unitary random matrices (UMM) for the Riemann zeta function. Our approach to this problem is `$p$-iecemeal', in the sense that we consider each factor in the Euler product representation of the…

Conjectures of J. Igusa for p-adic local zeta functions and of J. Denef and F. Loeser for topological local zeta functions assert that (the real part of) the poles of these local zeta functions are roots of the Bernstein-Sato polynomials…

Given a function $f$ in a finite field ${\mathbb F}_q$ of $q$ elements, we define the functional graph of $f$ as a directed graph on $q$ nodes labelled by the elements of ${\mathbb F}_q$ where there is an edge from $u$ to $v$ if and only if…

Polynomial factoring has famous practical algorithms over fields-- finite, rational \& $p$-adic. However, modulo prime powers it gets hard as there is non-unique factorization and a combinatorial blowup ensues. For example, $x^2+p \bmod…

We investigate Solomon's zeta function for orders in the special case of orders generated by the standard basis of an integral table algebra, a special case of which is the integral adjacency algebra of an association scheme. As Solomon's…

The main objective of this paper is to prove the monodromy conjecture for the local Igusa zeta function of a quasi-ordinary polynomial of arbitrary dimension defined over a number field. In order to do it, we compute the local Denef-Loeser…

We develop a meta-algorithm that, given a polynomial (in one or more variables), and a prime p, produces a fast (logarithmic time) algorithm that takes a positive integer n and outputs the number of times each residue class modulo p appears…

In this paper, we give the values of a certain kind of $q$-multiple zeta functions at roots of unity. Various multiple zeta values have been proposed and studied by many researchers, but these multiple zeta values naturally arise from…

We present an efficient quantum algorithm for the exact evaluation of either the fully ferromagnetic or anti-ferromagnetic q-state Potts partition function Z for a family of graphs related to irreducible cyclic codes. This problem is…

Building on our previous work (arXiv:1405.5711), we develop the first practical algorithm for computing topological zeta functions of nilpotent groups, non-associative algebras, and modules. While we previously depended upon non-degeneracy…