Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Conjugacy of Coxeter Elements
View through CrossRef
For a Coxeter group $(W,S)$, a permutation of the set $S$ is called a Coxeter word and the group element represented by the product is called a Coxeter element. Moving the first letter to the end of the word is called a rotation and two Coxeter elements are rotation equivalent if their words can be transformed into each other through a sequence of rotations and legal commutations. We prove that Coxeter elements are conjugate if and only if they are rotation equivalent. This was known for some special cases but not for Coxeter groups in general.
The Electronic Journal of Combinatorics
Title: Conjugacy of Coxeter Elements
Description:
For a Coxeter group $(W,S)$, a permutation of the set $S$ is called a Coxeter word and the group element represented by the product is called a Coxeter element.
Moving the first letter to the end of the word is called a rotation and two Coxeter elements are rotation equivalent if their words can be transformed into each other through a sequence of rotations and legal commutations.
We prove that Coxeter elements are conjugate if and only if they are rotation equivalent.
This was known for some special cases but not for Coxeter groups in general.
Related Results
Frobenius Conjugacy Classes
Frobenius Conjugacy Classes
This chapter analyzes Frobenius conjugacy classes. It shows that in either the split or nonsplit case, when χ is good for N, the conjugacy class FrobE,X has unitary eigenvalues in...
A dai-liao hybrid conjugate gradient method for unconstrained optimization
A dai-liao hybrid conjugate gradient method for unconstrained optimization
One of todays’ best-performing CG methods is Dai-Liao (DL) method which depends on non-negative parameter and conjugacy conditions for its computation. Although numerous optimal s...
Product of Conjugacy Classes of the Alternating Group An
Product of Conjugacy Classes of the Alternating Group An
For a nonempty subset X of a group G and a positive integer m , the product of X , denoted by Xm ,is the set
Xm =
That is ...
Key Agreement Protocol Using Conjugacy Classes of Finitely Generated Group
Key Agreement Protocol Using Conjugacy Classes of Finitely Generated Group
This research presents a novel key agreement protocol leveraging the rich mathematical structure of conjugacy classes within groups. We propose a key agreement protocol based on fi...
The conjugacy problem for
$\operatorname {Out}(F_3)$
The conjugacy problem for
$\operatorname {Out}(F_3)$
AbstractWe present a solution to the conjugacy problem in the group of outer automorphisms of
$F_3$
, a free group of rank 3. We distinguish according to several computable invari...
Words with Intervening Neighbours in Infinite Coxeter Groups are Reduced
Words with Intervening Neighbours in Infinite Coxeter Groups are Reduced
Consider a graph with vertex set $S$. A word in the alphabet $S$ has the intervening neighbours property if any two occurrences of the same letter are separated by all its graph ne...
Polypositroids
Polypositroids
Abstract
We initiate the study of a class of polytopes, which we coin polypositroids, defined to be those polytopes that are simultaneously generalized permutohedra (or polymatr...
Combinatorial Cremona automorphisms and Coxeter arrangement matroids
Combinatorial Cremona automorphisms and Coxeter arrangement matroids
Abstract
We explore birational geometry of matroids by investigating automorphisms of their coarse Bergman fans. Combinatorial Cremona maps provide such automorphisms of ...