相关论文: A braid group representation derived from handlebo…

We define a cell complex with an action of the even spin mapping class group, and use it to obtain a finite presentation. We also obtain a finite presentation with Dehn twist generators.

In this paper we study Thurston's automaton on the braid groups via binary operations. These binary operations are obtained from the construction of this automaton. We study these operations and find some connections between them in a "skew…

In the paper we give a survey on braid groups and subjects connected with them. We start with the initial definition, then we give several interpretations as well as several presentations of these groups. Burau presentation for the pure…

We revisit Margulis-Zimmer Super-Rigidity and provide some generalizations. In particular we obtain super-rigidity results for lattices in higher-rank groups or product of groups, targeting at algebraic groups over arbitrary fields with…

In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…

It is a classical result in representation theory that the braid group $\mathscr{B}_\mathfrak{g}$ of a simple Lie algebra $\mathfrak{g}$ acts on any integrable representation of $\mathfrak{g}$ via triple products of exponentials in its…

We establish the faithfulness of a geometric action of the absolute Galois group of the rationals that can be defined on the discriminantal variety associated to a finite complex reflection group, and review some possible connections with…

We show that branched coverings of surfaces of large enough genus arise as characteristic maps of braided surfaces that is, lift to embeddings in the product of the surface with $\mathbb R^2$. This result is nontrivial already for…

This paper will appear in the Santa Cruz proceedings. An overview of the braid group techniques in the theory of algebraic surfaces, from Zariski to the latest results, is presented. An outline of the Van Kampen algorithm for computing…

The braid group appears in many scientific fields and its representations are instrumental in understanding topological quantum algorithms, topological entropy, classification of manifolds and so on. In this work, we study planer diagrams…

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…

In 2003, Fomin and Zelevinsky proved that finite type cluster algebras can be classified by Dynkin diagrams. Then in 2013, Barot and Marsh defined the presentation of a reflection group associated to a Dynkin diagram in terms of an…

We construct a finite dimensional quiver algebra from the non-simply laced type $B$ Dynkin diagram, which we call the type $B$ zigzag algebra. This leads to a faithful categorical action of the type $B$ braid group $\mathcal{A}(B)$, acting…

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…

We define pseudo-Garside groups and prove a theorem about them parallel to Garside's result on the word problem for the usual braid groups. The main novelty is that the set of simple elements can be infinite. We introduce a group B=B(Z^n)…

A braided Frobenius algebra is a Frobenius algebra with braiding that commutes with the operations, that are related to diagrams of compact surfaces with boundary expressed as ribbon graphs. A heap is a ternary operation exemplified by a…

We show that, in an Artin-Tits group of spherical type, the intersection of two parabolic subgroups is a parabolic subgroup. Moreover, we show that the set of parabolic subgroups forms a lattice with respect to inclusion. This extends to…

We provide an explicit construction that allows one to easily decompose a graph braid group as a graph of groups. This allows us to compute the braid groups of a wide range of graphs, as well as providing two general criteria for a graph…

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…

We show that if a group can be represented as a graph product of finite directly indecomposable groups, then this representation is unique.