相关论文: The coefficients of the reduced Bartholdi zeta fun…

We obtain formulas for the coefficients of positive and negative powers of a partial theta function.

We establish the quaternionic weighted zeta function of a graph and its Study determinant expressions. For a graph with quaternionic weights on arcs, we define a zeta function by using an infinite product which is regarded as the Euler…

In this article, we introduce a systematic new method to investigate the conjectural p-adic meromorphic continuation of Professor Bernard Dwork's unit root zeta function attached to an ordinary family of algebraic varieties defined over a…

Let $\mathcal{D}$ be a weighted oriented graph and $I(\mathcal{D})$ be its edge ideal. In this paper, we investigate the Betti numbers of $I(\mathcal{D})$ via upper-Koszul simplicial complexes, Betti splittings and the mapping cone…

In this paper, we give an overview of the various general methods in computing the zeta function of an algebraic variety defined over a finite field, with an emphasis on computing the reduction modulo $p^m$ of the zeta function of a…

Given an undirected graph G or hypergraph X model for a given set of variables V, we introduce two marginalization operators for obtaining the undirected graph GA or hypergraph HA associated with a given subset A c V such that the marginal…

Let $G$ be a graph, and let $\lambda(G)$ denote the smallest eigenvalue of $G$. First, we provide an upper bound for $\lambda(G)$ based on induced bipartite subgraphs of $G$. Consequently, we extract two other upper bounds, one relying on…

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…

Due to their singularities, multiple zeta functions behave sensitively at non-positive integer points. In this article, we focus on the asymptotic behavior at the origin $(0,\dots, 0)$ and unveil the generating series of the asymptotic…

We study dynamics of the Latt\`es maps in the complex plane in terms of the Cuntz-Krieger algebras associated to the endomorphisms of the non-commutative tori. In particular, it is shown that iterations of the Latt\`es maps can be reduced…

We approximate the Riemann Zeta-Function by polynomials and Dirichlet polynomials with restricted zeros.

In this article we derive, using the Lagrange inversion theorem and applying twice the Fa\`a di Bruno formula, an expression of the minimum of the Gamma function $\Gamma$ as an expansion in powers of the Euler-Mascheroni constant $\gamma$.…

We introduce a new algorithm to compute the zeta function of a curve over a finite field. This method extends previous work of ours to all curves for which a good lift to characteristic zero is known. We develop all the necessary bounds,…

The Tutte polynomial is a fundamental invariant of graphs. In this article, we define and study a generalization of the Tutte polynomial for directed graphs, that we name B-polynomial. The B-polynomial has three variables, but when…

The higher rank Lefschetz formula for p-adic groups is used to prove rationality of a several-variable zeta function attached to the action of a p-adic group on its Bruhat-Tits building. By specializing to certain lines one gets…

For operators on a compact manifold $X$ with boundary $\partial X$, the basic zeta coefficient $C_0(B, P_{1,T})$ is the regular value at $s=0$ of the zeta function $\Tr(B P_{1,T}^{-s})$, where $B=P_++G$ is a pseudodifferential boundary…

Previously the authors proved subconvexity of Shintani's zeta function enumerating class numbers of binary cubic forms. Here we return to prove subconvexity of the Maass form twisted version.

We construct variants of the Riemann zeta function with convenient properties and make conjectures about their dynamics; some of the conjectures are based on an analogy with the dynamical system of zeta. More specifically, we study the…

In this paper we consider the fundamental problem of approximating the diameter $D$ of directed or undirected graphs. In a seminal paper, Aingworth, Chekuri, Indyk and Motwani [SIAM J. Comput. 1999] presented an algorithm that computes in…

The analysis of signals defined over a graph is relevant in many applications, such as social and economic networks, big data or biological networks, and so on. A key tool for analyzing these signals is the so called Graph Fourier Transform…