Level-two Structure of Simply-laced Coxeter Groups
نویسنده
چکیده
Let X be a graph, with corresponding simply-laced Coxeter group W . Then W acts naturally on the lattice L spanned by the vertices of X, preserving a quadratic form. We give conditions on X for the form to be nonsingular modulo two, and study the images of W −→ O(L/2kL). Introduction — This paper investigates the tower of 2-power congruence subgroups in a simply-laced Coxeter group, but the story begins with a puzzle for children. We have a pile of stones, and a graph X with n vertices. At most one stone may be placed on a vertex, so a vertex has one of two states: stoned or unstoned. We move by selecting a vertex v having an odd number of stoned neighbors, and then change the state of v. Given an initial configuration of stones on X, we try to reduce the total number of stones as much as possible. How to determine this minimal number of stones from the initial configuration? A configuration of stones is an element in the F2-vector space V spanned by the vertices of X. For v ∈ V , let q(v) be the number of vertices plus the number of edges in the support of v, modulo two. Then q is a quadratic form on V (see section 1), and we let O(F2) denote the subgroup of GLn(F2) preserving q. The moves are linear maps on V preserving q, and are the images of simple reflections under the natural homomorphism
منابع مشابه
Braided Elements in Coxeter Groups , Ii
We continue the study of freely braided elements of simply laced Coxeter groups, which we introduced in a previous work. A known upper bound for the number of commutation classes of reduced expressions for an element of a simply laced Coxeter group is shown to be achieved only when the element is freely braided; this establishes the converse direction of a previous result. It is also shown that...
متن کاملOn the Maximally Clustered Elements of Coxeter Groups
We continue the study of the maximally clustered elements for simply laced Coxeter groups which were recently introduced by Losonczy. Such elements include as a special case the freely braided elements of Losonczy and the author, which in turn constitute a superset of the iji-avoiding elements of Fan. Our main result is to classify the MC-finite Coxeter groups, namely those Coxeter groups havin...
متن کاملMinimal and maximal elements in Kazhdan-Lusztig double sided cells of Sn and a Robinson-Schensted correspondance in simply laced Coxeter groups
Let W be a Coxeter group. We generalise the Knuth plactic relations to W and we show that their equivalence classes decompose the Kazhdan-Lusztig cells. In the case of symmetric groups, we show that the set of elements of minimal length in a double sided cell is the set of elements of maximal length in conjugated parabolic (i.e. Young) subgroups. We also give an interpretation of this set with ...
متن کاملCoxeter Covers of the Classical Coxeter Groups
Let C(T ) be a generalized Coxeter group, which has a natural map onto one of the classical Coxeter groups, either Bn or Dn. Let CY (T ) be a natural quotient of C(T ), and if C(T ) is simply-laced (which means all the relations between the generators has order 2 or 3), CY (T ) is a generalized Coxeter group, too . Let At,n be a group which contains t Abelian groups generated by n elements. The...
متن کاملBrauer Algebras of Simply Laced Type
The diagram algebra introduced by Brauer that describes the centralizer algebra of the n-fold tensor product of the natural representation of an orthogonal Lie group has a presentation by generators and relations that only depends on the path graph An−1 on n− 1 nodes. Here we describe an algebra depending on an arbitrary graph M , called the Brauer algebra of type M , and study its structure in...
متن کامل