Related papers: Planar Graphs On The World Sheet: The Hamiltonian …
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…
We offer a new structural basis for the theory of 3-connected graphs, providing a unique decomposition of every such graph into parts that are either quasi 4-connected, wheels, or thickened $K_{3,m}$'s. Our construction is explicit,…
Quantum gauge theory in the connection representation uses functions of holonomies as configuration observables. Physical observables (gauge and diffeomorphism invariant) are represented in the Hilbert space of physical states; physical…
We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Eulerian tours in certain spanning subgraphs of the quartic graph associated with the cubic graph by 1-factor contraction. This correspondence is…
We present a data structure that can maintain a simple planar graph under edge contractions in linear total time. The data structure supports adjacency queries and provides access to neighbor lists in $O(1)$ time. Moreover, it can report…
It is shown that graphs that generalize the ADE Dynkin diagrams and have appeared in various contexts of two-dimensional field theory may be regarded in a natural way as encoding the geometry of a root system. After recalling what are the…
We prove the Strengthened Hanna Neumann Conjecture, in its common graph theoretic formulation. Our original approach to this conjecture used cohomology of sheaves on graphs, although here we give a short combinatorial proof that we found in…
In recent years, A. Grigor'yan, Y. Lin, Y. Muranov and S.T. Yau [6, 7, 8, 9] constructed a path homology theory for digraphs. Later, S. Chowdhury and F. Memoli [3] studied the persistent path homology for directed networks. In this paper,…
The N_c to infinity limit of a matrix quantum field theory is equivalent to summing only planar Feynman diagrams. The possibility of interpreting this sum as some kind world-sheet theory has been in the air ever since 't Hooft's original…
Feynman diagrams in $\phi^4$ theory have as their underlying structure 4-regular graphs. In particular, any 4-point $\phi^4$ graph can be uniquely derived from a 4-regular graph by deleting a vertex. The Feynman period is a simplified…
A Lie-Hamilton system is a nonautonomous system of first-order ordinary differential equations describing the integral curves of a $t$-dependent vector field taking values in a finite-dimensional real Lie algebra of Hamiltonian vector…
We present a systematic expansion of all constraint equations in canonical quantum gravity up to the order of the inverse Planck mass squared. It is demonstrated that this method generates the conventional Feynman diagrammatic technique…
We extend previous work by developing a worldsheet description of non-abelian gauge theory (Yang-Mills). This task requires the introduction of Grassmann variables on the world sheet analogous to those of the Neveu-Schwarz-Ramond…
We propose a universal decomposition of unitary maps over a tensorial power of C^2, introducing the key concept of "phase maps", and investigate how this decomposition can be used to implement unitary maps directly in the measurement-based…
Development of next-generation electronic devices for applications call for the discovery of quantum materials hosting novel electronic, magnetic, and topological properties. Traditional electronic structure methods require expensive…
We uncover the very rich graph topology of generic bounded non-Hermitian spectra, distinct from the topology of conventional band invariants and complex spectral winding. The graph configuration of complex spectra are characterized by the…
We recently proposed polariton graphs as a novel platform for solving hard optimization problems that can be mapped into the $XY$ model. Here, we elucidate a relationship between the energy spectrum of the $XY$ Hamiltonian and the total…
A well-known conjecture of Gr\"unbaum and Nash-Williams proposes that 4-connected toroidal graphs are hamiltonian. The corresponding results for 4-connected planar and projective-planar graphs were proved by Tutte and by Thomas and Yu,…
In this paper we introduce a family of planar, modular and self-similar graphs which have small-world and scale-free properties. The main parameters of this family are comparable to those of networks associated to complex systems, and…
A circle of an infinite locally finite graph $G$ is the imagine of a homeomorphic mapping of the unit circle $S^1$ in $|G|$, the Freudenthal compactification of $G$. A circle of $G$ is Hamiltonian if it meets every vertex (and then every…