English
Related papers

Related papers: Computing zeta functions of large polynomial syste…

200 papers

In this paper, we show some expressions of certain $q$-multiple zeta-star values at roots of unity. These explicit formulas are expressed by using the determinants or Bell polynomials. Explicit formulas for other types of values can be…

Number Theory · Mathematics 2025-06-23 Takao Komatsu

We intimate deeper connections between the Riemann zeta and gamma functions than often reported and further derive a new formula for expressing the value of $\zeta(2n+1)$ in terms of zeta at other fractional points. This paper also…

General Mathematics · Mathematics 2014-11-13 Michael A. Idowu

This work formalizes efficient Fast Fourier-based multiplication algorithms for polynomials in quotient rings such as $\mathbb{Z}_{m}[x]/\left<x^{n}-a\right>$, with $n$ a power of 2 and $m$ a non necessarily prime integer. We also present a…

Discrete Mathematics · Computer Science 2023-04-19 Ramiro Martínez , Paz Morillo

In a recent paper Z\'u\~niga-Galindo and the author begun the study of the local zeta functions for Laurent polynomials. In this work we continue this study by giving a very explicit formula for the local zeta function associated to a…

Algebraic Geometry · Mathematics 2016-11-09 Edwin León-Cardenal

We describe an algorithm to compute the zeta function of a cyclic cover of the projective line over a finite field of characteristic $p$ that runs in time $p^{1/2 + o(1)}$. We confirm its practicality and effectiveness by reporting on the…

Number Theory · Mathematics 2019-02-13 Vishal Arul , Alex J. Best , Edgar Costa , Richard Magner , Nicholas Triantafillou

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…

Number Theory · Mathematics 2025-05-15 Takao Komatsu

We present a randomized algorithm for solving low-degree polynomial equation systems over finite fields faster than exhaustive search. In order to do so, we follow a line of work by Lokshtanov, Paturi, Tamaki, Williams, and Yu (SODA 2017),…

Computational Complexity · Computer Science 2024-10-29 Holger Dell , Anselm Haak , Melvin Kallmayer , Leo Wennmann

We consider a version of the nearest-codeword problem on finite fields $\mathbb{F}_q$ using the Manhattan distance, an analog of the Hamming metric for non-binary alphabets. Similarly to other lattice related problems, this problem is…

Quantum Physics · Physics 2023-09-13 Lior Eldar

Recently, the higher-order q-Euler polynomials and multiple q-Euler zeta functions are introduced by T. Kim ([8, 9]). In this paper, we investigate some symmetric properties of the multiple q-Euler zeta function and derive various…

Number Theory · Mathematics 2013-12-30 Dae San Kim , Taekyun Kim

Partial zeta functions of algebraic varieties over finite fields generalize the classical zeta function by allowing each variable to be defined over a possibly different extension field of a fixed finite field. Due to this extra variation…

Number Theory · Mathematics 2022-10-27 Noah Bertram , Xiantao Deng , C. Douglas Haessig , Yan Li

An important step in the efficient computation of multi-dimensional theta functions is the construction of appropriate symplectic transformations for a given Riemann matrix assuring a rapid convergence of the theta series. An algorithm is…

Exactly Solvable and Integrable Systems · Physics 2017-01-27 J. Frauendiener , C. Jaber , C. Klein

The main purpose of this paper is to show some relations between the Riemann zeta function and the generalized Bernoulli polynomials of level $m$. Our approach is based on the use of Fourier expansions for the periodic generalized Bernoulli…

Classical Analysis and ODEs · Mathematics 2019-01-15 Yamilet Quintana , Héctor Torres-Guzmán

For each $(m+1)$-tuple ${\bf n}_m=(n_0,n_1,\ldots,n_m)$ of positive integers, the ${\bf n}_m$-derived zeta function $\widehat\zeta_{X,\mathbb F_q}^{\,({\bf n}_m)}(s)$ is defined for a curve $X$ over $\mathbb F_q$. This derived zeta function…

Algebraic Geometry · Mathematics 2022-03-23 Lin Weng

An alternative formula is presented for the evaluation of the zeta function values $\zeta(2k)$ without the need for Bernoulli numbers. Our formula is recursive, and improves the efficiency with which we can calculate large values of the…

Numerical Analysis · Mathematics 2011-11-18 Srinivasan Arunachalam

We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), (Gao, 2001) designed a polynomial time algorithm that fails to factor only if the input polynomial…

Data Structures and Algorithms · Computer Science 2008-02-21 Chandan Saha

We give an explicit formula of the coefficients of the Zeta-Function's L-polynomial for algebraic function fields over finite constant fields. Thus, we deduce an expression of the class number of algebraic function fields defined over…

Algebraic Geometry · Mathematics 2026-02-26 Mahdi Mohamed Koutchoukali

By using the method of iterated integral representations of series, we establish some explicit relationships between multiple zeta values and Integrals of logarithmic functions. As applications of these relations, we show that multiple zeta…

Number Theory · Mathematics 2017-01-03 Ce Xu

We give a polynomial time algorithm for computing the Igusa local zeta function $Z(s,f)$ attached to a polynomial $f(x)\in \QTR{Bbb}{Z}[x]$, in one variable, with splitting field $\QTR{Bbb}{Q}$, and a prime number $p$. We also propose a new…

Symbolic Computation · Computer Science 2007-05-23 W. A. Zuniga-Galindo

We present a method for computing the zeta function of a smooth projective variety over a finite field which proceeds by induction on the dimension. We have implemented our approach for some surfaces using the Magma programming language,…

Number Theory · Mathematics 2007-05-23 Alan G. B. Lauder

Given a convex set $Q \subseteq R^m$ and an integer matrix $W \in Z^{m \times n}$, we consider statements of the form $ \forall b \in Q \cap Z^m$ $\exists x \in Z^n$ s.t. $Wx \leq b$. Such statements can be verified in polynomial time with…

Optimization and Control · Mathematics 2024-07-01 Eleonore Bach , Friedrich Eisenbrand , Thomas Rothvoss , Robert Weismantel