Related papers: When the lower central series stops: a comprehensi…

We develop invariants of the lower central series of free groups through linking of letters, showing they span the rational linear dual of the lower central series subquotients. We build on an approach to Lie coalgebras through operads,…

We compute all sections of the finite Weyl group, that satisfy the braid relations, in the case that G is an almost-simple connected reductive group defined over an algebraically closed field. We then demonstrate that this set of sections…

Define a Garside monoid to be a cancellative monoid where right and left lcm's exist and that satisfy additional finiteness assumptions, and a Garside group to be the group of fractions of a Garside monoid. The family of Garside groups…

This article extends the works of Gon\c{c}alves, Guaschi, Ocampo [GGO] and Marin [MAR2] on finite subgroups of the quotients of generalized braid groups by the derived subgroup of their pure braid group. We get explicit criteria for…

This paper is concerned with the problem of determining the number of division algebras which share the same collection of finite splitting fields. As a corollary we are able to determine when two central division algebras may be…

We initiate the study of C*-algebras and groupoids arising from left regular representations of Garside categories, a notion which originated from the study of Braid groups. Every higher rank graph is a Garside category in a natural way. We…

This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…

Let G be a graph. The (unlabeled) configuration space of n points on G is the space of all n-element subsets of G. The fundamental group of such a configuration space is called a graph braid group. We use a version of discrete Morse theory…

In this paper, we study the structure of set-multilinear arithmetic circuits and set-multilinear branching programs with the aim of showing lower bound results. We define some natural restrictions of these models for which we are able to…

In the first section of the paper, we will give some basic definitions and properties about Crystalline Graded Rings. In the following section we will provide a general description of the center. Afterwards, the case where the grading group…

In this paper we study the structure and the algebraic varieties of associative trialgebras. We provide a classification of n-dimensional associative trialgebras for n $\leq$ 4. Using the classification result of associative trialgebras, we…

We define invariants of braids rather than invariants of conjugacy classes of braids. For any pure three-braid we give effective upper and lower bounds for these invariants. This is done in terms of a natural syllable decomposition of the…

We study the problem of deciding whether or not the image of an irreducible representation of the braid group $\B_3$ of degree $\leq 5$ has finite image if we are only given the eigenvalues of a generator. We provide a partial algorithm…

Grouping the nodes of a graph into clusters is a standard technique for studying networks. We study a problem where we are given a directed network and are asked to partition the graph into a sequence of coherent groups. We assume that…

We study several natural decision problems in braid groups and Artin groups. We classify the Artin groups with decidable submonoid membership problem in terms of the non-existence of certain forbidden induced subgraphs of the defining…

The aim of this paper is to classify reduction types of algebraic curves. Reduction types capture the discrete invariants of fibres in one-dimensional families of curves, and they have been described in genus 1, 2 and 3. For fixed genus…

We investigate the complexity of computing the Zariski closure of a finitely generated group of matrices. The Zariski closure was previously shown to be computable by Derksen, Jeandel, and Koiran, but the termination argument for their…

Garside calculus is the common mechanism that underlies a certain type of normal form for the elements of a monoid, a group, or a category. Originating from Garside's approach to Artin's braid groups, it has been extended to more and more…

We present exponential and super factorial lower bounds on the number of Hamiltonian cycles passing through any edge of the basis graphs of a graphic, generalized Catalan and uniform matroids. All lower bounds were obtained by a common…

This article is an exposition of certain connections between the braid groups, classical homotopy groups of the 2-sphere, as well as Lie algebras attached to the descending central series of pure braid groups arising as Vassiliev invariants…