Related papers: Algorithm for computing Representations of the Bra…
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 introduce a generalization of the Euclidean algorithm for rings equipped with an involution, and completely enumerate all isomorphism classes of orders over definite, rational quaternion algebras equipped with an orthogonal involution…
We study the representation theory of the Temperley-Lieb algebra $\mathsf{TL}_n^k(\delta)$ in mixed characteristic, i.e. over an arbitrary field $k$ of characteristic $p$ and where $\delta$ satisfies some minimal polynomial $m_\delta$. In…
We give a method for constructing an interactive art piece which illustrates two different definitions of the braid groups, along with their faithful action on the free group. The box also demonstrates how all motions of points in the plane…
Many problems in computational geometry are not stated in graph-theoretic terms, but can be solved efficiently by constructing an auxiliary graph and performing a graph-theoretic algorithm on it. Often, the efficiency of the algorithm…
We introduce an algorithmic framework to investigate spherical and geodesic growth series of braid groups relatively to the Artin's or Birman-Ko-Lee's generators. We present our experimentations in the case of three and four strands and…
The Standard Model of particle physics provides very accurate predictions of phenomena occurring at the sub-atomic level, but the reason for the choice of symmetry group and the large number of particles considered elementary, is still…
We show that the Lawrence-Krammer representation based on two parameters that was used by Bigelow and independently Krammer to show the linearity of the braid group is generically irreducible, but that when its parameters are specialized to…
Multiplicative analogues of the shuffle elements of the braid group rings are introduced; in local representations they give rise to certain graded associative algebras (b-shuffle algebras). For the Hecke and BMW algebras, the…
In this paper we present an implementation of a computer algorithm that automatically determines the topological structure of spacetime, using a branched covering space representation. This algorithm is applied to a few simple examples in…
These are lecture notes from a lecture series given at CIRM in the Fall 2023. They give a down-to-earth introduction to Khovanov and Seidel's categorical representation of Artin-Tits groups, emphasizing the fact that it is all explicitly…
A classical problem in Distance Geometry, with multiple practical applications (in molecular structure determination, sensor network localization etc.) is to find the possible placements of the vertices of a graph with given edge lengths.…
We give an algorithm for computing the irreducible admissible representations of a real reductive group with regular integral infinitesimal character. This algorithm has been implemented on a computer, as part of the Atlas of Lie Groups and…
We assume some standard choices for the branch cuts of a group of functions and consider the problem of then calculating the branch cuts of expressions involving those functions. Typical examples include the addition formulae for inverse…
We consider Diagram algebras, $\Dg(G)$ (generalized Temperley-Lieb algebras) defined for a large class of graphs $G$, including those of relevance for cubic lattice Potts models, and study their structure for generic $Q$. We find that these…
A Maple code is presented for algebraic collective model (ACM) calculations. The ACM is an algebraic version of the Bohr model of the atomic nucleus, in which all required matrix elements are derived by exploiting the model's SU(1,1) x…
Algorithms for embedding certain types of nilpotent subalgebras in maximal subalgebras of the same type are developed, using methods of real algebraic groups. These algorithms are applied to determine non-conjugate subalgebras of the…
Algebraic basics on Temperley-Lieb algebras are proved in an elementary and straightforward way with the help of tensor categories behind them.
We consider quotients of the group algebra of the $3$-string braid group $B_3$ by $p$-th order generic polynomial relations on the elementary braids. In cases $p=2,3,4,5$ these quotient algebras are finite dimensional. We give…
We present a general diagrammatic approach to the construction of efficient algorithms for computing the Fourier transform of a function on a finite group. By extending work which connects Bratteli diagrams to the construction of Fast…