Related papers: Non-abelian anyons on graphs from presentations of…
The power graph of a group is the simple graph with vertices as the group elements, in which two distinct vertices are adjacent if and only if one of them can be obtained as an integral power of the other. We study (minimal) cut-sets of the…
This expository article presents a self-contained introduction to simplicial homology for finite simplicial complexes, emphasizing concrete computation and geometric intuition. Beginning with orientations of simplices and the construction…
Anyons are exotic quasiparticles obeying fractional statistics,whose behavior can be emulated in artificially designed spin systems.Here we present an experimental emulation of creating anyonic excitations in a superconducting circuit that…
Braid groups are an important and flexible tool used in several areas of science, such as Knot Theory (Alexander's theorem), Mathematical Physics (Yang-Baxter's equation) and Algebraic Geometry (monodromy invariants). In this note we will…
A number of authors have studied the question of when a graph can be represented as a Cayley graph on more than one nonisomorphic group. The work to date has focussed on a few special situations: when the groups are $p$-groups; when the…
Recently, an approach to graph signal processing based on graphons was proposed. Here we show how such a graphon-driven approach to the Fourier transform can be used on graphs sampled from a stochastic block model (SBM). In particular, we…
It is well-known that many topological phase transitions of intrinsic Abelian topological phases are accompanied by condensation and confinement of anyons. However, for non-Abelian topological phases, more intricate phenomena can occur at…
Let X be an Abelian surface and C a holomorphic curve in X representing a primitive homology class. The space of genus g curves in the class of C is g dimensional. We count the number of such curves that pass through g generic points and we…
Aharonov and Casher showed that Pauli Hamiltonians in two dimensions have gapless zero modes. We study the adiabatic evolution of these modes under the slow motion of $N$ fluxons with fluxes $\Phi_a\in\mathbb{R}$. The positions,…
This paper considers the topological degree of $G$-shifts of finite type for the case where $G$ is a nonabelian monoid. Whenever the Cayley graph of $G$ has a finite representation and the relationships among the generators of $G$ are…
Graphs are topological spaces that include broader objects than discretized manifolds, making them interesting playgrounds for the study of quantum phases not realized by symmetry breaking. In particular they are known to support anyons of…
We construct an explicit bundle with flat connection on the configuration space of n points of a complex curve. This enables one to recover the `formality' isomorphism between the Lie algebra of the prounipotent completion of the pure braid…
We propose an experimental scheme to observe non-abelian statistics with cold atoms in a two dimensional optical lattice. We show that the Majorana-Schockley modes associated with line defects obey non-abelian statistics and can be created,…
Traditional anyons in two dimensions have generalized exchange statistics governed by the braid group. By analyzing the topology of configuration space, we discover that an alternate generalization of the symmetric group governs particle…
Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of…
Partition of unity methods (PUMs) on graphs represent straightforward and remarkably adaptable auxiliary techniques for graph signal processing. By relying solely on the intrinsic graph structure, we propose the generation of a partition of…
We define braid presentation of edge-oriented spatial graphs as a natural generalization of braid presentation of oriented links. We show that every spatial graph has a braid presentation. For an oriented link it is known that the braid…
We study non-abelian differentiable gerbes over stacks using the theory of Lie groupoids. More precisely, we develop the theory of connections on Lie groupoid $G$-extensions, which we call "connections on gerbes", and study the induced…
In this paper, we show the existence of a polynomial time graph isomorphism algorithm for all graphs excluding graphs that are locally trianglefree. This particular class of graphs allows to divide the graph into neighbourhood sub-graph…
We use a tensor unfolding technique to prove a new identifiability result for discrete bipartite graphical models, which have a bipartite graph between an observed and a latent layer. This model family includes popular models such as…