Related papers: On graph theory Mertens' theorems
We first construct a dynamical systems model which in its steady-state serves as an analytic continuation of the completed Riemann zeta function over the entire critical strip. The resulting mathematical construct involves a linear…
We introduce a graph-theoretical interpretation of an induced action of Aut$(\Gamma)$ in the discrete de Rham cohomology of a finite graph $\Gamma$. This action produces a splitting of Aut$(\Gamma)$ that depends on the cycles of $\Gamma$.…
This work is devoted to the study of the relationships between graph theory and the qualitative analysis of ordinary differential equations, with a special focus on two-dimensional systems. In particular, we reinterpret classical results…
In our previous papers, we have introduced within the theory of the Riemann zeta function the following notions: Jacob's ladders, oscillating systems, $\zeta$-factorization, metamorphoses, \dots In this paper we obtain $\zeta$-analogue of…
Ihara initiated to study a certain Galois representation which may be seen as an arithmetic analogue of the Artin representation of a pure braid group. We pursue the analogies in Ihara theory further, following after some issues and their…
We give a representation of the classical Riemann $\zeta$-function in the half plane $\Re s>0$ in terms of a Mellin transform involving the real part of the dilogarithm function with an argument on the unit circle (associated Clausen…
We present a graph theory-based method to characterise flow defects and structural shifts in condensed matter. We explore the connection between dynamical properties, particularly the recently introduced concept of ''softness'', and…
To a simple graph we associate a so-called graph series, which can be viewed as the Hilbert--Poincar\'e series of a certain infinite jet scheme. We study new $q$-representations and examine modular properties of several examples including…
The purpose of this paper is to analyze the Moore-Penrose pseudo-inversion of symmetric real matrices with application in the graph theory. We introduce a novel concept of positively and negatively pseudo-inverse matrices and graphs. We…
This note contains a new combinatorial proof of Cramer's rule based on the Gessel-Viennot-Lindstrom Lemma.
In this paper we prove Morse index theorems for a big class of constrained variational problems on graphs. Such theorems are useful in various physical and geometric applications. Our formulas compute the difference of Morse indices of two…
We define a new weighted zeta function for a finite graph and obtain its determinant expression. This result gives the characteristic polynomial of the transition matrix of the Szegedy walk on a graph.
Leighton's graph covering theorem states that a pair of finite graphs with isomorphic universal covers have a common finite cover. We provide a new proof of Leighton's theorem that allows generalizations; we prove the corresponding result…
Graphs are commonly used in mathematics to represent some relationships between items. However, as simple objects, they sometimes fail to capture all relevant aspects of real-world data. To address this problem, we generalize them and model…
In this article, we study questions pertaining to ramified $\mathbb{Z}_p^d$-extensions of a finite connected graph $X$. We also study the Iwasawa theory of dual graphs.
Szemer\'edi's regularity lemma is a basic tool in graph theory, and also plays an important role in additive combinatorics, most notably in proving Szemer\'edi's theorem on arithmetic progressions . In this note we revisit this lemma from…
Two-sample tests utilizing a similarity graph on observations are useful for high-dimensional and non-Euclidean data due to their flexibility and good performance under a wide range of alternatives. Existing works mainly focused on sparse…
We consider vertex decompositions of (di)graphs which appear in Automata Theory, and establish some their properties. Then we apply them to the problem of forbidden subgraphs.
We extend previous work on injectivity in chemical reaction networks to general interaction networks. Matrix- and graph-theoretic conditions for injectivity of these systems are presented. A particular signed, directed, labelled, bipartite…
Recently, Gnutzmann and Smilansky presented a formula for the bond scattering matrix of a graph with respect to a Hermitian matrix. We present another proof for this Gnutzmann and Smilansky's formula by a technique used in the zeta function…