Related papers: Computing zeta functions of large polynomial syste…
The $N$th power of a polynomial matrix of fixed size and degree can be computed by binary powering as fast as multiplying two polynomials of linear degree in~$N$. When Fast Fourier Transform (FFT) is available, the resulting complexity is…
This paper continues a series of investigations on converging representations for the Riemann Zeta function. We generalize some identities which involve Riemann's zeta function, and moreover we give new series and integrals for the zeta…
Using a summation identity obtained for the Fourier coefficients of $x^{2k}$, we derive a closed form expression for the zeta function at even positive integers, using a technique similar to one in an existing proof by Aladdi and Defant[1],…
We combine dependent types with linear type systems that soundly and completely capture polynomial time computation. We explore two systems for capturing polynomial time: one system that disallows construction of iterable data, and one,…
We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify polynomial runtime complexity of term rewrite systems and the polytime computability of the…
It is known that there is no EPTAS for the $m$-dimensional knapsack problem unless $W[1] = FPT$. It is true already for the case, when $m = 2$. But, an FPTAS still can exist for some other particular cases of the problem. In this note, we…
We study ``forms of the Fermat equation'' over an arbitrary field $k$, i.e. homogenous equations of degree $m$ in $n$ unknowns that can be transformed into the Fermat equation $X_1^m+...+X_n^m$ by a suitable linear change of variables over…
For the function $f(m,p,q,n)$, where $k,s,a$ general complex numbers and $q$ any positive integer, we establish the sum of values of the Hurwitz-Lerch zeta function $\Phi(f(m,p,q,n),k,a)$ taken at prime numbers $n$. Special cases of this…
Recently, several people study finite multiple zeta values (FMZVs) and finite polylogarithms (FPs). In this paper, we introduce finite multiple polylogarithms (FMPs), which are natural generalizations of FMZVs and FPs, and we establish…
To obtain the Dirichlet series for complex powers of the Riemann zeta function, we define and study the basic properties of a sequence of polynomials that, used as coefficients of the respective terms of the Dirichlet series of the Riemann…
We study the interplay between recurrences for zeta related functions at integer values, `Minor Corner Lattice' Toeplitz determinants and integer composition based sums. Our investigations touch on functional identities due to Ramanujan and…
In the paper, we introduce $q$-deformations of the Riemann zeta function, extend them to the whole complex plane, and establish certain estimates of the number of roots. The construction is based on the recent difference generalization of…
We study the properties of a function $\psi(z, q)$ (the generalized polygamma function), intimately connected with the Hurwitz zeta function and defined for complex values of the variables $z$ and $q$, which is entire in the variable $z$…
This paper introduces a novel method for approximating the dynamics of a large autonomous system projected onto a fixed subspace. The core contribution is a novel recursive algorithm to construct an effective time-dependent generator that…
Harrow, Hassidim, and Lloyd showed that for a suitably specified $N \times N$ matrix $A$ and $N$-dimensional vector $\vec{b}$, there is a quantum algorithm that outputs a quantum state proportional to the solution of the linear system of…
The topological zeta function of a matroid is a rational function as well as a valuative invariant of the matroid, encoding rich combinatorial information. We analyze topological zeta functions of matroids from the vantage point of several…
The purpose of this article is to give an explicit description, in terms of hypergeometric functions over finite fields, of zeta function of a certain type of smooth hypersurfaces that generalizes Dwork family. The point here is that we…
We introduce the multiple zeta functions with structures similar to those of symmetric functions such as Schur $P$-, Schur $Q$-, symplectic and orthogonal functions in the representation theory. We first consider their basic properties such…
We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…
We represent the Riemann zeta function in the half-plane $\Re s >1$ via series whose terms admit geometrically decreasing bounds. Due to an underlying recurrence relation, which is used to compute coefficients entering into the terms, the…