Simply-laced Coxeter groups and groups generated by symplectic transvections

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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…