Related papers: Reducible braids and Garside theory

We study the Betti tables of reducible algebraic curves with a focus on connected line arrangements and provide a general formula for computing the quadratic strand of the Betti table for line arrangements that satisfy certain hypotheses.…

In this paper we begin the study of set-theoretic type solution of the braid equation. Our theory includes set-theoretical solutions as basic examples. We show that the relationships between set-theoretical solutions, q-cycle sets,…

Let G be a connected reductive linear algebraic group. We use geometric methods to investigate G-completely reducible subgroups of G, giving new criteria for G-complete reducibility. We show that a subgroup of G is G-completely reducible if…

Recent developments in the theory of stability conditions and its relation to Teichmuller theory have revealed a deep connection between triangulated categories and surfaces. Motivated by this, we prove a categorical analogue of the…

The evaluation of partition functions is a central problem in statistical physics. For lattice systems and other discrete models the partition function may be expressed as the contraction of a tensor network. Unfortunately computing such…

We classify Nichols algebras of irreducible Yetter-Drinfeld modules over groups such that the underlying rack is braided and the homogeneous component of degree three of the Nichols algebra satisfies a given inequality. This assumption…

Braid groups are an important and flexible tool used in several areas of science, such as Knot Theory (Alexander's theorem), Mathematical Physics (Yang-Baxter's equation) and Algebraic Geometry (monodromy invariants). In this note we will…

String and particle braiding statistics are examined in a class of topological orders described by discrete gauge theories with a gauge group $G$ and a 4-cocycle twist $\omega_4$ of $G$'s cohomology group…

We give a new method to compute the centralizer of an element in Artin braid groups and, more generally, in Garside groups. This method, together with the solution of the conugacy problem given by the authors in a previous paper, are two…

For every group genetic code with finite number of generating and at most with one defining relation we introduce the braid group of this genetic code. This construction includes the braid group of Euclidean plane, the braid groups of…

A group is boundedly simple if, for some constant N, every nontrivial conjugacy class generates the whole group in N steps. For a large class of trees, Tits proved simplicity of a canonical subgroup of the automorphism group, which is…

Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…

Divisibility monoids (resp. Garside monoids) are a natural algebraic generalization of Mazurkiewicz trace monoids (resp. spherical Artin monoids), namely monoids in which the distributivity of the underlying lattices (resp. the existence of…

For a given graph whose edges are labeled with general real numbers, we consider the set of functions from the vertex set into the Euclidean plane such that the distance between the images of neighbouring vertices is equal to the…

In this article we present an unpublished proof of W. Thurston that pure braid groups have the congruence subgroup property.

We describe a new presentation for the complex reflection groups of type $(e,e,r)$ and their braid groups. A diagram for this presentation is proposed. The presentation is a monoid presentation which is shown to give rise to a Garside…

In a previous work [11], the author considered a representation of the braid group \rho: B_n\to GL_m(\Bbb Z[q^{\pm 1},t^{\pm 1}]) (m=n(n-1)/2), and proved it to be faithful for n=4. Bigelow [3] then proved the same representation to be…

Given a presentably symmetric monoidal $\infty$-category $\mathcal{C}$ and an $\mathbb{E}_{\infty}$-monoid $M$, we introduce and classify twisted graded categories, which generalize the Day convolution structure on $\mathrm{Fun}(M,…

In Gaussian graphical model selection, noise-corrupted samples present significant challenges. It is known that even minimal amounts of noise can obscure the underlying structure, leading to fundamental identifiability issues. A recent line…

Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…