The set of dominance-minimal roots
type: Item
instance of: scholarly article
title: The set of dominance-minimal roots
zbMATH Open document ID: 0942.20020
author: Brigitte Brink
published in: Journal of Algebra
publication date: 2000-02-21T00:00:00Z
review text: This article examines the set of so-called dominance-minimal, or elementary roots of a Coxeter system. An earlier paper by \textit{B. Brink} and \textit{R. B. Howlett} [Math. Ann. 296, No. 1, 179-190 (1993; Zbl 0793.20036)] showed that this set is finite, but the bound given in that paper was impractically large. This paper vastly improves the earlier result, giving a method whereby the set of dominance-minimal roots may be explicitly constructed. The paper also lists the sets of dominance-minimal roots for certain special Coxeter systems. Since the finiteness of the set of dominance-minimal roots is linked to the fact that Coxeter groups have an automatic structure, the author expects that her results will be useful to those who wish to develop algorithms for Coxeter groups. The article is structured as follows: Section 1 introduces the main results and the motivation for them, and Section 2 gives some of the necessary background material, including the definitions of two partial orders, precedance and dominance. Readers in danger of confusing the two should read this section carefully, especially the comments at the end of the second-last paragraph on page 374. Section 3 outlines the strategy used to characterise the sets of dominance-minimal roots, which is as follows. The set of dominance-minimal roots \(\mathcal E\) is expressed as the disjoint union of sets \(\mathcal E_S\) derived from subsystems \((W_S,S)\) of the original Coxeter system. The article gives a means of calculating \(\mathcal E_S\) inductively from the sets \(\mathcal E_{S'}\) for which \(S'\) is a subset of \(S\). In Section 4, \(\mathcal E_S\) is shown to be empty for a large class of Coxeter subsystems \((W_S,S)\), and the remaining sections calculate \(\mathcal E_S\) explicitly for a large class of those cases still remaining. This is more than sufficient to calculate \(\mathcal E_S\) for any desired subsystem, and hence to calculate \(\mathcal E\) for any finite-rank Coxeter group. The pap…
Mathematics Subject Classification ID: 20F55
Mathematics Subject Classification ID: 20F65
zbMATH DE Number: 1213829
zbMATH Keywords: Coxeter groups
zbMATH Keywords: Coxeter systems
zbMATH Keywords: root systems
zbMATH Keywords: dominance minimal roots
zbMATH Keywords: elementary roots
reviewed by: Michael I. Hartley
MaRDI profile type: Publication
full work available at URL: jabr.1997.7418
OpenAlex ID: W2014803182
cites work: Q5580319
cites work: A finiteness property and an automatic structure for Coxeter groups
cites work: Machine calculations in Weyl groups
cites work: Q3998721
cites work: The reflection representations of some Chevalley groups
DOI: 10.1006/JABR.1997.7418
description: scientific article; zbMATH DE number 1213829