Jump to content

Isomorphism problem of Coxeter groups

From Wikipedia, the free encyclopedia
Unsolved problem in mathematics:
Given two Coxeter groups and , decide whether .

It is an unresolved problem in the mathematical field of group theory to determine whether or not two Coxeter groups (specified by their Coxeter diagrams) are isomorphic as abstract groups. Equivalently, the problem asks to determine, for a given Coxeter group , the possible subsets of that are Coxeter generating sets for (that is, for which is a Coxeter system).

A slight generalization of the problem can be made by asking to find to all isomorphisms from one group onto the other.[1] In 2022, Yuri Santos Rego and Petra Schwer introduced a new framework to deal with the problem (a finite dimensional, locally finite, ranked simplicial complex to capture isomorphisms between finite rank Coxeter systems) and asked more related open questions motivated by it.[2]

References

[edit]
  1. ^ Mühlherr, Bernhard (2005-06-28). "The isomorphism problem for Coxeter groups". arXiv:math.GR/0506572.
  2. ^ Santos Rego, Yuri; Schwer, Petra (2024-10-15). "The galaxy of Coxeter groups". Journal of Algebra. 656: 406–445. arXiv:2211.17038.