A solution of the power conjugacy problem for words in the Coxeter groups of extra large type

DOI10.1515/DMA.2008.038zbMath1175.20027OpenAlexW1999417793MaRDI QIDQ3184565

Vladimir N. Bezverkhniy, Irina Vasil'evna Dobrynina

Publication date: 21 October 2009

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.2008.038

zbMATH Keywords

algorithmsCoxeter groupsgeneratorspower conjugacy problemintersections of cyclic subgroups

Mathematics Subject Classification ID

Subgroup theorems; subgroup growth (20E07) Generators, relations, and presentations of groups (20F05) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items

On algorithmic problems in generalized tree structures of Coxeter groups ⋮ On problem of generalized conjugation of words in a generalized tree structures of Coxeter groups ⋮ Unnamed Item ⋮ О НОРМАЛИЗАТОРАХ В НЕКОТОРЫХ ГРУППАХ КОКСТЕРА

Cites Work

• A solution of the generalised conjugacy problem for words in the Coxeter groups of large type