Related papers: Braid relations for involution words in affine Cox…
We introduce two order relations on finite Coxeter groups which refine the absolute and the Bruhat order, and establish some of their main properties. In particular we study the restriction of these orders to noncrossing partitions and show…
We give a rigorous development of the construction of new braided fusion categories from a given category known as zesting. This method has been used in the past to provide categorifications of new fusion rule algebras, modular data, and…
We introduce a new notion of a relational word as a finite totally ordered set of positions endowed with three binary relations that describe which positions are labeled by equal data, by unequal data and those having an undefined relation…
We situate the noncrossing partitions associated to a finite Coxeter group within the context of the representation theory of quivers. We describe Reading's bijection between noncrossing partitions and clusters in this context, and show…
We present results underlining the conjecture that affine extensions for non-crystallographic Coxeter groups are suitable mathematical objects for the description of the symmetries of Carbon onions and Carbon nanotubes. It is the hope that…
We study classes of right-angled Coxeter groups with respect to the strong submodel relation of parabolic subgroup. We show that the class of all right-angled Coxeter group is not smooth, and establish some general combinatorial criteria…
In Artin-Tits groups attached to Coxeter groups of spherical type, we give a combinatorial formula to express the simple elements of the dual braid monoids in the classical Artin generators. Every simple dual braid is obtained by lifting an…
We recall some abstract connectivity concepts, and apply them to special chains in partially ordered sets, called veins, that are defined as order-convex chains that are contained in every maximal chain they meet. Veins enable us to define…
This paper explores the problem of unknotting closed braids and classical knots in mathematical knot theory. We apply evolutionary computation methods to learn sequences of moves that simplify knot diagrams, and show that this can be…
We study the graph on reduced words with edges given by the Coxeter relations for the symmetric group. We define a metric on reduced words for a given permutation, analogous to Coxeter length for permutations, for which the graph becomes…
In this report, I will start by first giving a brief introduction on knots to build some intuition before beginning the more rigorous review in the Literature Review section. There, I will define knot equivalence, the Jones polynomial…
In this paper, we construct invariants of braids, knots and links by studying dynamics of points in $\R^{2}$ and applying the Ptolemy relation $ac+bd=xy$.
We prove that the Khovanov-Lee complex of an oriented link, L, in a thickened annulus, A x I, has the structure of a bifiltered complex whose filtered chain homotopy type is an invariant of the isotopy class of L in A x I. Using ideas of…
Let $(W,S)$ be an arbitrary Coxeter system. For each word $\omega$ in the generators we define a partial order--called the {\sf $\omega$-sorting order}--on the set of group elements $W_\omega\subseteq W$ that occur as subwords of $\omega$.…
We define an invariant of tangles and framed tangles given a finite crossed module and a pair of functions, called a Reidemeister pair, satisfying natural properties. We give several examples of Reidemeister pairs derived from racks,…
Several finite complex reflection groups have a braid group which is isomorphic to a torus knot group. The reflection group is obtained from the torus knot group by declaring meridians to have order $k$ for some $k\geq 2$, and meridians are…
Martin showed that link Floer homology detects braid axes. In this paper we extend this result to give a topological characterisation of links which are almost braided from the point of view of link Floer homology. The result is inspired by…
We construct and study new generalisations to rooted trees and forests of some properties of shuffles of words. First, we build a coproduct on rooted trees which, together with their shuffle, endow them with bialgebra structure. We then…
We introduce natural language processing into the study of knot theory, as made natural by the braid word representation of knots. We study the UNKNOT problem of determining whether or not a given knot is the unknot. After describing an…
In this paper we introduce the tied links, i.e. ordinary links provided with some ties between strands. The motivation for introducing such objects originates from a diagrammatical interpretation of the defining generators of the so-called…