Vines and partial transformations

We introduce the partial vine monoid PVn. This monoid is related to the partial transformation semigroup PTn in the same way as the braid group Bn is related to the symmetric group Sn, and contains both the vine monoid [T.G. Lavers, The theory of vines, Comm. Algebra 25 (4) (1997) 1257-1284] and the inverse braid monoid [D. Easdown, T.G. Lavers, The inverse braid monoid, Adv. Math. 186 (2) (2004) 438-455]. We give a presentation for PVn in terms of generators and relations, as well as a faithful representation in a monoid of endomorphisms of a free group. We also derive a new presentation for PTn.     

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

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.     

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.     

Tied monoids

We construct certain monoids, called tied monoids. These monoids result to be semidirect products finitely presented and commonly built from braid groups and their relatives acting on monoids of set partitions. The nature of our monoids indicate that they should give origin to new knot algebras; indeed, our tied monoids include the tied braid monoid and the tied singular braid monoid, which were used, respectively, to construct new polynomial invariants for classical links and singular links. Consequently, we provide a mechanism to attach an algebra to each tied monoid; this mechanism not only captures known generalizations of the bt-algebra, but also produces possible new knot algebras. To build the tied monoids it is necessary to have presentations of set partition monoids of types A, B and D, among others. For type A we use a presentation due to FitzGerald and for the other type it was necessary to built them.

     

Monodromy Groups and Bilinear Monodromy Invariant Combinations of Generalized Hypergeometric Type Integrals

The problem of determining bilinear combinations of holomorphic and antiholomorphic generalized hypergeometric type integrals left invariant under the action of the monodromy groups of the integrals is studied. In the special cases of simple Pochhammer type integrals and of twofold hypergeometric type integrals the existence and uniqueness of the bilinear invariants are proved, and the bilinear invariants are explicitly computed. Preparing the tools it is shown how to linearize and iterate representations of the braid group B_n as automorphism groups of certain free subgroups of the braid group B_n+1, and how the resulting iterated linear representations of the braid group in a natural way provide an algorithm to compute the monodromy group of generalized hypergeometric type integrals. Explicit formulae for different types of integration contours are given in the case of simple and twofold integrals.     

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.     

The geometry monoid of left self-distributivity

We develop a counterpart to Garside's analysis of the braid monoid B_n⁺ relevant for the monoid M_LD that describes the geometry of the left self-distributivity identity. The monoid M_LD extends B_∞⁺, of which it shares many properties, with the exception that it is not a direct limit of finitely generated monoids. By introducing a convenient local version of the fundamental elements Δ, we prove that right least common multiples exist in M_LD, and, more generally, that M_LD resembles a generalized Artin monoid.     

Inverse semigroups and varieties of finite semigroups

In this paper we shall present a new construction of the free inverse monoid on a set X. Contrary to the previous constructions of [9, 11], our construction is symmetric and originates from classical ideas of language theory. The ingredients of this construction are the free group on X and the relation that associates to a word w of the free monoid on X, the set of all pairs (u, v) such that uv = w. It follows at once from our construction that the free inverse monoid on X can be naturally embedded into the Schützenberger product of two free groups of basis X. We shall also give some connections with the theory of expansions as developed by Rhodes and Birget [2, 3].     

Groupes de Garside

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 contains the braid groups, all spherical Artin-Tits groups, and various generalizations previously considered.² Here we prove that Garside groups are biautomatic, and that being a Garside group is a recursively enumerable property, i.e., there exists an algorithm constructing the (infinite) list of all small Gaussian groups. The latter result relies on an effective, tractable method for recognizing those presentations that define a Garside monoid.     

On tensor representations of knot algebras

Summary The fact that a Yang-Baxter operator defines tensor representations of the Artin braid group has been used to construct knot invariants. The main purpose of this note is to extend the tensor representations of the Artin braid group to representations of the braid groupZ B _k associated to the Coxeter graphB _k. This extension is based on some fundamental identities for the standardR-matrices of quantum Lie theory, here called four braid relations. As an application, tensor representations of knot algebras of typeB (Hecke, Temperley-Lieb, Birman-Wenzl-Murakami) are derived.     

Brauer and Jones tied monoids

We introduce a ramified monoid, attached to each Brauer–type monoid, that is, to the symmetric group, to the Jones and Brauer monoids among others. Ramified monoids correspond to a class of tied monoids arising from knot theory and are interesting in themselves. The ramified monoid attached to the symmetric group is the Coxeter-like version of the so–called tied braid monoid. We give a presentation of the ramified monoid attached to the Brauer monoid. Also, we introduce and study two tied-like monoids that cannot be described as ramified monoids. However, these monoids can also be regarded as tied versions of the Jones and Brauer monoids.     

Monoids and Groups of <Emphasis Type="Italic">I</Emphasis>-Type

A monoid S generated by {x₁,. . .,x_n} is said to be of (left) I-type if there exists a map v from the free Abelian monoid FaM_n of rank n generated by {u₁,. . .,u_n} to S so that for all a∈FaM_n one has {v(u₁a),. . .,v(u_na)}={x₁v(a),. . .,x_nv(a)}. Then S has a group of fractions, which is called a group of (left) I-type. These monoids first appeared in the work of Gateva-Ivanova and Van den Bergh, inspired by earlier work of Tate and Van den Bergh. In this paper we show that monoids and groups of left I-type can be characterized as natural submonoids and groups of semidirect products of the free Abelian group Fa_n and the symmetric group of degree n. It follows that these notions are left–right symmetric. As a consequence we determine many aspects of the algebraic structure of such monoids and groups. In particular, they can often be decomposed as products of monoids and groups of the same type but on less generators and many such groups are poly-infinite cyclic. We also prove that the minimal prime ideals of a monoid S of I-type, and of the corresponding monoid algebra, are principal and generated by a normal element. Further, via left–right divisibility, we show that all semiprime ideals of S can be described. The latter yields an ideal chain of S with factors that are semigroups of matrix type over cancellative semigroups. In memory of Paul Wauters Mathematics Subject Classifications (2000) 20F05, 20M05; 16S34, 16S36, 20F16. The authors were supported in part by Onderzoeksraad of Vrije Universiteit Brussel, Fonds voor Wetenschappelijk Onderzoek (Belgium), Flemish–Polish bilateral agreement BIL 01/31, and KBN research grant 2P03A 033 25 (Poland).     

ON QUOTIENTS OF BRAID GROUPS

ABSTRACT.

Let G be the group ?[t, t ^?1] x ?. By studying the action of the braid group B_n on the set Gⁿ , we obtain representations of B_n into a wreath product of the symmetric group and the general linear group over ?[t, t ^?1]. This in particular recovers the Burau representation of the braid group. Furthermore, some quotients of the braid group are obtained by using the representations found.     

On representations and <Emphasis Type="Italic">K</Emphasis>-theory of the braid groups

 Let Γ be the fundamental group of the complement of a K(Γ, 1) hyperplane arrangement (such as Artin's pure braid group) or more generally a homologically toroidal group as defined below. The triviality of bundles arising from orthogonal representations of Γ is characterized completely as follows. An orthogonal representation gives rise to a trivial bundle if and only if the representation factors through the spinor groups. Furthermore, the subgroup of elements in the complex K-theory of BΓ which arises from complex unitary representations of Γ is shown to be trivial. In the case of real K-theory, the subgroup of elements which arises from real orthogonal representations of Γ is an elementary abelian 2-group, which is characterized completely in terms of the first two Stiefel-Whitney classes of the representation. In addition, quadratic relations in the cohomology algebra of the pure braid groups which correspond precisely to the Jacobi identity for certain choices of Poisson algebras are shown to give the existence of certain homomorphisms from the pure braid group to generalized Heisenberg groups. These cohomology relations correspond to non-trivial Spin representations of the pure braid groups which give rise to trivial bundles. Received: 6 February 2002 / Revised version: 19 September 2002 / Published online: 8 April 2003 RID="⋆" ID="⋆" Partially supported by the NSF RID="⋆⋆" ID="⋆⋆" Partially supported by grant LEQSF(1999-02)-RD-A-01 from the Louisiana Board of Regents, and by grant MDA904-00-1-0038 from the National Security Agency RID="⋆" ID="⋆" Partially supported by the NSF Mathematics Subject Classification (2000): 20F36, 32S22, 55N15, 55R50     

Action of some braid groups on hodge algebras

In this paper we show that the braid groups B _n and the symmetric automorphism groups H(n) of the free group F _n,n = 3,4 act in a non-linear way on an algebra with straightening law (ordinal Hodge algebra). We indicate various properties of these rings.     

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.     

Fundamental groups,inverse schützenberger automata,and monoid presentations

This paper gives decidable conditions for when a finitely generated subgroup of a free group is the fundamental group of a Schützenberger automaton corresponding to a monoid presentation of an inverse monoid. Also, generalizations are given to specific types of inverse monoids as well as to monoids which are "nearly inverse." This result has applications to computing membership for inverse monoids in a Mal'cev product of the pseudovariety of semilattices with a pseudovariety of groups.

This paper also shows that there is a bijection between strongly connected inverse automata and subgroups of a free group, generated by positive words. Hence, we also obtain that it is decidable whether a finite strongly connected inverse automaton is a Schützenberger automaton corresponding to a monoid presentation of an inverse monoid. Again, we have generalizations to other types of inverse monoids and to "nearly inverse" monoids. We show that it is undecidable whether a finite strongly connected inverse automaton is a Schützenberger automaton of a monoid presentation of anE-unitary inverse monoid.     

The dual braid monoid

We study a new monoid structure for Artin groups associated with finite Coxeter systems. Like the classical positive braid monoid, the new monoid is a Garside monoid. We give several equivalent constructions: algebraically, the new monoid arises when studying Coxeter systems in a “dual” way, replacing the pair (W,S) by (W,T), with T the set of all reflections; geometrically, it arises when looking at the reflection arrangement from a certain basepoint. In the type A case, we recover the monoid constructed by Birman, Ko and Lee.     

L'algèbre de Lie des transpositions

For any n3 we obtain the decomposition in simple factors of the Lie subalgebra of the group algebra of the symmetric group on n letters generated by the transpositions. This enables us to determine the algebraic hull of the braid group B_n and of several of its subgroups inside the representations of the Iwahori–Hecke algebra of type A.