Related papers: Solving random equations in Garside groups using l…

We suggest a new algorithm for finding a canonical representative of a given braid, and also for the harder problem of finding a $\sigma_1$-consistent representative. We conjecture that the algorithm is quadratic-time. We present numerical…

We construct the first examples of normal subgroups of mapping class groups that are isomorphic to non-free right-angled Artin groups. Our construction also gives normal, non-free right-angled Artin subgroups of other groups, such as braid…

Short geodesics are important in the study of the geometry and the spectra of Riemann surfaces. Bers' theorem gives a global bound on the length of the first $3g-3$ geodesics. We use the construction of Brooks and Makover of random Riemann…

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of non-abelian simple groups. The minimum number of nonsolvable factors, attained on all possible such series in $G$, is called…

The deep connections between braids and dynamics by way of the Nielsen-Thurston classification theorem have led to a wide range of practical applications. Braids have been used to detect coherent structures and mixing regions in oceanic…

We propose a novel framework for solving nonlinear PDEs using sparse radial basis function (RBF) networks. Sparsity-promoting regularization is employed to prevent over-parameterization and reduce redundant features. This work is motivated…

Let $H$ be a transfer Krull monoid over a finite ablian group $G$ (for example, rings of integers, holomorphy rings in algebraic function fields, and regular congruence monoids in these domains). Then each nonunit $a \in H$ can be written…

Given a commutative unital ring $R$, we show that the finiteness length of a group $G$ is bounded above by the finiteness length of the Borel subgroup of rank one $\mathbf{B}_2^\circ(R)=\left( \begin{smallmatrix} * & * \\ 0 & *…

Artin's representation is an injective homomorphism from the braid group $B_n$ on $n$ strands into $\operatorname{Aut}\mathbb{F}_n$, the automorphism group of the free group $\mathbb{F}_n$ on $n$ generators. The representation induces maps…

We investigate a group $B\_\bullet$ that includes Artin's braid group $B\_\infty$ and Thompson's group $F$. The elements of $B\_\bullet$ are represented by braids diagrams in which the distances between the strands are not uniform and,…

This paper is the first part of a series of papers aimed at improving the classification by Formanek of the irreducible representations of Artin braid groups of small dimension. In this paper we classify all the irreducible complex…

We solve the isomorphism problem for braid groups on trees with $n = 4$ or 5 strands. We do so in three main steps, each of which is interesting in its own right. First, we establish some tools and terminology for dealing with computations…

One of the most interesting questions about a group is if its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists and geometers, and is the target of intensive…

We present a formal analysis, in Isabelle/HOL, of optimisation algorithms for matroids, which are useful generalisations of combinatorial structures that occur in optimisation, and greedoids, which are a generalisation of matroids. Although…

In a recent paper here arXiv:1508.0005 it is shown that irreducible representations of the three string braid group $B_3$ of dimensions $\leq 5$ extend to representations of the 3-component loop braid group $LB_3$. Further, an explicit…

We investigate a family of (reducible) representations of Artin's braid groups corresponding to a specific solution to the Yang-Baxter equation. The images of the braid groups under these representations are finite groups, and we identify…

Using various tools from representation theory and group theory, but without using hard classification theorems such as the classification of finite simple groups, we show that the Jones representations of braid groups are dense in the…

A numerical algorithm that computes the decomposition of any finite-dimen\-sio\-nal unitary reducible representation of a compact Lie group is presented. The algorithm, which does not rely on an algebraic insight on the group structure, is…

A fundamental open problem in algebraic combinatorics is to find a positive combinatorial formula for Kronecker coefficients, which are multiplicities of the decomposition of the tensor product of two \S_r-irreducibles into irreducibles.…

Let $g$ be an element of a finite group $G$ and let $R_{n}(g)$ be the subgroup generated by all the right Engel values $[g,{}_{n}x]$ over $x\in G$. In the case when $G$ is soluble we prove that if, for some $n$, the Fitting height of…