Coxeter Element

A product containing each simple reflection of a Coxeter system exactly once, organizing conjugacy, order, spectrum, and reflection geometry.

Version

v2 · 2026-09-06 · History

Domain-specific #

1577

Origin domain

group theory

Subdomain

coxeter groups

Core Idea

Let \((W,S)\) be a finite-rank Coxeter system, with distinguished simple reflections \(S=\{s_1,\ldots,s_n\}\). A Coxeter element is a group element represented by a product

\[ c=s_{\pi(1)}s_{\pi(2)}\cdots s_{\pi(n)}, \]

where \(\pi\) orders the generators and every simple reflection occurs exactly once. The order matters: different words can represent different elements. Commuting nonadjacent generators can yield the same element, and cyclically moving the first generator to the end conjugates the element.

Scope of Application

Coxeter elements organize finite real reflection groups, Weyl groups, root systems, regular-polytope symmetry, Lie theory, and algebraic combinatorics. Their order supplies the Coxeter number; their eigenvalues encode exponents; their plane provides symmetric projections of roots and polytopes; and their orientations connect group elements to quivers, chip firing, and sortable combinatorics.

The construction also exists in infinite Coxeter groups of finite rank. The word definition survives exactly, but order, conjugacy, spectrum, and geometric conclusions must be restated. An infinite irreducible group typically has infinite-order Coxeter elements, and cyclic Coxeter graphs can support several conjugacy classes.

Clarity

The element depends on the Coxeter system, not only the abstract group. A group may admit different distinguished simple systems. “Each reflection once” means each simple reflection in the chosen \(S\), not every reflection in the group; the full reflection set consists of conjugates and is usually much larger.

Manages Complexity

One short word samples the whole simple generating system. Rather than analyze all group elements, one obtains a distinguished conjugacy class whose order and eigenvalues reflect global type data. In finite irreducible type, \(h\) connects root counts, invariant degrees, and rotational geometry.

The graph-orientation encoding compresses factorially many orderings. Swapping commuting generators leaves the orientation and element unchanged. A source-to-sink move corresponds to cyclic rotation and conjugation.

Abstract Reasoning

If \(c=s_1s_2\cdots s_n\), then

\[ s_1cs_1=s_2s_3\cdots s_ns_1, \]

because \(s_1^2=1\). Thus cyclic rotation of a Coxeter word is conjugation. Legal commutations preserve the represented element. These moves explain why source-to-sink changes in the oriented graph track conjugacy.

In finite irreducible rank \(n\), let the invariant degrees be \(d_1,\ldots,d_n\), exponents \(m_i=d_i-1\), and Coxeter number \(h=d_n\) under conventional ordering.

Knowledge Transfer

Literal transfer occurs across finite Coxeter types because the same system, once-each word, conjugacy, order, and reflection-action roles recur. Symmetric, dihedral, crystallographic, and exceptional groups change the diagram and numerical data but not the construction.

Transfer to quiver orientations retains the graph orientation and source-to-sink moves, while representation-theoretic Coxeter transformations may add categorical or linear-algebraic structure. They are related uses, not automatic synonyms.

Relationships to Other Abstractions

Current abstraction Coxeter Element Domain-specific

Parents (1) — more general patterns this builds on

• Coxeter Element is part of Group Prime

  prime:group is the minimal parent because a Coxeter element is a distinguished element inside a group, defined through its generators, product, order, and conjugacy.

Hierarchy paths (5) — routes to 5 parentless roots

• Coxeter Element → Group → Monoid → Semigroup → Set and Membership

Show alternative paths (4)

Neighborhood in Abstraction Space

Coxeter Element sits in a sparse region of the domain-specific corpus (93^rd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

• Coxeter Notation — 0.83
• Baxter Permutation — 0.79
• Ring — 0.77
• Zero-Sum Problem — 0.77
• Post Canonical System — 0.77

Computed from structural-signature embeddings · 2026-09-08