Related papers: Computing zeta functions of large polynomial syste…
This article discusses the classical problem of how to calculate $r_n(m)$, the number of ways to represent an integer $m$ by a sum of $n$ squares from a computational efficiency viewpoint. Although this problem has been studied in great…
Polynomial factorization over $ZZ$ is of great historical and practical importance. Currently, the standard technique is to factor the polynomial over finite fields first and then to lift to integers. Factorization over finite fields can be…
This paper studies algebraic and analytic structures associated with the Lerch zeta function, extending the complex variables viewpoint taken in part II. The Lerch transcendent $\Phi(s, z, c)$ is obtained from the Lerch zeta function…
We introduce an algorithm to compute the functions belonging to a suitable set ${\mathscr F}$ defined as follows: $f\in {\mathscr F}$ means that $f(s,x)$, $s\in A\subset {\mathbb R}$ being fixed and $x>0$, has a power series expansion…
We set new speed records for multiplying long polynomials over finite fields of characteristic two. Our multiplication algorithm is based on an additive FFT (Fast Fourier Transform) by Lin, Chung, and Huang in 2014 comparing to previously…
Let $x$ be a complex number which has a positive real part, and $w_1,\ldots,w_N$ be positive rational numbers. We show that $w^s \zeta_N (s, x \ |\ w_1,\ldots, w_N)$ can be expressed as a finite linear combination of the Hurwitz zeta…
We introduce matching functions as a means of summing heavy-quark logarithms to any order. Our analysis is based on Witten's approach, where heavy quarks are decoupled one at a time in a mass-independent renormalization scheme. The outcome…
We give lower bounds for the degree of multiplicative combinations of iterates of rational functions (with certain exceptions) over a general field, establishing the multiplicative independence of said iterates. This leads to a…
We use the notion of Milnor fibres of the germ of a meromorphic function and the method of partial resolutions for a study of topology of a polynomial map at infinity (mainly for calculation of the zeta-function of a monodromy). It gives…
We present two new algorithms for the computation of the q-integer linear decomposition of a multivariate polynomial. Such a decomposition is essential for the treatment of q-hypergeometric symbolic summation via creative telescoping and…
We count the number of polynomials over finite fields with prescribed leading coefficients and a given number of linear factors. This is equivalent to counting codewords in Reed-Solomon codes which are at a certain distance from a received…
In this paper, we establish Kronecker limit type formulas for the generalized Mordell--Tornheim zeta function $\Theta(r,s,t,x)$ as a function of the third variable, in terms of Riemann-zeta and Gamma values. We also give series evaluations…
We present a quantum algorithm for systems of (possibly inhomogeneous) linear ordinary differential equations with constant coefficients. The algorithm produces a quantum state that is proportional to the solution at a desired final time.…
Building on the mapping relations between analytic functions and periodic functions using the abstract operators $\cos(h\partial_x)$ and $\sin(h\partial_x)$, and by defining the Zeta and related functions including the Hurwitz Zeta function…
An algorithm for factoring polynomials over finite fields is given by Berlekamp in 1967. The main tool was the matrix Q corresponding to each polynomial. This paper studies the degrees of polynomials over binary field that associated with…
The main object of this paper is to obtain several symmetric properties of the q-Zeta type functions. As applications of these properties, we give some new interesting identities for the modified q-Genocchi polynomials. Finally, our…
In this paper we consider polynomial representability of functions defined over $Z_{p^n}$, where $p$ is a prime and $n$ is a positive integer. Our aim is to provide an algorithmic characterization that (i) answers the decision problem: to…
We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our…
We looked into the algorithm for calculating Betti numbers presented by Lloyd, Garnerone, and Zanardi (LGZ). We present a new algorithm in the same spirit as LGZ with the intent of clarifying quantum algorithms for computing Betti numbers.…
We present some simple proofs of the well-known expressions for \[ \zeta(2k) = \sum_{m=1}^\infty \frac{1}{m^{2k}}, \qquad \beta(2k+1) = \sum_{m=0}^\infty \frac{(-1)^m}{(2m+1)^{2k+1}}, \] where $k = 1,2,3,\dots$, in terms of the Bernoulli…