Related papers: A Frucht's theorem for quantum graphs
We prove that an arbitrary compact metrizable group can be realized as the automorphism group of a graphing; this is a continuous analogue to Frucht's theorem recovering arbitrary finite groups are automorphism groups of finite graphs. The…
Let $W$ be a Coxeter group whose proper parabolic subgroups are finite. According to Theorem~1.12 of [1], if the module of a finite $W$-digraph $\Gamma$ is isomorphic to the module of a $W$-graph over $Q$, then $\Gamma$ is acyclic. We…
We consider the problem of characterizing the class of those permutation groups that are the symmetry groups of Boolean functions. These are exactly the automorphism groups of hypergraphs. They are also called the relation groups. In this…
Consider a sequence of finite regular graphs (GN) converging, in the sense of Benjamini-Schramm, to the infinite regular tree. We study the induced quantum graphs with equilateral edge lengths, Kirchhoff conditions (possibly with a non-zero…
We present a method which enables one to construct isospectral objects, such as quantum graphs and drums. One aspect of the method is based on representation theory arguments which are shown and proved. The complementary part concerns…
The lattice of subgroups of a group is the subject of numerous results revolving around the central theme of decomposing the group into "chunks" (subquotients) that can then be compared to one another in various ways. Examples of results in…
A theorem of Kontsevich relates the homology of certain infinite dimensional Lie algebras to graph homology. We formulate this theorem using the language of reversible operads and mated species. All ideas are explained using a pictorial…
In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…
A nut graph is a simple graph of order 2 or more for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry (i.e. are full). It is shown by construction that every finite group…
In his investigation on large $K$-automorphism groups of an algebraic curve, Stichtenoth obtained an upper bound on the order of the first ramification group of an algebraic curve $\cX$ defined over an algebraically closed field of…
We prove several rigidity properties for random quotients of mapping class groups of surfaces, namely whose kernel is normally generated by the n-th steps of finitely many independent random walks. Firstly, we generalise a celebrated…
The aim of this paper is to show a connection between an extended theory of statistical experiments on the one hand and the foundation of quantum theory on the other hand. The main aspects of this extension are: One assumes a hyperparameter…
We demonstrate that a quantum graph exhibits a $\mathcal{PT}$-symmetry provided the coefficients in the condition describing the wave function matching at the vertices are circulant matrices; this symmetry is nontrivial if they are not…
Symmetry topological field theory (SymTFT) is a convenient tool for studying finite generalized symmetries of a given quantum field theory (QFT). In particular, SymTFTs encode all the symmetry structures and properties, including anomalies.…
The theory of convergent graph sequences has been worked out in two extreme cases, dense graphs and bounded degree graphs. One can define convergence in terms of counting homomorphisms from fixed graphs into members of the sequence…
Quantum graphs are a paradigmatic model for quantum chaos as well as for spectral theory. We give a concise didactical introduction to quantum graphs, or Schr\"odinger Hamiltonians on metric graphs, with a focus on results related to…
Quantum graphity is a background independent model for emergent locality, spatial geometry and matter. The states of the system correspond to dynamical graphs on N vertices. At high energy, the graph describing the system is highly…
We introduce the tree distance, a new distance measure on graphs. The tree distance can be computed in polynomial time with standard methods from convex optimization. It is based on the notion of fractional isomorphism, a characterization…
We prove that an isomorphism of graded Grothendieck groups $K^{gr}_0$ of two Leavitt path algebras induces an isomorphism of a certain quotient of algebraic filtered $K$-theory and consequently an isomorphism of filtered $K$-theory of their…
The {\em topological symmetry group} of an embedding $\Gamma$ of an abstract graph $\gamma$ in $S^3$ is the group of automorphisms of $\gamma$ which can be realized by homeomorphisms of the pair $(S^3, \Gamma)$. These groups are motivated…