Simply-laced Coxeter groups and groups generated by symplectic transvections
Boris Shapiro, Michael Shapiro, Alek Vainshtein, Andrei Zelevinsky
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× W. We associate to i a subgroup Gammai in GLm(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 GLm(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 Gammai(F2)-orbits in F2m is equal to 3× 2s, where s is the number of simple reflections that appear in a reduced decomposition for u or v and F2 is the two-element field.
Create a lesson
Related papers
Morphism spaces on low degree hypersurfaces
Hrishabh Mishra
Connecting families of curves
Nathan Chen, Robert Lazarsfeld, Federico Moretti
The Last Picard Rank 1 Double-Mirror Calabi-Yau Pair?
Michał Kapustka, Marco Rampazzo, Prajwal Samal
Conductor-Discriminant Inequality for Tamely Ramified Cyclic Covers II
Connor Stewart
The Hurwitz existence problem in prime degree
Jijian Song, Hailin Wen, Zebao Zhang
Conductor-Discriminant Inequality for Tamely Ramified Cyclic Covers I
Andrew Obus, Padmavathi Srinivasan, Connor Stewart