Related papers: Graph-induced operators: Hamiltonian cycle enumera…
We address the problem of identifying a graph structure from the observation of signals defined on its nodes. Fundamentally, the unknown graph encodes direct relationships between signal elements, which we aim to recover from observable…
A notion of local algebras is introduced in the theory of causal fermion systems. Their properties are studied in the example of the regularized Dirac sea vacuum in Minkowski space. The commutation relations are worked out, and the…
This paper shows NP-completeness for finding Hamiltonian cycles in induced subgraphs of the dual graphs of semi-regular tessilations. It also shows NP-hardness for a new, wide class of graphs called augmented square grids. This work follows…
We present a mechanism for the creation of gaps in the spectra of self-adjoint operators defined over a Hilbert space of functions on a graph, which is based on the process of graph decoration. The resulting Hamiltonians can be viewed as…
We review quantum chaos on graphs. We construct a unitary operator which represents the quantum evolution on the graph and study its spectral and wavefunction statistics. This operator is the analogue of the classical evolution operator on…
I solve a quantum chain whose Hamiltonian is comprised solely of local four-fermi operators by constructing free-fermion raising and lowering operators. The free-fermion operators are both non-local and highly non-linear in the local…
We prove the formula for the traces of certain class of operators in bosonic and fermionic Fock spaces. Vertex operators belong to this class. Traces of vertex operators can be used for calculation of correlation functions and formfactors…
We study the connection between *-representations of algebras associated with graphs, locally-scalar graph representations and the problem about the spectrum of a sum of two Hermitian operators. For algebras associated with Dynkin graphs we…
The $k$-coprime graph of order $n$ is the graph with vertex set $\{k, k+1, \ldots, k+n-1\}$ in which two vertices are adjacent if and only if they are coprime. We characterize Hamiltonian $k$-coprime graphs. As a particular case, two…
We consider the quantum site percolation model on graphs with an amenable group action. It consists of a random family of Hamiltonians. Basic spectral properties of these operators are derived: non-randomness of the spectrum and its…
Given a graph, we associate each edge with the transposition which exchanges the endvertices. Fixing a linear order on the edge set, we obtain a permutation of the vertices. D\'enes proved that the permutation is a full cyclic permutation…
For a graph $G$ the random $n$-lift of $G$ is obtained by replacing each of its vertices by a set of $n$ vertices, and joining a pair of sets by a random matching whenever the corresponding vertices of $G$ are adjacent. We show that…
Hamiltonian operators are used in the theory of integrable partial differential equations to prove the existence of infinite sequences of commuting symmetries or integrals. In this paper it is illustrated the new Reduce package \cde for…
We derive an intuitive and novel method to represent nodes in a graph with special unitary operators, or quantum operators, which does not require parameter training and is competitive with classical methods on scoring similarity between…
Although there are very algorithms for embedding graphs on unbounded grids, only few results on embedding or drawing graphs on restricted grids has been published. In this work, we consider the problem of embedding paths and cycles on grid…
Vertex operators, being families of birational transformations of infinite-dimensional algebraic ``varieties'' M, act on appropriate line bundles on M. However, they act on (meromorphic) sections only as_partial operators_: they are defined…
We apply the theory of $\alpha$-induction of sectors which we elaborated in our previous paper to several nets of subfactors arising from conformal field theory. The main application are conformal embeddings and orbifold inclusions of SU(n)…
We introduce an approach for imposing physically informed inductive biases in learned simulation models. We combine graph networks with a differentiable ordinary differential equation integrator as a mechanism for predicting future states,…
Let claw be the graph $K_{1,3}$. A graph $G$ on $n\geq 3$ vertices is called \emph{o}-heavy if each induced claw of $G$ has a pair of end-vertices with degree sum at least $n$, and 1-heavy if at least one end-vertex of each induced claw of…
Chen, Faudree, Gould, Jacobson, and Lesniak determined the minimum degree threshold for which a balanced $k$-partite graph has a Hamiltonian cycle. We give an asymptotically tight minimum degree condition for Hamiltonian cycles in arbitrary…