Compression of root systems and the E-sequence
From MaRDI portal
Compression of root systems and the \(E\)-sequence
Abstract: We examine certain maps from root systems to vector spaces over finite fields. By choosing appropriate bases, the images of these maps can turn out to have nice combinatorial properties, which reflect the structure of the underlying root system. The main examples are E_6 and E_7.
Summary: We examine certain maps from root systems to vector spaces over finite fields. By choosing appropriate bases, the images of these maps can turn out to have nice combinatorial properties, which reflect the structure of the underlying root system. The main examples are \(E_6\) and \(E_7\).
Recommendations
Cited in
(6)- Non-gatherable triples for non-affine root systems
- Root systems, affine subspaces, and projections
- Fusion rings of loop group representations
- Entanglement can increase asymptotic rates of zero-error classical communication over classical channels
- Surjective Linear Maps Between Root Systems with Zero
- Root systems in Lie theory: from the classic definition to nowadays
This page was built for publication: Compression of root systems and the \(E\)-sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010849)