Related papers: Computing zeta functions of large polynomial syste…
We show how the pre-exponential factor of the Feynman propagator for the harmonic oscillator can be computed by the generalized $\zeta$-function method. Besides, we establish a direct equivalence between this method and Schwinger's…
Zeta functions of periodic cubical lattices are explicitly derived by computing all the eigenvalues of the adjacency operators and their characteristic polynomials. We introduce cyclotomic-like polynomials to give factorization of the zeta…
We define an enrichment of the logarithmic derivative of the zeta function of a variety over a finite field to a power series with coefficients in the Grothendieck--Witt group. We show that this enrichment is related to the topology of the…
We offer multiplication method for factoring big natural numbers which extends the group of the Fermat's and Lehman's factorization algorithms and has run-time complexity $O(n^{1/3})$. This paper is argued the finiteness of proposed…
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…
We consider the problem of optimizing a multivariate quadratic function where each decision variable is constrained to be a complex $m$'th root of unity. Such problems have applications in signal processing, MIMO detection, and the…
In this paper we obtain new infinite sets of $\zeta$-equivalents of the Fermat-Wiles theorem based on the elementary Fourier orthogonal system, Riemann's zeta-function and Jacob's ladders.
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…
Let K/F be a quadratic extension of number fields. After developing a theory of the Eisenstein series over F, we prove a formula which expresses a partial zeta function of K as a certain integral of the Eisenstein series. As an application,…
The Riemann theta function is a complex-valued function of g complex variables. It appears in the construction of many (quasi-) periodic solutions of various equations of mathematical physics. In this paper, algorithms for its computation…
We examine "partition zeta functions" analogous to the Riemann zeta function but summed over subsets of integer partitions. We prove an explicit formula for a family of partition zeta functions already shown to have nice properties -- those…
This paper studies a zeta function of two complex variables (w, s) attached to an algebraic number field K, introduced by van der Geer and Schoof, which is based on an analogue of the Riemann-Roch theorem for number fields using Arakelov…
Let $\mathbb{F}_q$ be a finite field with $q$ elements, $\psi$ a non-zero element of $\mathbb{F}_q$, and $n$ an integer $\geq 3$ prime to $q$. The aim of this article is to show that the zeta function of the projective variety over…
We design and analyze an algorithm for computing solutions with coefficients in a finite field $\mathbb{F}_q$ of underdetermined systems defined over $\mathbb{F}_q$. The algorithm is based on reductions to zero-dimensional searches. The…
Quantum algorithms for topological data analysis (TDA) seem to provide an exponential advantage over the best classical approach while remaining immune to dequantization procedures and the data-loading problem. In this paper, we give…
Let $k$ be a finite field, and $L$ be a $q$-linearized polynomial defined over $k$ of $q$-degree $r$ ($L=\sum^r_{i=0}a_iZ^{q^i}$, with $a_i\in k$). This paper provides an algorithm to compute a characteristic polynomial of $L$ over a large…
We introduce a polynomial zeta function $\zeta^{(p)}_{P_n}$, related to certain problems of mathematical physics, and compute its value and the value of its first derivative at the origin $s=0$, by means of a very simple technique. As an…
We derive new infinite series involving Fibonacci numbers and Riemann zeta numbers. The calculations are facilitated by evaluating linear combinations of polygamma functions of the same order at certain arguments.
The fastest known algorithm for factoring univariate polynomials over finite fields is the Kedlaya-Umans (fast modular composition) implementation of the Kaltofen-Shoup algorithm. It is randomized and takes $\widetilde{O}(n^{3/2}\log q + n…
We provide a formula for the generating series of the zeta function $Z(X,t)$ of symmetric powers $Sym^n X$ of varieties over finite fields. This realizes $Z(X,t)$ as an exponentiable motivic measure whose associated Kapranov motivic zeta…