Stability of stretched root systems, root posets and shards
Summary: Inspired by the infinite families of finite and affine root systems, we define a ``stretching operation on general crystallographic root systems which, on the level of Coxeter diagrams, replaces a vertex with a path of unlabeled edges. We embed a root system into its stretched versions using a similar operation on individual roots. For a fixed root, we describe the long-term behavior of two associated structures as we lengthen the stretched path: the downset in the root poset and Reading's arrangement of shards. We show that both eventually admit a uniform description, and deduce enumerative consequences: the size of the downset is eventually a polynomial, and the number of shards grows exponentially.
- Characteristic polynomials of subspace arrangements and finite fields
- Combinatorics of Coxeter Groups
- Expansions of abelian categories
- Finite Coxeter groups and the weak order
- Generalized noncrossing partitions and combinatorics of Coxeter groups
- Homological stability for families of Coxeter groups
- Lattice theory of the poset of regions
- Sortable elements and Cambrian lattices.
- Spherical subcategories in representation theory
- Stability, shards, and preprojective algebras
This page was built for publication: Stability of stretched root systems, root posets and shards
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2049612)