Isomorphism problem of Coxeter groups
Statement
Let be a finite set. A Coxeter matrix over is a symmetric matrix with entries in such that for all and for all . The Coxeter group of is
and is the associated Coxeter system, of rank . The matrix is encoded by its Coxeter diagram: the finite labelled graph with vertex set in which distinct vertices are joined by an edge labelled exactly when .
For a group , a subset is a Coxeter generating set of if there are a Coxeter matrix over and an isomorphism whose restriction to is the identity; in that case is a Coxeter system and is uniquely determined by , namely is the order of in .
There exists an algorithm which, given as input two Coxeter diagrams, with Coxeter matrices over a finite set and over a finite set , decides whether as abstract groups.
Equivalently, there exists an algorithm which, given as input a Coxeter diagram with Coxeter matrix over a finite set , outputs the list of all Coxeter diagrams, up to isomorphism of labelled graphs, arising from Coxeter generating sets of the group .
Record
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.