相关论文: Groupes de Garside

A prefix monoid is a finitely generated submonoid of a finitely presented group generated by the prefixes of its defining relators. Important results of Guba (1997), and of Ivanov, Margolis and Meakin (2001), show how the word problem for…

We study several natural decision problems in braid groups and Artin groups. We classify the Artin groups with decidable submonoid membership problem in terms of the non-existence of certain forbidden induced subgraphs of the defining…

We establish faithfulness of braid group actions generated by twists along an ADE configuration of $2$-spherical objects in a derived category. Our major tool is the Garside structure on braid groups of type ADE. This faithfulness result…

A near-group category is an additively semisimple category with a product such that all but one of the simple objects is invertible. We classify braided structures on near-group categories, and give explicit numerical formulas for their…

We prove that the Galois groupoid of the category of $G$-spectra for a finite group $G$ is algebraic, i.e. equivalent to the \'etale fundamental groupoid of the Burnside ring of $G$. We implement an algorithm that computes the latter from…

A magmoid is a non-empty set with a partial binary operation; group-like magmoids generalize group-like magmas such as semigroups, monoids and groups. In this article, we first consider the many ways in which the notions of associative…

Self-similar group actions may be encoded by a class of left cancellative monoids called left Rees monoids, a result obtained by combining pioneering work by Perrot with later work by the first author. Left Rees monoids that are also right…

On the model of simple braids, defined to be the left divisors of Garside's elements $\Delta\_n$ in the monoid $B\_\infty^+$ , we investigate simple elements in Thompson's monoid $F^+$ and in a larger monoid $H^+$ that is a hybrid of…

We give an algorithm to decide whether a given braid with four strings is a product of three factors which are conjugates of standard generators of the braid group. The algorithm is of polynomial time. It is based on the Garside theory. We…

We give a method to produce faithful representations of the groups $G(n,m)=\langle X, Y \ \vert \ X^m = Y^n \rangle$ in $\mathrm{GL}_2(\mathbb{C}[t^{\pm 1}, q^{\pm 1}])$. These groups are Garside groups and the Garside normal forms of…

We produce a simple group $G$ of cardinality $\aleph_1$ which is Artinian (every strictly descending chain of subgroups is finite), satisfies a Burnside law and such that for each uncountable subset $Y \subseteq G$ there exists a natural…

We show that for each element $g$ of a Garside group, there exists a positive integer $m$ such that $g^m$ is conjugate to a periodically geodesic element $h$, an element with $|h^n|_\D=|n|\cdot|h|_\D$ for all integers $n$, where $|g|_\D$…

The n-string braid group of a graph X is defined as the fundamental group of the n-point configuration space of the space X. This configuration space is a finite dimensional aspherical space. A. Abrams and R. Ghrist have conjectured that…

We study two families of lattices whose number of elements are given by the numbers in even (respectively odd) positions in the Fibonacci sequence. The even Fibonacci lattice arises as the lattice of simple elements of a Garside monoid…

Under non-commutative Stone duality, there is a correspondence between second countable Hausdorff \'etale groupoids which have a Cantor space of identities and what we call Tarski inverse monoids: that is, countable Boolean inverse…

We study an abstract group of reversible Turing machines. In our model, each machine is interpreted as a homeomorphism over a space which represents a tape filled with symbols and a head carrying a state. These homeomorphisms can only…

A group $\Gamma$ is said to be periodic if for any $g$ in $\Gamma$ there is a positive integer $n$ with $g^n=id$. We first prove that a finitely generated periodic group acting on the 2-sphere $\SS^2$ by $C^1$-diffeomorphisms with a finite…

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…

In this paper we define a way to get a bounded invertible automaton starting from a finite graph. It turns out that the corresponding automaton group is regular weakly branch over its commutator subgroup, contains a free semigroup on two…

We give a new method to compute the centralizer of an element in Artin braid groups and, more generally, in Garside groups. This method, together with the solution of the conugacy problem given by the authors in a previous paper, are two…