Simply laced Coxeter groups and groups generated by symplectic transvections
From MaRDI portal
Publication:5954576
Abstract: Let W be an arbitrary Coxeter group of simply-laced type (possibly infinite but of finite rank), u,v be any two elements in W, and i be a reduced word (of length m) for the pair (u,v) in the Coxeter group W imes W. We associate to i a subgroup Gamma_i in GL_m(Z) generated by symplectic transvections. We prove among other things that the subgroups corresponding to different reduced words for the same pair (u,v) are conjugate to each other inside GL_m(Z). We also generalize the enumeration result of the first three authors (see AG/9802093) by showing that, under certain assumptions on u and v, the number of Gamma_i(F_2)-orbits in F_2^m is equal to 3 imes 2^s, where s is the number of simple reflections that appear in a reduced decomposition for u or v and F_2 is the two-element field.
Recommendations
Cited in
(9)- Cluster algebras and Weil-Petersson forms
- In memoriam: Andrei Zelevinsky (1953--2013)
- Cluster algebras. I: Foundations
- Polyhedral parametrizations of canonical bases \& cluster duality
- Orbits of groups generated by transvections over \(\mathbb{F}_2\).
- Cluster algebras. III: Upper bounds and double Bruhat cells.
- The number of connected components in double Bruhat cells for nonsimply-laced groups
- scientific article; zbMATH DE number 1556908 (Why is no real title available?)
- The quantum dilogarithm and representations of quantum cluster varieties
This page was built for publication: Simply laced Coxeter groups and groups generated by symplectic transvections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5954576)