ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SS be a finite set. A Coxeter matrix over SS is a symmetric matrix M=(mst)s,t∈SM=(m_{st})_{s,t\in S} with entries in {1,2,3,… }∪{∞}\{1,2,3,\dots\}\cup\{\infty\} such that mss=1m_{ss}=1 for all s∈Ss\in S and mst=mts≥2m_{st}=m_{ts}\ge 2 for all s≠ts\neq t. The Coxeter group of MM is

WM=⟨ S  ∣  (st)mst=1  for all s,t∈S with mst<∞ ⟩,W_M=\big\langle\, S \;\big|\; (st)^{m_{st}}=1 \ \text{ for all } s,t\in S \text{ with } m_{st}<\infty \,\big\rangle ,

and (WM,S)(W_M,S) is the associated Coxeter system, of rank ∣S∣|S|. The matrix MM is encoded by its Coxeter diagram: the finite labelled graph with vertex set SS in which distinct vertices s,ts,t are joined by an edge labelled mstm_{st} exactly when mst≥3m_{st}\ge 3.

For a group WW, a subset T⊆WT\subseteq W is a Coxeter generating set of WW if there are a Coxeter matrix N=(ntt′)t,t′∈TN=(n_{tt'})_{t,t'\in T} over TT and an isomorphism WN→WW_N\to W whose restriction to TT is the identity; in that case (W,T)(W,T) is a Coxeter system and NN is uniquely determined by TT, namely ntt′n_{tt'} is the order of tt′tt' in WW.

There exists an algorithm which, given as input two Coxeter diagrams, with Coxeter matrices MM over a finite set SS and M′M' over a finite set S′S', decides whether WM≅WM′W_M\cong W_{M'} as abstract groups.

Equivalently, there exists an algorithm which, given as input a Coxeter diagram with Coxeter matrix MM over a finite set SS, outputs the list of all Coxeter diagrams, up to isomorphism of labelled graphs, arising from Coxeter generating sets T⊆WMT\subseteq W_M of the group W:=WMW:=W_M.

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.