Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
A solution of the power conjugacy problem for words in the Coxeter groups of extra large type
-
V. N. Bezverkhnii
Veröffentlicht/Copyright:
15. Dezember 2008
Abstract
For Coxeter groups of extra large type, the power conjugacy problem for words and the problem of intersection of cyclic groups are solved; for the second problem we suggest an algorithm which for two elements finds the generator of the intersection of their cyclic subgroups.
Received: 2007-10-05
Published Online: 2008-12-15
Published in Print: 2008-December
© de Gruyter 2008
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Random graphs of Internet type and the generalised allocation scheme
- Limit distributions of the number of vectors satisfying a linear relation
- On design of circuits of logarithmic depth for inversion in finite fields
- The order of communication complexity of PIR-protocols
- On start states of an automaton model of lung in pure environment
- A solution of the power conjugacy problem for words in the Coxeter groups of extra large type
- Asymptotic bounds for the affinity level for almost all Boolean functions
- A lower bound for the affinity level for almost all Boolean functions
Artikel in diesem Heft
- Random graphs of Internet type and the generalised allocation scheme
- Limit distributions of the number of vectors satisfying a linear relation
- On design of circuits of logarithmic depth for inversion in finite fields
- The order of communication complexity of PIR-protocols
- On start states of an automaton model of lung in pure environment
- A solution of the power conjugacy problem for words in the Coxeter groups of extra large type
- Asymptotic bounds for the affinity level for almost all Boolean functions
- A lower bound for the affinity level for almost all Boolean functions
