Related papers: Rado's Graph has no Quantum Symmetry
We provide a mathematically and conceptually robust notion of quantum superpositions of graphs. We argue that, crucially, quantum superpositions of graphs require node names for their correct alignment, which we demonstrate through a…
Building on work of Cai, F\"urer, and Immerman \cite{CFI92}, we show two hardness results for the Graph Isomorphism problem. First, we show that there are pairs of nonisomorphic $n$-vertex graphs $G$ and $H$ such that any sum-of-squares…
A periodic graph in dimension $d$ is a directed graph with a free action of $\Z^d$ with only finitely many orbits. It can conveniently be represented in terms of an associated finite graph with weights in $\Z^d$, corresponding to a…
Quantum symmetry of graph $C^{*}$-algebras has been studied, under the consideration of different formulations, in the past few years. It is already known that the compact quantum group $(\underbrace{C(S^{1})*C(S^{1})*\cdots…
In this article, we give a first example of a pair of quantum isomorphic, non-isomorphic strongly regular graphs, that is, non-isomorphic strongly regular graphs having the same homomorphism counts from all planar graphs. The pair consists…
We propose a method for numerical relativity in which the spatial grid is finite and no outer boundary condition is needed. As a "proof of concept" we implement this method for the case of a self-gravitating, spherically symmetric scalar…
In this paper, an upper bound on the nullity of signed graphs in terms of the cyclomatic number and the number of pendant vertices is proved, and the corresponding extremal signed graphs are completely characterized.
In this article, we explore the quantum symmetry of the direct sum of a finite family of Cuntz algebras $\{\mathcal{O}_{n_i} \}_{i=1}^{m}$, viewing them as graph $C^*$-algebras associated to the graphs $\{L_{n_i}\}_{i=1}^{m}$ (where $L_n$…
Let $R$ be a finite ring and $r\in R$. The $r$-noncommuting graph of $R$, denoted by $\Gamma_R^r$, is a simple undirected graph whose vertex set is $R$ and two vertices $x$ and $y$ are adjacent if and only if $[x,y] \neq r$ and $-r$. In…
We introduce the coherent algebra of a compact metric measure space by analogy with the corresponding concept for a finite graph. As an application we show that upon topologizing the collection of isomorphism classes of compact metric…
In 1962, Erd\H{o}s proved that if a graph $G$ with $n$ vertices satisfies $$ e(G)>\max\left\{\binom{n-k}{2}+k^2,\binom{\lceil(n+1)/2\rceil}{2}+\left\lfloor \frac{n-1}{2}\right\rfloor^2\right\}, $$ where the minimum degree $\delta(G)\geq k$…
We show that the independent set sequence of a bipartite graph need not be unimodal.
The "noncommutative graphs" which arise in quantum error correction are a special case of the quantum relations introduced in [N. Weaver, Quantum relations, Mem. Amer. Math. Soc. 215 (2012), v-vi, 81-140]. We use this perspective to…
We study infinite analogues of expander graphs, namely graphs where subgraphs weighted by heat kernels form an expander family. Our main result is that there does not exist any infinite expander in this sense. This proves the analogue for…
We investigate classical and quantum physics-based algorithms for solving the graph isomorphism problem. Our work integrates and extends previous work by Gudkov et al. (cond-mat/0209112) and by Rudolph (quant-ph/0206068). Gudkov et al.…
Let $H$ be a fixed graph. What can be said about graphs $G$ that have no subgraph isomorphic to a subdivision of $H$? Grohe and Marx proved that such graphs $G$ satisfy a certain structure theorem that is not satisfied by graphs that…
We study quantum versions of the Shannon capacity of graphs and non-commutative graphs. We introduce the asymptotic spectrum of graphs with respect to quantum and entanglement-assisted homomorphisms, and we introduce the asymptotic spectrum…
A geometric quantization of a K\"{a}hler manifold, viewed as a symplectic manifold, depends on the complex structure compatible with the symplectic form. The quantizations form a vector bundle over the space of such complex structures.…
The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…
Diamond graphs and Laakso graphs are important examples in the theory of metric embeddings. Many results for these families of graphs are similar to each other. In this connection, it is natural to ask whether one of these families admits…