Searcharxiv⌕ Search

arXiv subjects

Fabricio Dos Santos

Publications and source records attributed to Fabricio Dos Santos.

2 recordsLinked to original sources

Weak order on groups generated by involutions

In this article, we propose to initiate the general study of involution systems. An {\em involution system}, that is, a group $W$ generated by a set of involutions $S$, is naturally endowed with a {\em weak order} arising from orienting the Cayley graph of $(W,S)$. In the case of a Coxeter system $(W,S)$, Björner showed that the weak order is a complete meet-semilattice. This fact has many important consequences for Coxeter systems and their related structures. In this article, we discuss the following question: For which involution systems is the weak order a complete meet-semilattice? The class of involution systems that satisfies this condition is larger than the class of Coxeter systems (it contains, for instance, Cactus groups). In the case of an involution system with sign character, we provide a finite presentation by generators and relations and a classification in rank 3. We also obtain new characterizations of Coxeter systems in terms of the weak order, and prove a number of results on certain subclasses of these involution systems. Finally, we discuss further works and open problems in relation to biautomatic structures, geometric representations, mediangle graphs, and more.

math.GR↗

Garside shadows and biautomatic structures in Coxeter groups

In 2022, Osajda and Przytycki showed that any Coxeter group $W$ is biautomatic. Key to their proof is the notion of voracious projection of an element $g \in W$, which is used iteratively to construct a biautomatic structure for $W$: the voracious language. In this article, we generalize these two notions by defining them for any Garside shadow $B$ in a Coxeter system $(W,S)$. This leads to the result that any finite Garside shadow in $(W,S)$ can be used to construct a biautomatic structure for $W$. In addition, we show that for the Garside shadow $L$ of low elements, the biautomatic structure obtained corresponds to the original voracious language of Osajda and Przytycki. These results answer a question of Hohlweg and Parkinson.

math.GR↗