相关论文: Reduce Problems From Braid Groups To Braid Monoids

Let M be a compact, connected surface, possibly with a finite set of points removed from its interior. Let d,n be positive integers, and let N be a d-fold covering space of M. We show that the covering map induces an embedding of the n-th…

We give a complete complexity classification for the problem of finding a solution to a given system of equations over a fixed finite monoid, given that a solution over a more restricted monoid exists. As a corollary, we obtain a complexity…

Motivated by the study of word problems of monoids, we explore two ways of viewing binary relations on $A^*$ as languages. We exhibit a hierarchy of classes of binary relations on $A^*$, according to the class of languages the relation…

This note tells you how to construct a k(n)-dimensional family of (isomorphism classes of) irreducible representations of dimension n for the three string braid group B_3, where k(n) is an admissible function of your choosing; for example…

We describe a practical algorithm for computing normal forms for semigroups and monoids with finite presentations satisfying so-called small overlap conditions. Small overlap conditions are natural conditions on the relations in a…

In this paper we prove several results regarding decidability of the membership problem for certain submonoids in amalgamated free products and HNN extensions of groups. These general results are then applied to solve the prefix membership…

We use some Lie group theory and Budney's unitarization of the Lawrence-Krammer representation, to prove that for generic parameters of definite form the image of the representation (also on certain types of subgroups) is dense in the…

It is shown that the compressed word problem for an HNN-extension with base group H and finite associated subgroups is polynomial time Turing-reducible to the compressed word problem for H. An analogous result for amalgamated free products…

The surface singular braid monoid corresponds to marked graph diagrams of knotted surfaces in braid form. In a quest to resolve linearity problem for this monoid, we will show that if it is defined on at least two or at least three strands,…

If $u$ and $v$ are two conjugate elements of a hyperbolic group then the length of a shortest conjugating element for $u$ and $v$ can be bounded by a linear function of the sum of their lengths, as was proved by Lysenok. Bridson and…

This work aims to jointly optimize the coding and node selection to minimize the processing time for distributed computing tasks over wireless edge networks. Since the joint optimization problem formulation is NP-hard and nonlinear, we…

We describe a new approach to the Word Problem for Artin-Tits groups and, more generally, for the enveloping group U(M) of a monoid M in which any two elements admit a greatest common divisor. The method relies on a rewrite system R(M) that…

Braided Thompson's groups are finitely presented groups introduced by Brin and Dehornoy which contain the ordinary braid groups $B_n$, the finitary braid group $B_{\infty}$ and Thompson's group $F$ as subgroups. We describe some of the…

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)…

We study representations of the loop braid group $LB_n$ from the perspective of extending representations of the braid group $B_n$. We also pursue a generalization of the braid/Hecke/Temperlely-Lieb paradigm---uniform finite dimensional…

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…

A notion of branch-width, which generalizes the one known for graphs, can be defined for matroids. We first give a proof of the polynomial time model-checking of monadic second-order formulas on representable matroids of bounded…

We show that the problem of constructing a real rational knot of a reasonably low degree can be reduced to an algebraic problem involving the pure braid group: expressing an associated element of the pure braid group in terms of the…

In the last decade, a number of public key cryptosystems based on com- binatorial group theoretic problems in braid groups have been proposed. We survey these cryptosystems and some known attacks on them. This survey includes: Basic facts…

A class of the Benjamin-Bona-Mahony-Burgers (BBMB) equations with time-dependent coefficients is investigated with the Lie symmetry point of view. The set of admissible transformations of the class is described exhaustively. The complete…