Related papers: Computing zeta functions of large polynomial syste…
The enumeration of points on (or off) the union of some linear or affine subspaces over a finite field is dealt with in combinatorics via the characteristic polynomial and in algebraic geometry via the zeta function. We discuss the basic…
A novel recurrence formula for moments with respect to M\"{u}ntz-Legendre polynomials is proposed and applied to construct a numerical method for solving generalized Gauss quadratures with power function weight for M\"{u}ntz systems. These…
We give new closed and explicit formulas for "multiple zeta values" at non-positive integers of generalized Euler-Zagier multiple zeta-functions. We first prove these formulas for a small convenient class of these multiple zeta-functions…
We define a zeta function of a graph by using the time evolution matrix of a general coined quantum walk on it, and give a determinant expression for the zeta function of a finite graph. Furthermore, we present a determinant expression for…
The Mordell-Tornheim zeta function and the Herglotz-Zagier function $F(x)$ are two important functions in Mathematics. By generalizing a special case of the former, namely $\Theta(z, x)$, we show that the theories of these functions are…
In this paper, we present a new algorithm and an experimental implementation for factoring elements in the polynomial n'th Weyl algebra, the polynomial n'th shift algebra, and ZZ^n-graded polynomials in the n'th q-Weyl algebra. The most…
Using a different approach, we derive integral representations for the Riemann zeta function and its generalizations (the Hurwitz zeta, $\zeta(-k,b)$, the polylogarithm, $\mathrm{Li}_{-k}(e^m)$, and the Lerch transcendent,…
The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.
In this paper, we define finite Carlitz multiple polylogarithms and show that every finite multiple zeta value over the rational function field $\mathbb{F}_{q}(\theta)$ is an $\mathbb{F}_{q}(\theta)$-linear combination of finite Carlitz…
Kostka, Littlewood-Richardson, Plethysm and Kronecker coefficients are the multiplicities of irreducible representations in the decomposition of representations of the symmetric group that play an important role in representation theory,…
The Fermi function $F(Z,E)$ accounts for QED corrections to beta decays that are enhanced at either small electron velocity $\beta$ or large nuclear charge $Z$. For precision applications, the Fermi function must be combined with other…
We compute the coefficients of the polynomials $C_n(q)$ defined by the equation \begin{equation*} 1 + \sum_{n\geq 1} \, \frac{C_n(q)}{q^n} \, t^n = \prod_{i\geq 1}\, \frac{(1-t^i)^2}{1-(q+q^{-1})t^i + t^{2i}} \, . \end{equation*} As an…
In this paper we present a p-adic algorithm to compute the zeta function of a nondegenerate curve over a finite field using Monsky-Washnitzer cohomology. The paper vastly generalizes previous work since all known cases, e.g. hyperelliptic,…
We study the efficiency of algorithms simulating a system evolving with Hamiltonian $H=\sum_{j=1}^m H_j$. We consider high order splitting methods that play a key role in quantum Hamiltonian simulation. We obtain upper bounds on the number…
We write down the functional equation of the zeta function of a global field. This equation is implicit in Weil's ``Basic Number Theory''.
In this paper we give a detailed analysis of deterministic and randomized algorithms that enumerate any number of irreducible polynomials of degree $n$ over a finite field and their roots in the extension field in quasilinear where $N=n^2$…
In this paper, by introducing a new operation in the vector space of analytic functions, the author presents a method for derivating the well-known formulas: $\zeta(1-k)=-\frac{B_k}{k}$ and $\zeta(1-n,a)=-\frac{B_n(a)}{n}$ , where $\zeta$,…
We establish a series of integral formulae involving the Hurwitz zeta function. Applications are given to integrals of Bernoulli polynomials, log Gamma(q) and log sin(q).
The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a…
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…