相关论文: Alternating normal forms for braids and locally Ga…

We study the rational permutation braids, that is the elements of an Artin-Tits group of spherical type which can be written $x^{-1} y$ where $x$ and $y$ are prefixes of the Garside element of the braid monoid. We give a geometric…

Benardete, Gutierrez and Nitecki showed an important result which relates the geometrical properties of a braid, as a homeomorphism of the punctured disk, to its algebraic Garside-theoretical properties. Namely, they showed that if a braid…

In this paper, we introduce PM-mapping class monoids. Braid groups and mapping class groups have many features in common. Similarly to the notion of braid PM-monoid, PM-mapping class monoid is defined. This construction is an analogy of…

We derive a recurrence relation for the number of simple vertex-labelled bipartite graphs with given degrees of the vertices and use this result to obtain a new method for computing the growth function of the Artin monoid of type $A_{n-1}$…

The orbifold braid groups of two dimensional orbifolds were defined in [1] (arXiv:math/9907194) to understand certain Artin groups as subgroups of some suitable orbifold braid groups. We studied orbifold braid groups in some more detail in…

We prove that the exponential growth rate of the regular language of penetration sequences is smaller than the growth rate of the regular language of normal form words, if the acceptor of the regular language of normal form words is…

We introduce a condition on Garside groups that we call Dehornoy structure. An iteration of such a structure leads to a left order on the group. We show conditions for a Garside group to admit a Dehornoy structure, and we apply these…

For each integer $n\ge 1$, after fixing a proper complexity function on the braid group $\B_{2n}$, we use the Dehornoy order to define a strict total order on the set \[ \mathcal P_{2n}=H_{2n}\backslash \B_{2n}/H_{2n} \] of $2n$--plat…

I use matrix factorizations to describe branes at simple singularities as they appear in elliptic fibrations of local F-theory models. Each node of the corresponding Dynkin diagrams of the ADE-type singularities is associated with one…

We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy problem, including the Dynnikov method, which could be especially…

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

Long and Moody gave a method of constructing representations of the braid group B_n. We discuss some ways to generalize their construction. One of these gives representations of subgroups of B_n, including the Gassner representation of the…

This paper primarily investigates a specific type of deformation of the braid arrangement $\mathcal{B}_n$ in $\mathbb{R}^n$, denoted by $\mathcal{B}_n^A$ and defined in (1.2). Let $r_l(\mathcal{B}_n^A)$ be the number of regions of level $l$…

We develop a Hodge theory for relative simple normal crossing varieties over an Artinian base scheme. We introduce the notion of a mixed Hodge structure over an Artin ring, which axiomatizes the structure that is found on the cohomology of…

For a natural number $n$, denote by $B_n$ the braid group on $n$ strings and by $SM_n$ the singular braid monoid on $n$ strings. $SM_n$ is one of the most important extensions of $B_n$. In [13], Y. Mikhalchishina classified all homogeneous…

Abstract. This article determines relations between two notions concerning monoids: factorability structure, introduced to simplify the bar complex; and quadratic normalisation, introduced to generalise quadratic rewriting systems and…

Braids can be represented geometrically as laminations of punctured disks. The geometric complexity of a braid is the minimal complexity of a lamination that represents it, and tight laminations are representatives of minimal complexity.…

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…

We present a new procedure to determine the growth function of a homogeneous Garside monoid, with respect to the finite generating set formed by the atoms. In particular, we present a formula for the growth function of each Artin--Tits…

In the general context of presentations of monoids, we study normalisation processes that are determined by their restriction to length-two words. Garside's greedy normal forms and quadratic convergent rewriting systems, in particular those…