Related papers: Index theorems for quantum graphs
In this paper we investigate the extremal relationship between two well-studied graph parameters: the order of the largest homogeneous set in a graph $G$ and the maximal number of distinct degrees appearing in an induced subgraph of $G$,…
We develop the partitioning technique for quantum discrete systems. The graph consists of several subgraphs: a central graph and several branch graphs, with each branch graph being rooted by an individual node on the central one. We show…
Motivated by applications in background-independent quantum gravity, we discuss the quantization of labeled and unlabeled finite multigraphs with a maximum edge count. We provide a unified way to represent quantum multigraphs with labeled…
Earlier in the study of the combinatorial properties of the heat kernel of Laplace operator with covariant derivative diagram technique and matrix formalism were constructed. In particular, this formalism allows you to control the…
We present a mapping of dynamical graphs and, in particular, the graphs used in the Quantum Graphity models for emergent geometry, into an Ising hamiltonian on the line graph of a complete graph with a fixed number of vertices. We use this…
This article comprehensively explores matrices and their prerequisites for achieving positive semidefiniteness. The study delves into a series of theorems concerning pure quantum states in the context of weighted graphs. The main objective…
We consider periodic quantum Hamiltonians on the torus phase space (Harper-like Hamiltonians). We calculate the topological Chern index which characterizes each spectral band in the generic case. This calculation is made by a semi-classical…
Partial Boolean algebra underlies the quantum logic as an important tool for quantum contextuality. We propose the notion atom graphs to reveal the graph structure of partial Boolean algebra for finite dimensional quantum systems by proving…
Kirchoff's matrix tree theorem of 1847 connects the number of spanning trees of a graph to the spectral determinant of the discrete Laplacian [22]. Recently an analogue was obtained for quantum graphs relating the number of spanning trees…
This is an exposition of results on the existence problem of $\pi_1$-injective immersed and embedded surfaces in graph-manifolds, and also of nonpositively curved metrics on graph-manifolds, obtained by different authors. The results are…
Vertex similarity is a major problem in network science with a wide range of applications. In this work we provide novel perspectives on finding (dis)similar vertices within a network and across two networks with the same number of vertices…
We use techniques from functorial quantum field theory to provide a geometric description of the parity anomaly in fermionic systems coupled to background gauge and gravitational fields on odd-dimensional spacetimes. We give an explicit…
We discuss Laplacian spectrum on a finite metric graph with vertex couplings violating the time-reversal invariance. For the class of star graphs we determine, under the condition of a fixed total edge length, the configurations for which…
The f-invariant is a higher version of the e-invariant that takes values in the divided congruences between modular forms; it can be formulated as an elliptic genus of manifolds with corners of codimension two. In this thesis, we develop a…
This article is a tribute to the memory of Professor Enzo Martinelli, with deep respect and reconesance. Nicolae Teleman. The index formula is a local statement made on global and local data; for this reason we introduce local Alexander -…
The quantization of gauge fields and gravitation on manifolds with boundary makes it necessary to study boundary conditions which involve both normal and tangential derivatives of the quantized field. The resulting one-loop divergences can…
We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…
Numerical calculus algorithms which estimate derivatives and integrals from data series acquired either via measurements or by sampling functions are essential in scientific computing. To date, a few quantum algorithms have been developed…
A graph $G$ is defined encapsulating the number theoretic notion of the Fundamental Theorem of Arithmetic. We then provide a graph theoretic approach to the fundamental results on the coprimality of two natural numbers, through the use of…
Associated to a finite graph $X$ is its quantum automorphism group $G$. The main problem is to compute the Poincar\'e series of $G$, meaning the series $f(z)=1+c_1z+c_2z^2+...$ whose coefficients are multiplicities of 1 into tensor powers…