Bert Wiest
This article in memory of Patrick Dehornoy (1952-2019) is an invitation to Garside theory for mainstream geometric group theorists interested in mapping class groups, curve complexes, and the geometry of Artin-Tits groups.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Garside groupoids, as recently introduced by Krammer, generalise Garside groups. A weak Garside group is a group that is equivalent as a category to a Garside groupoid. We show that any periodic loop in a Garside groupoid $\CG$ may be viewed as a Garside element for a certain Garside structure on another Garside groupoid $\CG_m$, which is equivalent as a category to $\CG$. As a consequence, the centraliser of a periodic element in a weak Garside group is a weak Garside group. Our main tool is the notion of divided Garside categories, an analog for Garside categories of Bökstedt-Hsiang-Madsen's…
The Garside group, as a generalization of braid groups and Artin groups of finite types, is defined as the group of fractions of a Garside monoid. We show that the semidirect product of Garside monoids is a Garside monoid. We use the semidirect product $\mathbb Z\ltimes G^n$ of the infinite cyclic group $\mathbb Z$ and the cartesian product $G^n$ of a Garside group $G$ to study the properties of roots and powers of elements in $G$. The main result is an estimate of the growth of the minimal word-length of powers of elements in Garside groups, when the generating set is the set of simple elemen…
Several distinct Garside monoids having torus knot groups as groups of fractions are known. For $n,m\geq 2$ two coprime integers, we introduce a new Garside monoid $\mathcal{M}(n,m)$ having as Garside group the $(n,m)$-torus knot group, thereby generalizing to all torus knot groups a construction that we previously gave for the $(n,n+1)$-torus knot group. As a byproduct, we obtain new Garside structures for the braid groups of a few exceptional complex reflection groups of rank two. Analogous Garside structures are also constructed for a few additional braid groups of exceptional complex refle…
withdrawn and included in our new manuscript "Abelian subgroups of Garside groups", math.GT/0609683
In this paper, we show that for every abelian subgroup $H$ of a Garside group, some conjugate $g^{-1}Hg$ consists of ultra summit elements and the centralizer of $H$ is a finite index subgroup of the normalizer of $H$. Combining with the results on translation numbers in Garside groups, we obtain an easy proof of the algebraic flat torus theorem for Garside groups and solve several algorithmic problems concerning abelian subgroups of Garside groups.
It is known that Garside groups are strongly translation discrete. In this paper, we show that the translation numbers in a Garside group are rational with uniformly bounded denominators and can be computed in finite time. As an application, we give solutions to some group-theoretic problems.
A Garside group is a group admitting a finite lattice generating set D. Using techniques developed by Bestvina for Artin groups of finite type, we construct K(π,1)s for Garside groups. This construction shows that the (co)homology of any Garside group G is easily computed given the lattice D, and there is a simple sufficient condition that implies G is a duality group. The universal covers of these K(π,1)s enjoy Bestvina's weak non-positive curvature condition. Under a certain tameness condition, this implies that every solvable subgroup of G is virtually abelian.
The cycling operation endows the super summit set $S_x$ of any element $x$ of a Garside group $G$ with the structure of a directed graph $Γ_x$. We establish that the subset $U_x$ of $S_x$ consisting of the circuits of $Γ_x$ can be used instead of $S_x$ for deciding conjugacy to $x$ in $G$, yielding a faster and more practical solution to the conjugacy problem for Garside groups. Moreover, we present a probabilistic approach to the conjugacy search problem in Garside groups. The results are likely to have implications for the security of recently proposed cryptosystems based on the hardness of …
We describe how an Ore category with a Garside family can be used to construct a classifying space for its fundamental group(s). The construction simultaneously generalizes Brady's classifying space for braid groups and the Stein--Farley complexes used for various relatives of Thompson's groups. It recovers the fact that Garside groups have finite classifying spaces. We describe the categories and Garside structures underlying certain Thompson groups. The Zappa--Szép product of categories is introduced and used to construct new categories and groups from known ones. As an illustration of our m…
Let $G$ be a Garside group with Garside element $Δ$. An element $g$ in $G$ is said to be \emph{periodic} if some power of $g$ lies in the cyclic group generated by $Δ$. This paper shows the following. (i) The periodicity of an element does not depend on the choice of a particular Garside structure if and only if the center of $G$ is cyclic. (ii) If $g^k=Δ^{ka}$ for some nonzero integer $k$, then $g$ is conjugate to $Δ^a$. (iii) Every finite subgroup of the quotient group $G/<Δ^m>$ is cyclic, where $Δ^m$ is the minimal positive central power of $Δ$.
We present a new operation to be performed on elements in a Garside group, called cyclic sliding, which is introduced to replace the well known cycling and decycling operations. Cyclic sliding appears to be a more natural choice, simplifying the algorithms concerning conjugacy in Garside groups and having nicer theoretical properties. We show, in particular, that if a super summit element has conjugates which are 'rigid' (that is, which have a certain particularly simple structure), then the optimal way of obtaining such a rigid conjugate through conjugation by positive elements is given by it…
In this article, we introduce the notion of cycling operations of arbitrary order in Garside groups, which is a full generalization of the cycling and decycling operations. Theoretically, this notion together with other related concepts provides a context in which various definitions and arguments concerning Garside groups are unified and simplified as well as improved. Practically, it yields a new algorithm which has a considerably improved performance on solving the conjugacy problem of reducible braids.
New Garside structures and applications to Artin groups
提出一种将群与 $\mathbb{Z}$ 的直积转化为 Garside 群的方法，生成包含小消去群和 Artin 群的新实例，并证明了双曲型 Artin 群的 $K(π,1)$-猜想新情形。
We present a solution to the conjugacy decision problem and the conjugacy search problem in Garside groups, which is theoretically simpler than the usual one, with no loss of efficiency. This is done by replacing the well known cycling and decycling operations by a new one, called cyclic sliding, which appears to be a more natural choice. We give an analysis of the complexity of our algorithm in terms of fundamental operations with simple elements, so our analysis is valid for every Garside group. This paper intends to be self-contained, not requiring any previous knowledge of prior algorithms…
From a group $H$ and a non-trivial element $h$ of $H$, we define a representation $ρ: B_n \to \Aut(G)$, where $B_n$ denotes the braid group on $n$ strands, and $G$ denotes the free product of $n$ copies of $H$. Such a representation shall be called the Artin type representation associated to the pair $(H,h)$. The goal of the present paper is to study different aspects of these representations. Firstly, we associate to each braid $β$ a group $Γ_{(H,h)} (β)$ and prove that the operator $Γ_{(H,h)}$ determines a group invariant of oriented links. We then give a topological construction of the Arti…
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 main steps for solving conjugacy systems, thus breaking recently discovered cryptosystems based in braid groups. We also present the result of our computations, where we notice that our algorithm yields surprisingly small generating sets for the centralizers.
An element in Artin's braid group B_n is said to be periodic if some power of it lies in the center of B_n. In this paper we prove that all previously known algorithms for solving the conjugacy search problem in B_n are exponential in the braid index n for the special case of periodic braids. We overcome this difficulty by putting to work several known isomorphisms between Garside structures in the braid group B_n and other Garside groups. This allows us to obtain a polynomial solution to the original problem in the spirit of the previously known algorithms. This paper is the third in a series…
A Garside monoid is a cancellative monoid with a finite lattice generating set; a Garside group is the group of fractions of a Garside monoid. The family of Garside groups contains the Artin-Tits groups of spherical type. We generalise the well-known notion of a parabolic subgroup of an Artin-Tits group into that of a parabolic subgroup of a Garside group. We also define the more general notion of a Garside subgroup of a Garside group, which is related to the notion of LCM-homomorphisms between Artin-Tits groups. We prove that most of the properties of parabolic subgroups extend to this subgro…
Morse elements in Garside groups are strongly contracting
本文证明在具有循环中心的有限型 Garside 群模中心的 Cayley 图中，任意 Morse 元素的轴是强压缩的，并推论得出 Morse 元素在附加长度图上以斜驶方式作用。
In this paper a relation between iterated cyclings and iterated powers of elements in a Garside group is shown. This yields a characterization of elements in a Garside group having a rigid power, where 'rigid' means that the left normal form changes only in the obvious way under cycling and decycling. It is also shown that, given X in a Garside group, if some power X^m is conjugate to a rigid element, then m can be bounded above by ||Δ||^3. In the particular case of braid groups, this implies that a pseudo-Anosov braid has a small power whose ultra summit set consists of rigid elements. This s…
Garside groups are a natural lattice-theoretic generalisation of the braid groups and spherical type Artin--Tits groups. Here we show that the class of Garside groups is closed under some free products with cyclic amalgamated subgroups. We deduce that every tree product of infinite cyclic groups is a Garside group. Moreover, we study those cyclic HNN extensions of Garside groups that are Garside groups as well. Using a theorem of Pietrowski, we conclude this paper by stating that a non-cyclic one-relator group is Garside if and only if its centre is nontrivial.
Let $G$ be a Garside group with Garside element $Δ$, and let $Δ^m$ be the minimal positive central power of $Δ$. An element $g\in G$ is said to be 'periodic' if some power of it is a power of $Δ$. In this paper, we study periodic elements in Garside groups and their conjugacy classes. We show that the periodicity of an element does not depend on the choice of a particular Garside structure if and only if the center of $G$ is cyclic; if $g^k=Δ^{ka}$ for some nonzero integer $k$, then $g$ is conjugate to $Δ^a$; every finite subgroup of the quotient group $G/<Δ^m>$ is cyclic. By a classical theor…
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 groups, and various generalizations previously considered (In particular, the Garside groups considered in [1,7] are special cases of those considered here; the latter had been called "small Gaussian" in earlier works; the name has been changed in order to uniformize the terminology with works by Bessis, Charney, Mi…
We present a new algorithm to solve the conjugacy problem in Artin braid groups, which is faster than the one presented by Birman, Ko and Lee. This algorithm can be applied not only to braid groups, but to all Garside groups (which include finite type Artin groups and torus knot groups among others).
We prove that an Artin-Tits group of type $\tilde C$ is the group of fractions of a Garside monoid, analogous to the known dual monoids associated with Artin-Tits groups of spherical type and obtained by the "generated group" method. This answers, in this particular case, a general question on Artin-Tits groups, gives a new presentation of an Artin-Tits group of type $\tilde C$, and has consequences for the word problem, the computation of some centralizers or the triviality of the center. A key point of the proof is to show that this group is a group of fixed points in an Artin-Tits group of …
We introduce and investigate the ribbon groupoid associated with a Garside group. Under a technical hypothesis, we prove that this category is a Garside groupoid. We decompose this groupoid into a semi-direct product of two of its parabolic subgroupoids and provide a groupoid presentation. In order to established the latter result, we describe quasi-centralizers in Garside groups. All results hold in the particular case of Artin-Tits groups of spherical type.
Garside-theoretical solutions to the conjugacy problem in braid groups depend on the determination of a characteristic subset of the conjugacy class of any given braid, e.g. the sliding circuit set. It is conjectured that, among rigid braids with a fixed number of strands, the size of this set is bounded by a polynomial in the length of the braids. In this paper we suggest a more precise bound: for rigid braids with $N$ strands and of Garside length $L$, the sliding circuit set should have at most $C\cdot L^{N-2}$ elements, for some constant $C$. We construct a family of braids which realise t…
Garside theory emerged from the study of Artin groups and their generalizations. Finite-type Artin groups admit two types of interval Garside structures corresponding to their standard and dual presentations. Concerning affine Artin groups, Digne established interval Garside structures for two families of these groups by using their dual presentations. Recently, McCammond established that none of the remaining dual presentations (except for one additional case) correspond to interval Garside structures. In this paper, shifting attention from dual presentations to other nice presentations for t…
Garside families have recently emerged as a relevant context for extending results involving Garside monoids and groups, which themselves extend the classical theory of (generalized) braid groups. Here we establish various characterizations of Garside families, that is, equivalently, various criteria for establishing the existence of normal decompositions of a certain type.
We construct a class of Garside groupoid structures on the pure braid groups, one for each function (called labelling) from the punctures to the integers greater than 1. The object set of the groupoid is the set of ball decompositions of the punctured disk; the labels are the perimeters of the regions. Our construction generalises Garside's original Garside structure, but not the one by Birman-Ko-Lee. As a consequence, we generalise the Tamari lattice ordering on the set of vertices of the associahedron.
We give a new presentation of the braid group $B$ of the complex reflection group $G(e,e,r)$ which is positive and homogeneous, and for which the generators map to reflections in the corresponding complex reflection group. We show that this presentation gives rise to a Garside structure for $B$ with Garside element a kind of generalised Coxeter element, and hence obtain solutions to the word and conjugacy problems for $B$.
In this paper, we obtain Groebner-Shirshov (non-commutative Gröbner) bases for the braid groups in the Birman-Ko-Lee generators enriched by new ``Garside word" $δ$. It gives a new algorithm for getting the Birman-Ko-Lee Normal Form in the braid groups, and thus a new algorithm for solving the word problem in these groups.
We describe a new presentation for the complex reflection groups of type $(e,e,r)$ and their braid groups. A diagram for this presentation is proposed. The presentation is a monoid presentation which is shown to give rise to a Garside structure. A detailed study of the combinatorics of this structure leads us to describe it as post-classical.
We show that every finitely generated Artin-Tits group admits a finite Garside family, by introducing the notion of a low element in a Coxeter group and proving that the family of all low elements in a Coxeter system (W, S) with S finite includes S and is finite and closed under suffix and join with respect to the right weak order.
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 criteria to prove that the Artin groups of type A and I 2 (m), m $\ge$ 4, have Dehornoy structures. We show that the left orders on the Artin groups of type A obtained from their Dehornoy structures are the Dehornoy orders. In the case of the Artin groups of type I 2 (m), m $\ge$ 4, we show that the left orders derived from their Dehornoy structures coincide with …
In this paper, we give a Groebner-Shirshov basis of the braid group $B_{n+1}$ in the Artin--Garside generators. As results, we obtain a new algorithm for getting the Garside normal form, and a new proof that the braid semigroup $B^+{n+1}$ is the subsemigroup in $B_{n+1}$.
This paper is the second in a series in which the authors study the conjugacy decision problem (CDP) and the conjugacy search problem (CSP) in Garside groups. The ultra summit set USS(X) of an element X in a Garside group G is a finite set of elements in G, introduced by the second author, which is a complete invariant of the conjugacy class of X in G. A fundamental question, if one wishes to find bounds on the size of USS(X), is to understand its structure. In this paper we introduce two new operations on elements of USS(X), called `partial cycling' and `partial twisted decycling', and prove …
We define geodesic normal forms for the general series of complex reflection groups G(e,e,n). This requires the elaboration of a combinatorial technique in order to explicitly determine minimal word representatives of the elements of G(e,e,n) over the generating set of the presentation of Corran-Picantin. Using these geodesic normal forms, we construct intervals in G(e,e,n) that are lattices. This gives rise to interval Garside groups. We determine which of these groups are isomorphic to the complex braid group B(e,e,n) and get a complete classification. For the other Garside groups that appea…
M. Picantin introduced the notion of Garside groups of spindle type, generalizing the 3-strand braid group. We show that, for linear Garside groups of spindle type, a normal form and a solution to the conjugacy problem are logspace computable. For linear Garside groups of spindle type with homogenous presentation we compute a geodesic normal form in logspace.
Conjugacy invariants and rigidity in Garside groups: a uniformity phenomenon
本文研究Garside群中刚性元素的共轭类大小序列的周期性，证明其周期长度仅依赖于群结构，并在圆形Garside群、2生成元Artin群及对偶4股辫群中给出验证。
Construction of a group of automorphisms for an infinite family of Garside groups
本文为量子杨-巴克斯特方程非退化对称解的结构群构造自同构群，证明其存在保持Garside性质的子群，并在某些情况下得到外自同构群。
Simplicial pseudohyperplane arrangements give weak Garside groups
本文通过结合Bessis的Garside范畴与Salvetti的度量半球复形，证明了伪超平面排列复化补集及定向拟阵的Salvetti复形基本群均为弱Garside群，提供了该群的新实例。
Garside groups and Yang-Baxter equation
该研究建立了特定加赛德群与量子杨-巴克斯特方程特定解的结构群的一一对应，并通过Δ-纯加赛德群刻画了不可分解解，连接了群论与量子代数领域。
Ordering, Artin--Tits group, Garside structure
本文研究球形型阿廷群的德霍诺伊结构相关条件，证明其A条件几乎总是成立但B条件很少满足，明确了这类群具备德霍诺伊结构的条件情况。
A graph is Helly if every family of pairwise intersecting combinatorial balls has a nonempty intersection. We show that weak Garside groups of finite type and FC-type Artin groups are Helly, that is, they act geometrically on Helly graphs. In particular, such groups act geometrically on spaces with convex geodesic bicombing, equipping them with a nonpositive-curvature-like structure. That structure has many properties of a CAT(0) structure and, additionally, it has a combinatorial flavor implying biautomaticity. As immediate consequences we obtain new results for FC-type Artin groups (in parti…
In this paper we show the statement in the title. To any Garside group of finite type, Wiest and the author associated a hyperbolic graph called the \emph{additional length graph} and they used it to show that central quotients of Artin-Tits groups of spherical type are acylindrically hyperbolic. In general, a euclidean Artin-Tits group is not \emph{a priori} a Garside group but McCammond and Sulway have shown that it embeds into an \emph{infinite-type} Garside group which they call a \emph{crystallographic Garside group}. We associate a \emph{hyperbolic} additional length graph to this crysta…
Building on a result by W. Rump, we show how to exploit the right-cyclic law (x.y).(x.z) = (y.x).(y.z) in order to investigate the structure groups and monoids attached with (involutive nondegenerate) set-theoretic solutions of the Yang-Baxter equation. We develop a sort of right-cyclic calculus, and use it to obtain short proofs for the existence both of the Garside structure and of the I-structure of such groups. We describe finite quotients that exactly play for the considered groups the role that Coxeter groups play for Artin-Tits groups.
We present a simple construction which associates to every Garside group a metric space, called the additional length complex, on which the group acts. These spaces share important features with curve complexes: they are $δ$-hyperbolic, infinite, and typically locally infinite graphs. We conjecture that, apart from obvious counterexamples, additional length complexes are always of infinite diameter. We prove this conjecture for the classical example of braid groups $(B_n,Δ)$; moreover, in this framework, reducible and periodic braids act elliptically, and at least some pseudo-Anosov braids act…
We expound the properties of ribbons in a setting which is general enough to encompass spherical Artin monoids and dual braid monoids of well-generated complex reflection groups. We generalize to our setting results on parabolic subgroups of spherical Artin group of Godelle, Cumplido, and others.
The submonoid of the $3$-strand braid group $\mathcal{B}_3$ generated by $σ_1$ and $σ_1 σ_2$ is known to yield an exotic Garside structure on $\mathcal{B}_3$. We introduce and study an infinite family $(M_n)_{n\geq 1}$ of Garside monoids generalizing this exotic Garside structure, i.e., such that $M_2$ is isomorphic to the above monoid. The corresponding Garside group $G(M_n)$ is isomorphic to the $(n,n+1)$-torus knot group-which is isomorphic to $\mathcal{B}_3$ for $n=2$ and to the braid group of the exceptional complex reflection group $G_{12}$ for $n=3$. This yields a new Garside structure …
We establish relations between both the classical and the dual Garside structures of the braid group and the Burau representation. Using the classical structure, we formulate a non-vanishing criterion for the Burau representation of the 4-strand braid group. In the dual context, it is shown that the Burau representation for arbitrary braid index is injective when restricted to the set of \emph{simply-nested braids}.
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 general contexts, the latest one being that of categories and what are called Garside families. One of the benefits of this theory is to lead to algorithms solving effectively the naturally occurring problems, typically the Word Problem. The aim of this paper is to present and solve these algorithmic questions in the new extended framework.
"Set-theoretical" solutions of the quantum Yang-Baxter equation and a class of Garside groups
本文研究量子 Yang-Baxter 方程的集合论解，证明其结构群与特定表示的 Garside 群一一对应，并给出解不可分解等价于结构群为 $Δ$-纯 Garside 群的判据。
Garside shadows and biautomatic structures in Coxeter groups
本文通过推广Garside shadow的概念，证明了任何有限的Garside shadow可以用于构造Coxeter群的biautomatic结构，并展示了低元素Garside shadow与原始voracious语言的一致性。
About left orders in Garside groups
研究量子 Yang-Baxter 方程解的结构群，证明其不可双序，并揭示其左不变全序存在性的多样性。
Lattices, Garside structures and weakly modular graphs
本文研究了具有 $\widetilde A_n$ 形单纯形的单纯复形的组合非正曲率性质，证明了具有保序 $\mathbb Z$ 作用的格及其格商均构成弱模图，并揭示了范畴 Garside 结构与格的关系，给出了具有奇异性质的 Garside 群首批实例。
When Daan Krammer and Stephen Bigelow independently proved that braid groups are linear, they used the Lawrence-Krammer-Bigelow representation for generic values of its variables q and t. The t variable is closely connected to the traditional Garside structure of the braid group and plays a major role in Krammer's algebraic proof. The q variable, associated with the dual Garside structure of the braid group, has received less attention. In this article we give a geometric interpretation of the q portion of the LKB representation in terms of an action of the braid group on the space of non-dege…
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$ denotes the shortest word length of $g$ with respect to the set $\D$ of simple elements. We also show that there is a finite-time algorithm that computes, given an element of a Garside group, its stable super summit set.
Left regular representations of Garside categories II. Finiteness properties of topological full groups
本文研究与Garside范畴左正则表示群胚模型相关联的拓扑全群，发现底层小范畴的Garside结构可诱导双截面范畴的新Garside结构，使拓扑全群等同于其包络群胚的基本群，从而解决字问题并证明有限型移位乘积的拓扑全群为${\rm F}_{\infty}$型。
Let $G$ be a Garside group endowed with the generating set $\mathcal{S}$ of non-trivial simple elements, and let $H$ be a parabolic subgroup of $G$. We determine a transversal $T$ of $H$ in $G$ such that each $θ\in T$ is of minimal length in its right-coset, $H θ$, for the word length with respect to $\mathcal{S}$. We show that there exists a regular language $L$ on $\mathcal{S} \cup \mathcal{S}^{-1}$ and a bijection $\mathrm{ev} : L \to T$ satisfying $\mathrm{lg} (U) = \mathrm{lg}_\mathcal{S}( \mathrm{ev}(U))$ for all $U \in L$. From this we deduce that the coset growth series of $H$ in $G$ i…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。