相关论文: Zeta functions of orders on surfaces
This is a review of some of the interesting properties of the Riemann Zeta Function.
In this paper we define a continuous version of multiple zeta functions. They can be analytically continued to meromorphic functions on $\mathbb{C}^r$ with only simple poles at some special hyperplanes. The evaluations of these functions at…
We investigate analytic properties of height zeta functions of toric bundles over flag varieties.
(This is only a first preliminary version, any suggestions about it will be welcome.) In this paper it is shown how to compute Riemann's zeta function $\zeta(s)$ (and Riemann-Siegel $Z(t)$) at any point $s\in\mathbf C$ with a prescribed…
We define the rank-metric zeta function of a code as a generating function of its normalized $q$-binomial moments. We show that, as in the Hamming case, the zeta function gives a generating function for the weight enumerators of rank-metric…
An analysis of the zeta and gamma function is presented, using elementary functions like [] and {}, a general formula for the angle of zeta(1/2 + i*n) is found and the same for the gamma function.
On an open manifold, the spaces of metrics or connections of bounded geometry, respectively, split into an uncountable number of components. We show that for a pair of metrics or connections, belonging to the same component, relative…
We consider the generalized weighted zeta function for a finite digraph, and show that it has the Ihara expression, a determinant expression of graph zeta functions, with a certain specified definition for inverse arcs. A finite digraph in…
We obtain optimal lower bounds for moments of theta functions. On the other hand, we also get new upper bounds on individual theta values and moments of theta functions on average over primes. The upper bounds are based on bounds of…
Inspired by work surrounding Igusa's local zeta function, we introduce topological representation zeta functions of unipotent algebraic groups over number fields. These group-theoretic invariants capture common features of established…
We compute in a direct (not algorithmic) way the zeta function of all supersingular curves of genus 2 over a finite field k, with many geometric automorphisms. We display these computations in an appendix where we select a family of…
We define the zeta function of a finite category. And we propose a conjecture which states the relationship between the Euler characteristic of finite categories and the zeta function of finite categories. This conjecture is verified when…
Observing a multiple version of the divisor function we introduce a new zeta function which we call a multiple finite Riemann zeta function. We utilize some $q$-series identity for proving the zeta function has an Euler product and then,…
In this paper, we improve the algorithms of Lauder-Wan \cite{LW} and Harvey \cite{Ha} to compute the zeta function of a system of $m$ polynomial equations in $n$ variables over the finite field $\FF_q$ of $q$ elements, for $m$ large. The…
In this paper we develop the analytic theory of a multiple zeta function in d independent complex variables defined over a global function field. This is the function field analog of the Euler-Zagier multiple zeta function of depth d.
The definition and main properties of the Ihara zeta function for graphs are reviewed, focusing mainly on the case of periodic simple graphs. Moreover, we give a new proof of the associated determinant formula, based on the treatment…
We give an algorithm to determine factorization types of primes in the number fields generated by a single point of odd order on an elliptic curve. We apply this to compute coefficients of the Dedekind zeta function of the field.
We give a description of finite-zone PT-potentials in terms of explicit theta functional formulas.
Stark and Terras introduced the edge zeta function of a finite graph in 1996. The edge zeta function is the reciprocal of a polynomial in twice as many variables as edges in the graph and can be computed in polynomial time. We look at graph…
This article concerns the computational complexity of a fundamental problem in number theory: counting points on curves and surfaces over finite fields. There is no subexponential-time algorithm known and it is unclear if it can be…