Related papers: Non-abelian anyons on graphs from presentations of…
We describe a technique to determine the automorphism group of a geometrically represented graph, by understanding the structure of the induced action on all geometric representations. Using this, we characterize automorphism groups of…
A group $G$ has a Frobenius graphical representation (GFR) if there is a simple graph $\varGamma$ whose full automorphism group is isomorphic to $G$ and it acts on vertices as a Frobenius group. In particular, any group $G$ with GFR is a…
I present an algorithm that, given a number $n \geq 1$, computes a compact representation of the set of all noncrossing acyclic digraphs with $n$ nodes. This compact representation can be used as the basis for a wide range of dynamic…
Many applications, ranging from natural to social sciences, rely on graphlet analysis for the intuitive and meaningful characterization of networks employing micro-level structures as building blocks. However, it has not been thoroughly…
We develop the partitioning technique for quantum discrete systems. The graph consists of several subgraphs: a central graph and several branch graphs, with each branch graph being rooted by an individual node on the central one. We show…
We have studied ${\rm SU}(2)_k$ anyon models, assessing their prospects for topological quantum computation. In particular, we have compared the Ising ($k=2$) anyon and Fibonacci ($k=3$) anyon models, motivated by their potential for future…
We review the q-deformed spin network approact to Topological Quantum Field Theory and apply these methods to produce unitary representations of the braid groups that are dense in the unitary groups. These methods produce a concise proof…
In this paper we study a Clifford algebra generalization of the quaternions and its relationship with braid group representations related to Majorana fermions. The Fibonacci model for topological quantum computing is based on the fusion…
Let G be a reductive group over an algebraically closed field of positive characteristic. Let C be a smooth projective curve over k. We give a description of the moduli space of flat G-bundles in terms of the moduli space of G-Higgs bundles…
We consider a two-dimensional spin system that exhibits abelian anyonic excitations. Manipulations of these excitations enable the construction of a quantum computational model. While the one-qubit gates are performed dynamically the model…
Exactly solvable models of topologically ordered phases with non-abelian anyons typically require complicated many-body interactions which do not naturally appear in nature. This motivates the "inverse problem" of quantum many-body physics:…
(lecture delivered at the Congress of the Romanian mathematicians, Brasov, June 2011) Using graph representations a new class of computable topological invariants associated with a tame real or angle valued map were recently introduced,…
A speculative overview of a future topic of research. The paper is a collection of ideas concerning two related areas: 1) Graph computation machines ("computing with graphs"). This is the class of models of computation in which the state of…
We consider two-dimensional N=(2,2) supersymmetric gauge theory on discretized Riemann surfaces. We find that the discretized theory can be efficiently described by using graph theory, where the bosonic and fermionic fields are regarded as…
A visualized graph is a powerful tool for data analysis and synthesis tasks. In this case, the task of visualization constitutes not only in displaying vertices and edges according to the graph representation, but also in ensuring that the…
This paper represents a first attempt at unifying two promising models that attempt to explain the origin of the internal symmetries of leptons and quarks. It is shown that each of the four normed division algebras over the reals admits a…
We consider smooth representations of the unit group $G = \mathcal{A}^{\times}$ of a finite-dimensional split basic algebra $\mathcal{A}$ over a non-Archimedean local field. In particular, we prove a version of Gutkin's conjecture, namely,…
Graph signal processing deals with algorithms and signal representations that leverage graph structures for multivariate data analysis. Often said graph topology is not readily available and may be time-varying, hence (dynamic) graph…
While stabilizer tableaus have proven exceptionally useful as a descriptive tool for additive quantum codes, they offer little guidance for concrete constructions or coding algorithm analysis. We introduce a representation of stabilizer…
The main contribution of this article is a new prior distribution over directed acyclic graphs, which gives larger weight to sparse graphs. This distribution is intended for structured Bayesian networks, where the structure is given by an…