Related papers: Algorithm for computing Representations of the Bra…
Mapping a quantum algorithm to any practical large-scale quantum computer will require a sequence of compilations and optimizations. At the level of fault-tolerant encoding, one likely requirement of this process is the translation into a…
We introduce the notion of a braided Lie algebra consisting of a finite-dimensional vector space $\CL$ equipped with a bracket $[\ ,\ ]:\CL\tens\CL\to \CL$ and a Yang-Baxter operator $\Psi:\CL\tens\CL\to \CL\tens\CL$ obeying some axioms. We…
We show that the algebra of the bicovariant differential calculus on a quantum group can be understood as a projection of the cross product between a braided Hopf algebra and the quantum double of the quantum group. The resulting super-Hopf…
The Kauffman bracket skein algebra of a surface is a generalization of the Jones polynomial invariant for links and plays a principal role in the Witten-Reshetikhin- Turaev topological quantum field theory. However, the multiplicative…
A long-term research proposal on the algebraic structure, the representations and the possible applications of paraparticle algebras is structured in three modules: The first part stems from an attempt to classify the inequivalent gradings…
The statistics of meanders is studied in connection with the Temperley-Lieb algebra. Each (multi-component) meander corresponds to a pair of reduced elements of the algebra. The assignment of a weight $q$ per connected component of meander…
In this paper we present Affine.m - program for computations in representation theory of finite-dimensional and affine Lie algebras and describe implemented algorithms. Algorithms are based upon the properties of weights and Weyl symmetry.…
We survey group-theoretic algorithms for finding (some or all) subgroups of a finite group and discuss the implementation of these algorithms in the computer algebra system GAP
In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has…
The Hamiltonian of the $N$-state clock model is written in terms of a coupled Temperley-Lieb (TL) algebra defined by $N-1$ types of TL generators. This generalizes a previous result for $N=3$ obtained by J. F. Fjelstad and T. M\r{a}nsson…
We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…
A method for compiling quantum algorithms into specific braiding patterns for non-Abelian quasiparticles described by the so-called Fibonacci anyon model is developed. The method is based on the observation that a universal set of quantum…
We give a combinatorial description of the ``$D_{2n}$ planar algebra,'' by generators and relations. We explain how the generator interacts with the Temperley-Lieb braiding. This shows the previously known braiding on the even part extends…
We determine the structure of two variations on the Temperley-Lieb algebra, both used for dealing with special kinds of boundary conditions in statistical mechanics models. The first is a new algebra, the `blob' algebra (the reason for the…
We obtain algorithms for computing Tverberg partitions based on centerpoint approximations. This applies to a wide range of convexity spaces, from the classic Euclidean setting to geodetic convexity in graphs. In the Euclidean setting, we…
We determine the representations of the Yokonuma-Temperley-Lieb algebra, which is defined as a quotient of the Yokonuma-Hecke algebra by generalising the construction of the classical Temperley-Lieb algebra.
On the one hand the algebras of linear operators here act on finite-dimensional vector spaces, and on the other hand the point of view is generally an analysts'. Also, one might think of algebras as being used to add more data to basic…
We generalize the Moishezon Teicher algorithm that was suggested for the computation of the braid monodromy of an almost real curve. The new algorithm suits a larger family of curves, and enables the computation of braid monodromy not only…
We begin the study of the representation theory of the infinite Temperley-Lieb algebra. We fully classify its finite dimensional representations, then introduce infinite link state representations and classify when they are irreducible or…
These are lecture notes prepared for a minicourse given at the Cimpa Research School "Algebraic and geometric aspects of representation theory", held in Curitiba, Brazil in March 2013. The purpose of the course is to provide an introduction…