Related papers: Planar #CSP Equality Corresponds to Quantum Isomor…

Suppose a Boolean function $f$ is symmetric under a group action $G$ acting on the $n$ bits of the input. For which $G$ does this mean $f$ does not have an exponential quantum speedup? Is there a characterization of how rich $G$ must be…

Consider two quantum graphs with the standard Laplace operator and non-Robin type boundary conditions at all vertices. We show that if their eigenvalue-spectra agree everywhere aside from a sufficiently sparse set, then the…

We introduce the 2-sorted counting logic $GC^k$ that expresses properties of hypergraphs. This logic has available k variables to address hyperedges, an unbounded number of variables to address vertices, and atomic formulas E(e,v) to…

Holant problem is a general framework to study the computational complexity of counting problems. We prove a complexity dichotomy theorem for Holant problems over Boolean domain with non-negative weights. It is the first complete Holant…

Let $G$ be a graph with adjacency matrix $A(G)$ and degree matrix $D(G)$, and let $L_\mu(G):=A(G)-\mu D(G)$. Two graphs $G_1$ and $G_2$ are called \emph{degree-similar} if there exists an invertible matrix $M$ such that $M^{-1} A(G_1) M…

Graphs and recently hypergraphs have been known as an important tool for considering different properties of quantum many-body systems. In this paper, we study a mapping between an important class of quantum systems namely quantum…

We use category-theoretic techniques to provide two proofs showing that for a higher-rank graph $\Lambda$, its cubical (co-)homology and categorical (co-)homology groups are isomorphic in all degrees, thus answering a question of Kumjian,…

We consider the problem of identifying exactly which AF-algebras are isomorphic to a graph C*-algebra. We prove that any separable, unital, Type I C*-algebra with finitely many ideals is isomorphic to a graph C*-algebra. This result allows…

This paper proposes to broaden the canonical formulation of quantum mechanics. Ordinarily, one imposes the condition $H^\dagger=H$ on the Hamiltonian, where $\dagger$ represents the mathematical operation of complex conjugation and matrix…

Graphs are one of the most important data structures for representing pairwise relations between objects. Specifically, a graph embedded in a Euclidean space is essential to solving real problems, such as physical simulations. A crucial…

Three new graph invariants are introduced which may be measured from a quantum graph state and form examples of a framework under which other graph invariants can be constructed. Each invariant is based on distinguishing a different number…

In recent work by Johnson et al. (2022), a framework was described for the study of graph problems over classes specified by omitting each of a finite set of graphs as subgraphs. If a problem falls into the framework then its computational…

We develop two approaches to Quantum (or Non-commutative) Graphs based on arbitrary von Neumann algebras $M\subseteq\mathcal B(H)$: one looking at operator bimodules of Hilbert--Schmidt (instead of bounded) operators, and the second looking…

In this work, we answer the homotopy invariance question for the ''smallest'' non-isotrivial group-scheme over $\mathbb{P}^1$, obtaining a result, which is not contained in previous works due to Knudson and Wendt. More explicitly, let…

A graph G is {\xi}-nearly planar if it can be embedded in the sphere so that each of its edges is crossed at most {\xi} times. The family of {\xi}-nearly planar graphs is widely extending the notion of planarity. We introduce an alternative…

In a series of seminal papers, Laddha and Varadarajan have developed in depth the quantisation of Parametrised Field Theory (PFT) in the kind of discontinuous representations that are employed in Loop Quantum Gravity (LQG). In one spatial…

Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a graph G amenable to color refinement if it succeeds in…

In this paper, we study the parallel and the space complexity of the graph isomorphism problem (\GI{}) for several parameterizations. Let $\mathcal{H}=\{H_1,H_2,\cdots,H_l\}$ be a finite set of graphs where $|V(H_i)|\leq d$ for all $i$ and…

We answer two questions regarding the sum-of-squares for the SYK model left open in Ref. 1, both of which are related to graphs. First (a "limitation"), we show that a fragment of the sum-of-squares, in which one considers commutation…

This article gives a comprehensive description of the fractal geometry of conformally-invariant (CI) scaling curves, in the plane or half-plane. It focuses on deriving critical exponents associated with interacting random paths, by…