Braids and partial permutations

We study the inverse braid monoid IBn introduced by Easdown and Lavers in 2004. We completely describe the factorizable structure of IBn and use this to give a new proof of the Easdown-Lavers presentation; we also derive several new presentations, each of which gives rise to a new presentation of the symmetric inverse monoid. We then define and study the pure inverse braid monoid IPn which is related to IBn in the same way that the pure braid group is related to the braid group.     

On the inverse braid monoid

Inverse braid monoid describes a structure on braids where the number of strings is not fixed. So, some strings of initial n may be deleted. In the paper we show that many properties and objects based on braid groups may be extended to the inverse braid monoids. Namely we prove an inclusion into a monoid of partial monomorphisms of a free group. This gives a solution of the word problem. Another solution is obtained by an approach similar to that of Garside. We give also the analogues of Artin presentation with two generators and Sergiescu graph-presentations.     

A special class of tensor categories initiated by inverse braid monoids

In this paper, we introduce the concept of a wide tensor category which is a special class of a tensor category initiated by the inverse braid monoids recently investigated by Easdown and Lavers [The Inverse Braid Monoid, Adv. in Math. 186 (2004) 438-455].The inverse braid monoidsIB_n is an inverse monoid which behaves as the symmetric inverse semigroup so that the braid group B_n can be regarded as the braids acting in the symmetric group. In this paper, the structure of inverse braid monoids is explained by using the language of categories. A partial algebra category, which is a subcategory of the representative category of a bialgebra, is given as an example of wide tensor categories. In addition, some elementary properties of wide tensor categories are given. The main result is to show that for every strongly wide tensor category C, a strict wide tensor category C^str can be constructed and is wide tensor equivalent to C with a wide tensor equivalence F.As a generalization of the universality property of the braid category B, we also illustrate a wide tensor category through the discussion on the universality of the inverse braid category IB (see Theorem 3.3, 3.6 and Proposition 3.7).     

The inverse braid monoid

We introduce an inverse monoid which plays a similar role with respect to the symmetric inverse semigroup that the braid group plays with respect to the symmetric group.     

p-Adic framed braids

In this paper we define the p-adic framed braid group F∞,n, arising as the inverse limit of the modular framed braids. An element in F∞,n can be interpreted geometrically as an infinite framed cabling. F∞,n contains the classical framed braid group as a dense subgroup. This leads to a set of topological generators for F∞,n and to approximations for the p-adic framed braids. We further construct a p-adic Yokonuma-Hecke algebra Y∞,n(u) as the inverse limit of a family of classical Yokonuma-Hecke algebras. These are quotients of the modular framed braid groups over a quadratic relation. Finally, we give topological generators for Y∞,n(u).     

On the inverse braid and reflection monoids of type <Emphasis Type="Italic">B</Emphasis>

There are well-known relations between braid and symmetric groups as well as Artin-Brieskorn braid groups and Coxeter groups: the latter are the factor-groups of the Artin-Brieskorn braid groups. The inverse braid monoid is related to the inverse symmetric monoid in the same way. We show that similar relations exist between the inverse braid monoid of type B and the inverse reflection monoid of type B. This gives a presentation of the latter monoid.     

On F-inverse covers of inverse monoids

It is shown that each finite inverse monoid admits a finite F-inverse cover if and only if the same is true for each finite combinatorial strict inverse semigroup with an identity adjoined if and only if the same is true for the Margolis-Meakin expansion M(H) of each finite elementary abelian p-group H for some prime p. Additional equivalent conditions are given in terms of the existence of locally finite varieties of groups having certain properties. Ultimately, the problem of whether each finite inverse monoid admits a finite F-inverse cover, is reduced to a question concerning the Kostrikin-Zelmanov varieties K_n of all locally finite groups of exponent dividing n.     

Finitely presented algebras and groups defined by permutation relations

The class of finitely presented algebras over a field K with a set of generators a₁,…,a_n and defined by homogeneous relations of the form a₁a₂?a_n=a_σ(1)a_σ(2)?a_σ(n), where σ runs through a subset H of the symmetric group Sym_n of degree n, is introduced. The emphasis is on the case of a cyclic subgroup H of Sym_n of order n. A normal form of elements of the algebra is obtained. It is shown that the underlying monoid, defined by the same (monoid) presentation, has a group of fractions and this group is described. Properties of the algebra are derived. In particular, it follows that the algebra is a semiprimitive domain. Problems concerning the groups and algebras defined by arbitrary subgroups H of Sym_n are proposed.     

Explicit presentations for the dual braid monoidsPrésentations pour les monoı̈des de tresses duaux

Birman, Ko and Lee have introduced a new monoid $\text{B}{}^1{}_{\mathrm{n}}$—with an explicit presentation—whose group of fractions is the n-strand braid group $\text{B}{}_{\mathrm{n}}$. Building on a new approach by Digne, Michel and himself, Bessis has defined a dual braid monoid for every finite Coxeter type Artin–Tits group extending the type A case. Here, we give an explicit presentation for this dual braid monoid in the case of types B and D, and we study the combinatorics of the underlying Garside structures. To cite this article: M. Picantin, C. R. Acad. Sci. Paris, Ser. I 334 (2002) 843–848.     

Combinatorial properties of virtual braids

We determine the lower central series of the virtual braid group VBn and of the kernels of two different projections of VBn in Sn: the normal closure of the Artin braid group Bn, that we will denote by Hn, and the so-called virtual pure braid group VPn, which is related to Yang Baxter equation. We describe relations between Hn and VPn and we provide a connection between virtual pure braids and the finite type invariant theory for virtual knots defined by Goussarov, Polyak and Viro.     

Every finite semigroup is embeddable in a finite relatively free semigroup

The title result is proved by a Murskii-type embedding.Results on some related questions are also obtained. For instance, it is shown that every finitely generated semigroup satisfying an identity ξ^d=ξ^2d is embeddable in a relatively free semigroup satisfying such an identity, generally with a larger d; but that an uncountable semigroup may satisfy such an identity without being embeddable in any relatively free semigroup.It follows from known results that every finite group is embeddable in a finite relatively free group. It is deduced from this and the proof of the title result that a finite monoid S is embeddable by a monoid homomorphism in a finite (or arbitrary) relatively free monoid if and only if its group of invertible elements is either {e} or all of S.     

\mathcal{P}\mathcal{A}{\text{-isomorphisms}} of inverse semigroups

A partial automorphism of a semigroup S is any isomorphism between its subsemigroups, and the set all partial automorphisms of S with respect to composition is an inverse monoid called the partial automorphism monoid of S. Two semigroups are said to be if their partial automorphism monoids are isomorphic. A class of semigroups is called if it contains every semigroup to some semigroup from Although the class of all inverse semigroups is not we prove that the class of inverse semigroups, in which no maximal isolated subgroup is a direct product of an involution-free periodic group and the two-element cyclic group, is It follows that the class of all combinatorial inverse semigroups (those with no nontrivial subgroups) is A semigroup is called if it is isomorphic or antiisomorphic to any semigroup that is to it. We show that combinatorial inverse semigroups which are either shortly connected [5] or quasi-archimedean [10] are To Ralph McKenzieReceived April 15, 2004; accepted in final form October 7, 2004.     

Comparing Semigroup and Monoid Presentations for Finite Monoids

 It is known that for any finite group G given by a finite group presentation there exists a finite semigroup presentation for G of the same deficiency, i.e. satisfying . It is also known that the analogous statement does not hold for all finite monoids. In this paper we give a necessary and sufficient condition for a finite monoid M, given by a finite monoid presentation, to have a finite semigroup presentation of the same deficiency. (Received 17 April 2001; in revised form 15 September 2001)     

Characteristics of Graph Braid Groups

We give formulae for the first homology of the n-braid group and the pure 2-braid group over a finite graph in terms of graph-theoretic invariants. As immediate consequences, a graph is planar if and only if the first homology of the n-braid group over the graph is torsion-free and the conjectures about the first homology of the pure 2-braid groups over graphs in Farber and Hanbury (arXiv:1005.2300 [math.AT]) can be verified. We discover more characteristics of graph braid groups: the n-braid group over a planar graph and the pure 2-braid group over any graph have a presentation whose relators are words of commutators, and the 2-braid group and the pure 2-braid group over a planar graph have a presentation whose relators are commutators. The latter was a conjecture in Farley and Sabalka (J. Pure Appl. Algebra, 2012) and so we propose a similar conjecture for higher braid indices.     

Braided surfaces and seifert ribbons for closed braids

Apositive band in the braid groupB _n is a conjugate of one of the standard generators; a negative band is the inverse of a positive band. Using the geometry of the configuration space, a theory of bands andbraided surfaces is developed. Each representation of a braid as a product of bands yields a handle decomposition of aSeifert ribbon bounded by the corresponding closed braid; and up to isotopy all Seifert ribbons occur in this manner. Thus,band representations provide a convenient calculus for the study of ribbon surfaces. For instance, from a band representation, a Wirtinger presentation of the fundamental group of the complement of the associated Seifert ribbon inD ⁴ can be immediately read off, and we recover a result of T. Yajima (and D. Johnson) that every Wirtinger-presentable group appears as such a fundamental group. In fact, we show that every such group is the fundamental group of a Stein manifold, and so that there are finite homotopy types among the Stein manifolds which cannot (by work of Morgan) be realized as smooth affine algebraic varieties.     

Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations

Varying methods exist for computing a presentation of a finitely generated commutative cancellative monoid. We use an algorithm of Contejean and Devie [An efficient incremental algorithm for solving systems of linear diophantine equations, Inform. and Comput. 113 (1994) 143-172] to show how these presentations can be obtained from the nonnegative integer solutions to a linear system of equations. We later introduce an alternate algorithm to show how such a presentation can be efficiently computed from an integer basis.