Related papers: Deitmar schemes, graphs and zeta functions

Recently, we have established and used the generalized Littlewood theorem concerning contour integrals of the logarithm of analytical function to obtain new criteria equivalent to the Riemann hypothesis. Later, the same theorem was applied…

To a finite, connected, unoriented graph of Betti-number g>=2 and valencies >=3 we associate a finitely summable, commutative spectral triple (in the sense of Connes), whose induced zeta functions encode the graph. This gives another…

The Graded Classification Conjecture (GCC) states that the pointed $K_0^{\operatorname{gr}}$-group is a complete invariant of the Leavitt path algebras of finite graphs when these algebras are considered with their natural grading by…

For a graph $G = (V, E)$, the $\gamma$-graph of $G$, denoted $G(\gamma) = (V(\gamma), E(\gamma))$, is the graph whose vertex set is the collection of minimum dominating sets, or $\gamma$-sets of $G$, and two $\gamma$-sets are adjacent in…

In arXiv:1408.4708, Xu defines the dlt motivic zeta function associated to a regular function $f$ on a smooth variety $X$ over a field of characteristic zero. This is an adaptation of the classical motivic zeta function that was introduced…

We develop a formal group--theoretic framework for the Riemann zeta function by treating its Euler product as an element of the multiplicative formal group $\widehat{\mathbb{G}}_m$ and its logarithm as the associated formal group logarithm.…

We give an elementary combinatorial proof of Bass's determinant formula for the zeta function of a finite regular graph. This is done by expressing the number of non-backtracking cycles of a given length in terms of Chebychev polynomials in…

For every smooth proper scheme over a finite field $\mathbb{F}_q$, Bilu, Ho, Srinivasan, Vogt, and Wickelgren introduced the dlog zeta function with coefficients in the Grothendieck-Witt ring $\mathrm{GW}(\mathbb{F}_q)$, enriching the dlog…

Treewidth is a measure of how tree-like a graph is. It has many important algorithmic applications because many NP-hard problems on general graphs become tractable when restricted to graphs of bounded treewidth. Algorithms for problems on…

In this paper, some new results are reported for the study of Riemann zeta function $\zeta(s)$ in the critical strip $0<Re(s)<1$, such as $\zeta(s)$ expressed in a generalized Euler product only involving prime numbers. Particularly, some…

This paper describes a general framework for automatic termination analysis of logic programs, where we understand by ``termination'' the finitenes s of the LD-tree constructed for the program and a given query. A general property of…

We assign an arbitrary density matrix to a weighted graph and associate to it a graph zeta function that is both a generalization of the Ihara zeta function and a special case of the edge zeta function. We show that a recently developed…

In this paper, we investigate the Bartholdi zeta function on a connected simple digraph with $n_V$ vertices and $n_E$ edges. We derive a functional equation for the Bartholdi zeta function $\zeta_G(q,u)$ on a regular graph $G$ with respect…

We present a new method for computing the zeta function of an algebraic curve over a finite field. The algorithm relies on a trace formula of Harvey to count points on a plane model of the curve. The zeta function of the curve is then…

We discuss two combinatorical ways of generalizing the definition of expander graphs and Ramanujan graphs, to quotients of buildings of higher dimension. The two possible definitions are equivalent for affine buildings, giving the notion of…

We study zeta functions enumerating submodules invariant under a given endomorphism of a finitely generated module over the ring of ($S$-)integers of a number field. In particular, we compute explicit formulae involving Dedekind zeta…

The functional graph of a function $g:X\rightarrow X$ is the directed graph with vertex set $X$ the edges of which are of the form $x\rightarrow g(x)$ for $x\in X$. Functional graphs are heavily studied because they allow one to understand…

We introduce and study subalgebra cotype zeta functions, multivariate zeta functions enumerating fixed-index subalgebras of $R$-algebras of a given cotype. This generalizes and unifies previous works on subalgebra zeta functions and cotype…

This article is concerned with an example of complex planar geometry arising from flat origami challenges. The complexity of solution algorithms is illustrated, depending on the depth of the initial analysis of the problem, starting from…

Multifractal analysis refers to the study of the local properties of measures and functions, and consists of two parts: the fine multifractal theory and the coarse multifractal theory. The fine and the coarse theory are linked by a web of…