Related papers: A Gelfand-Levitan trace formula for generic quantu…
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…
In the recent literature, various authors have studied spectral comparison results for Schr\"odinger operators with discrete spectrum in different settings including Euclidean domains and quantum graphs. In this note we derive such spectral…
Continuous-time quantum walks are typically effected by either the discrete Laplacian or the adjacency matrix. In this paper, we explore a third option: the signless Laplacian, which has applications in algebraic graph theory and may arise…
Leighton's graph covering theorem says that two finite graphs with a common cover have a common finite cover. We present a new proof of this using groupoids, and use this as a model to prove two generalisations of the theorem. The first…
We derive a formula for the QE constant of a complete multipartite graph and determine the complete multipartite graphs of non-QE class, namely, those which do not admit quadratic embeddings in a Euclidean space. Moreover, the primary…
Let $\mathcal{G}$ be a metric noncompact connected graph with finitely many edges. The main object of the paper is the Hamiltonian ${\bf H}_{\alpha}$ associated in $L^2(\mathcal{G};\mathbb{C}^m)$ with a matrix Sturm-Liouville expression and…
We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…
We give a sufficient condition for the essential self-adjointness of a perturbation of the square of the magnetic Laplacian on an infinite weighted graph. The main result is applicable to graphs whose degree function is not necessarily…
The continuous spectrum to the spectral side of the Arthur-Selberg trace formula is described in terms of intertwining operators, whose normalising factors involve quotients of $L$-functions. In this paper, we derive two expressions in the…
Leighton's graph covering theorem states that two finite graphs with common universal cover have a common finite cover. We generalize this to a large family of non-positively curved special cube complexes that form a natural generalization…
Laumon moduli spaces are certain smooth closures of the moduli spaces of maps from the projective line to the flag variety of GL_n. We construct the action of the quantum loop algebra U_v(Lsl_n) in the equivariant K-theory of Laumon spaces…
We establish a parametric framework for obtaining obstruction characterizations of graph parameters with respect to a quasi-ordering $\leqslant$ on graphs. At the center of this framework lies the concept of a $\leqslant$-parametric graph:…
We obtain a Bernstein theorem for special Lagrangian graphs in n-dimensional complex space for arbitrary n only assuming bounded slope, but no quantitative restriction.
In this paper we study the absolute convergence of the spectral side of the Arthur trace formula. We reduce the problem of the absolute convergence to a problem about local components of automorphic representations. The latter problem can…
For any row-finite graph $E$ and any field $K$ we construct the {\its Leavitt path algebra} $L(E)$ having coefficients in $K$. When $K$ is the field of complex numbers, then $L(E)$ is the algebraic analog of the Cuntz Krieger algebra…
We define a class of quantum systems called regular quantum graphs. Although their dynamics is chaotic in the classical limit with positive topological entropy, the spectrum of regular quantum graphs is explicitly computable analytically…
We derive trace formulas of the Buslaev-Faddeev type for quantum star graphs. One of the new ingredients is high energy asymptotics of the perturbation determinant.
The classical Gelfand--Naimark theorems provide important insight into the structure of general and of commutative C*-algebras. It is shown that these can be generalized to certain ordered *-algebras. More precisely, for $\sigma$-bounded…
For a finite graph, we establish natural isomorphisms between eigenspaces of a Laplace operator acting on functions on the edges and eigenspaces of a transfer operator acting on functions on one-sided infinite non-backtracking paths.…
We construct a new quantum algorithm for the graph collision problem; that is, the problem of deciding whether the set of marked vertices contains a pair of adjacent vertices in a known graph G. The query complexity of our algorithm is…