Related papers: Ordering the braid groups
We study two families of lattices whose number of elements are given by the numbers in even (respectively odd) positions in the Fibonacci sequence. The even Fibonacci lattice arises as the lattice of simple elements of a Garside monoid…
We consider braids on $m+n$ strands, such that the first $m$ strands are trivially fixed. We denote the set of all such braids by $B_{m,n}$. Via concatenation $B_{m,n}$ acquires a group structure. The objective of this paper is to find a…
Irreducible Artin groups of finite type can be parametrized via their associated Coxeter diagrams into six sporadic examples and four infinite families, each of which is further parametrized by the natural numbers. Within each of these four…
Recent results on the linearity of braid groups are extended in two ways. We generalize the Lawrence Krammer representation as well as Krammer's faithfulness proof for this linear representation to Artin groups of finite type.
Derived braids have been used to classify categorical structures based on the braid underlying a braided monoidal category V. With four-strand braids underlying the composition morphisms of tensor products of categories enriched over V,…
We study a subset of square free positive braids and we give a few algebraic characterizations of them and one geometric characterization: the set of positive braids whose closures are unlinks. We describe canonical forms of these braids…
Motivated by the recent result that left-orderability of a group $G$ is intimately connected to circular orderability of direct products $G \times \mathbb{Z}/n\mathbb{Z}$, we provide necessary and sufficient cohomological conditions that…
Let $\Gamma$ be a finite connected graph. The (unlabelled) configuration space $UC^n \Gamma$ of $n$ points on $\Gamma$ is the space of $n$-element subsets of $\Gamma$. The $n$-strand braid group of $\Gamma$, denoted $B_n\Gamma$, is the…
We define the notion of canonical boundedness among rank-one transformations and use it to characterize the class of all bounded rank-one transformations with trivial centralizer. We also explicitly characterize totally ergodic rank-one…
Trees are partial orderings where every element has a linearly ordered set of smaller elements. We define and study several natural notions of completeness of trees, extending Dedekind completeness of linear orders and Dedekind-MacNeille…
Braided groups and braided matrices are novel algebraic structures living in braided or quasitensor categories. As such they are a generalization of super-groups and super-matrices to the case of braid statistics. Here we construct braided…
For a natural number $n$, denote by $B_n$ the braid group on $n$ strings and by $SM_n$ the singular braid monoid on $n$ strings. $SM_n$ is one of the most important extensions of $B_n$. In [13], Y. Mikhalchishina classified all homogeneous…
We show that every amenable group with a locally invariant partial order has a left-invariant total order (and is therefore locally indicable). We also show that if a group G admits a left-invariant total order, and H is a locally nilpotent…
A subsemigroup S of a semigroup Q is a left order in Q and Q is a semigroup of left quotients of S if every element of Q can be expressed as a# b where a and b are elements of S and if, in addition, every element of S that is square…
Garside groups are combinatorial generalizations of braid groups which enjoy many nice algebraic, geometric, and algorithmic properties. In this article we propose a method for turning the direct product of a group $G$ by $\mathbb{Z}$ into…
Inspired by [4] we present a new algorithm for uniformly random generation of ordered trees in which all occuring outdegrees can be specified by a given sequence of numbers. The method can be used for random generation of binary or n-ary…
We describe a new technique to obtain representations of the braid group B_n from the R-matrix of a quantum deformed algebra of the one dimensional harmonic oscillator. We consider the action of the R-matrix not on the tensor product of…
From a group $H$ and a non-trivial element $h$ of $H$, we define a representation $\rho: B_n \to \Aut(G)$, where $B_n$ denotes the braid group on $n$ strands, and $G$ denotes the free product of $n$ copies of $H$. Such a representation…
We study an interesting family of cooperating coroutines, which is able to generate all patterns of bits that satisfy certain fairly general ordering constraints, changing only one bit at a time. (More precisely, the directed graph of…
We give a complete classification of homomorphisms from the braid group on $n$ strands to the braid group on $2n$ strands when $n$ is at least 5. We also classify endomorphisms of the braid group on 4 strands, as well as homomorphisms from…