Related papers: Non-abelian anyons on graphs from presentations of…
Given a finite simplicial graph ${\cal G}$, the graph group $G{\cal G}$" is the group with generators in one-to-one correspondence with the vertices of ${\cal G}$ and with relations stating two generators commute if their associated…
The topological model for quantum computation is an inherently fault-tolerant model built on anyons in topological phases of matter. A key role is played by the braid group, and in this survey we focus on a selection of ways that the…
Semialgebraic graphs are graphs whose vertices are points in $\mathbb{R}^d$, and adjacency between two vertices is determined by the truth value of a semialgebraic predicate of constant complexity. We show how to harness polynomial…
Real-world optimization problems are generally not just black-box problems, but also involve mixed types of inputs in which discrete and continuous variables coexist. Such mixed-space optimization possesses the primary challenge of modeling…
Graphs and various graph-like combinatorial structures, such as preorders and hypergraphs, are ubiquitous in programming. This paper focuses on representing graphs in a purely functional programming language like Haskell. There are several…
A set of quasi-uniform random variables $X_1,...,X_n$ may be generated from a finite group $G$ and $n$ of its subgroups, with the corresponding entropic vector depending on the subgroup structure of $G$. It is known that the set of entropic…
We introduce Graph Memory (GM), a structured non-parametric framework that represents an embedding space through a compact graph of reliability-annotated prototype regions. GM encodes local geometry and regional ambiguity through prototype…
This paper will appear in the Santa Cruz proceedings. An overview of the braid group techniques in the theory of algebraic surfaces, from Zariski to the latest results, is presented. An outline of the Van Kampen algorithm for computing…
The representation of graphs is commonly based on the adjacency matrix concept. This formulation is the foundation of most algebraic and computational approaches to graph processing. The advent of deep learning language models offers a wide…
The modular decomposition of a graph is a canonical representation of its modules. Algorithms for computing the modular decomposition of directed and undirected graphs differ significantly, with the undirected case being simpler, and…
Non-Abelian states of matter, in which the final state depends on the order of the interchanges of two quasiparticles, can encode information immune from environmental noise with the potential to provide a robust platform for topological…
Anyons are exotic quasiparticles living in two dimensions that do not fit into the usual categories of fermions and bosons, but obey a new form of fractional statistics. Following a recent proposal [Phys. Rev. Lett. 98, 150404 (2007)], we…
We introduce a novel type of stabilization map on the configuration spaces of a graph, which increases the number of particles occupying an edge. There is an induced action on homology by the polynomial ring generated by the set of edges,…
We propose a combination of a variational autoencoder and a transformer based model which fully utilises graph convolutional and graph pooling layers to operate directly on graphs. The transformer model implements a novel node encoding…
Boundary conformal field theory is brought to bear on the study of topological insulating phases of non-abelian anyonic chains. These topologically non-trivial phases display protected anyonic end modes. We consider antiferromagnetically…
We generalize the hierarchy construction to generic 2+1D topological orders (which can be non-Abelian) by condensing Abelian anyons in one topological order to construct a new one. We show that such construction is reversible and leads to a…
We develop random graph models where graphs are generated by connecting not only pairs of vertices by edges but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows the for the generation of…
We consider the braid groups $\mathbf{B}_n(X)$ on finite simplicial complexes $X$, which are generalizations of those on both manifolds and graphs that have been studied already by many authors. We figure out the relationships between…
We explore the use of graph neural networks (GNNs) to model spatial processes in which there is no a priori graphical structure. Similar to finite element analysis, we assign nodes of a GNN to spatial locations and use a computational…
Anyons are particlelike excitations of strongly correlated phases of matter with fractional statistics, characterized by nontrivial changes in the wave function, generalizing Bose and Fermi statistics, when two of them are interchanged.…