Coxeter Notation¶
A convention-bound bracket syntax that compresses the labeled relations of a chosen Coxeter system, especially a string Coxeter diagram, into a compact group symbol.
Core Idea¶
Coxeter notation, also called a Coxeter symbol, is a compact conventional syntax for recording relation data from a chosen Coxeter system. A Coxeter system is a group (W) together with distinguished involutive generators \(S=\{s_0,\ldots,s_{n-1}\}\), subject to relations
where (m_{ii}=1), each off-diagonal \(m_{ij}=m_{ji}\ge 2\), and \(m_{ij}=\infty\) means that no finite product-order relation is imposed. These integers form a Coxeter matrix and can be displayed as a labeled Coxeter graph. The notation replaces that larger presentation or graph with brackets and a disciplined set of layout conventions.
Scope of Application¶
The home domain is Coxeter-group and reflection-group theory. In finite reflection geometry, bracket symbols provide concise names for the symmetry groups of regular polytopes and related configurations. In Euclidean and hyperbolic geometry, they label reflection groups associated with simplex chambers, tessellations, and honeycombs. In abstract-polytope theory, a regular polytope of type \(\{p_1,\ldots,p_{n-1}\}\) has a distinguished string group whose adjacent products have those same orders; brackets distinguish the group from the polytope type.
Clarity¶
A reader can test a purported Coxeter symbol with the following procedure:
- Identify the distinguished generators and count the diagram nodes. 2. Determine the diagram topology: path, branch, cycle, or another declared form. 3. Expand exponent or repetition abbreviations. 4. Map every visible numerical entry to a pair of nodes and set the corresponding product order (m_{ij}). 5. Apply the suppression rule, normally taking unconnected pairs to have order 2.
Manages Complexity¶
A full Coxeter matrix for rank (n) has (n^2) entries, although symmetry and fixed diagonal values reduce its independent information. A diagram suppresses the ubiquitous (m_{ij}=2) relations. A string symbol compresses further: topology is supplied by the linear convention, so only the (n-1) adjacent product orders must be written.
Abstract Reasoning¶
The symbol licenses exact inferences once its grammar is fixed. From \([p,q]\), one can infer three involutive distinguished generators, the two adjacent braid/product orders, and commutation of the nonadjacent pair. One can write the standard presentation immediately and construct the labeled string diagram.
In a geometric reflection realization, one can infer fundamental mirror angles \(\pi/p\), \(\pi/q\), and \(\pi/2\) for the nonadjacent pair.
Knowledge Transfer¶
Within its home domain, the notation transfers unusually well. The same string grammar connects group presentations, labeled diagrams, chambers bounded by mirrors, regular-polytope symmetries, and tessellation tables. The bracket symbol acts as an interface between algebraic and geometric descriptions because product orders translate into mirror angles in the standard reflection model.
Across domains, the transferable core is not the particular brackets but the pattern of conventional symbolic representation: omit default relations, linearize a topology, preserve exceptional parameters, and make reconstruction conditional on a shared grammar.
Relationships to Other Abstractions¶
Current abstraction Coxeter Notation Domain-specific
Parents (1) — more general patterns this builds on
-
Coxeter Notation is a kind of Symbolic Representation Prime
The minimal prospective parent is Symbolic Representation.
Hierarchy path (1) — routes to 1 parentless root
- Coxeter Notation → Symbolic Representation → Representation → Abstraction
Neighborhood in Abstraction Space¶
Coxeter Notation sits in a sparse region of the domain-specific corpus (81st 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 Element — 0.83
- Prime Graph — 0.82
- Temperley–Lieb Algebra — 0.82
- Power-System Automation — 0.82
- Principal Value — 0.81
Computed from structural-signature embeddings · 2026-09-08