Generated Coxeter Group Research Articles

Shortcut graphs and groups

We introduce shortcut graphs and groups. Shortcut graphs are graphs in which cycles cannot embed without metric distortion. Shortcut groups are groups which act properly and cocompactly on shortcut graphs. These notions unify a surprisingly broad family of graphs and groups of interest in geometric group theory and metric graph theory, including: the 1-skeletons of systolic and quadric complexes (in particular finitely presented C(6) and C(4)-T(4) small cancellation groups), 1-skeletons of finite dimensional CAT(0) cube complexes, hyperbolic graphs, standard Cayley graphs of finitely generated Coxeter groups and the standard Cayley graph of the Baumslag-Solitar group BS(1,2). Most of these examples satisfy a strong form of the shortcut property. The shortcut properties also have important geometric group theoretic consequences. We show that shortcut groups are finitely presented and have exponential isoperimetric and isodiametric functions. We show that groups satisfying the strong form of the shortcut property have polynomial isoperimetric and isodiametric functions.

The low-dimensional homology of finite-rank Coxeter groups

We give formulas for the second and third integral homology of an arbitrary finitely generated Coxeter group, solely in terms of the corresponding Coxeter diagram. The first of these calculations refines a theorem of Howlett, while the second is entirely new and is the first explicit formula for the third homology of an arbitrary Coxeter group.

Random coxeter groups

Much is known about random right-angled Coxeter groups (i.e., right-angled Coxeter groups whose defining graphs are random graphs under the Erdös–Rényi model). In this paper, we extend this model to study random general Coxeter groups and give some results about random Coxeter groups, including some information about the homology of the nerve of a random Coxeter group and results about when random Coxeter groups are [Formula: see text]-hyperbolic and when they have the FC-type property.

Locally finite continuations and Coxeter groups of infinite ranks

An involution r in a Coxeter group W is called an intrinsic reflection of W if r∈SW for each Coxeter generating set S of W. In recent joint work with R.B. Howlett [13] we determined all intrinsic reflections in finitely generated Coxeter groups. In the present paper we extend this result to the infinite rank case. An important tool in [13] is the notion of the finite continuation of an involution that is only meaningful for finitely generated Coxeter groups. Here we introduce the locally finite continuation for any subset of an arbitrary group which enables us to deal with Coxeter groups of infinite rank. We apply our result to show that certain classes of Coxeter groups are reflection independent and we investigate rigidity of 2-spherical Coxeter systems of arbitrary ranks.

Jucys-Murphy elements for Soergel bimodules

We produce Jucys-Murphy elements for the diagrammatical category of Soergel bimodules associated with general Coxeter groups, and use them to diagonalize the bilinear form on the cell modules. This gives rise to an expression for the determinant of the forms and Jantzen type sum formulas.

Imaginary cone and reflection subgroups of Coxeter groups

The imaginary cone of a Kac-Moody Lie algebra is the convex hull of zero and the positive imaginary roots. This paper studies the imaginary cone for a class of root systems of general Coxeter groups W. It is shown that the imaginary cone of a reflection subgroup of W is contained in that of W, and that for irreducible infinite W of finite rank, the closed imaginary cone is the only non-zero, closed, pointed W-stable cone contained in the pointed cone spanned by the simple roots. For W of finite rank, various natural notions of faces of the imaginary cone are shown to coincide, the face lattice is explicitly described in terms of the lattice of facial reflection subgroups and it is shown that the Tits cone and imaginary cone are related by a duality closely analogous to the standard duality for polyhedral cones, even though neither of them is a closed cone in general. Some of these results have application, to be given in sequels to this paper, to dominance order of Coxeter groups, associated automata, and construction of modules for generic Iwahori-Hecke algebras.

О НОРМАЛИЗАТОРАХ В НЕКОТОРЫХ ГРУППАХ КОКСТЕРА

Let G be a finitely generated Coxeter group with presentation G =< a1, . . . , an; (aiaj ) mij = 1, i, j = 1, n >, where mij — are the elements of the symmetric Coxeter matrix: ∀i, j ∈ 1, n, mii = 1, mij ≥ 2, i 6= j. If mij ≥ 3(mij > 3), i 6= j, then G is a Coxeter group of large (extra-large) type. These groups introduced by K. Appel and P. Schupp. If the group G corresponds to a finite tree-graph Γ such that if the vertices of some edge e of the graph Γ correspond to generators ai , aj , then the edge e corresponds to the ratio of the species (aiaj ) mij = 1, then G is a Coxeter group with a tree-structure. Coxeter groups with a tree-structure introduced by V. N. Bezverkhnii, algorithmic problems in them was considered by V. N. Bezverkhnii and O. V. Inchenko. The group G can be represented as tree product 2-generated of Coxeter groups, amalgamated by cyclic subgroups. Thus from the graph Γ of G will move to the graph Γ in the following way: the vertices of the graph Γ we will put in line Coxeter group on two generators Gij =< ai , aj ; a 2 i = a 2 j = 1,(aiaj ) mij = 1 > and Gjk =< aj , ak; a 2 j = a 2 k = 1,(ajak) mjk = 1 >, to every edge e joining the vertices corresponding to Gij and Gjk is a cyclic subgroup < aj ; a 2 j = 1 >. In this paper we prove the following theorem: normalizer of finitely generated subgroup of Coxeter group with tree-structure G = Gij∗Gjk, Gij =< ai , aj ; a 2 i = a 2 j = 1,(aiaj ) mij = 1 >, Gjk =< aj , ak; a 2 j = a 2 k = 1,(ajak) mjk = 1 > finitely generated and exist algorithm for generating.

The Euler characteristic of a Hecke algebra

It is shown that the Euler characteristic χ(H,B,εq) of a Z〚q〛-Hecke algebra H associated with a finitely generated Coxeter group (W,S) coincides with p(W,S)(q)−1, where p(W,S)(t) is the Poincaré series of (W,S).

Strong accessibility of Coxeter groups over minimal splittings

Given a class of groups C , a group G is strongly accessible over C if there is a bound on the number of terms in a sequence Λ 1 , Λ 2 , … , Λ n of graph of groups decompositions of G with edge groups in C such that Λ 1 is the trivial decomposition (with 1-vertex) and for i > 1 , Λ i is obtained from Λ i − 1 by non-trivially and compatibly splitting a vertex group of Λ i − 1 over a group in C , replacing this vertex group by the splitting and then reducing. If H and K are subgroups of a group G then H is smaller than K if H ∩ K has finite index in H and infinite index in K . The minimal splitting subgroups of G , are the subgroups H of G , such that G splits non-trivially (as an amalgamated product or HNN-extension) over H and for any other splitting subgroup K of W , K is not smaller than H . When G is a finitely generated Coxeter group, minimal splitting subgroups are always finitely generated. Minimal splittings are explicitly or implicitly important aspects of Dunwoody’s work on accessibility and the JSJ results of Rips–Sela, Dunwoody–Sageev and Mihalik. Our main results are that Coxeter groups are strongly accessible over minimal splittings and if Λ is an irreducible graph of groups decomposition of a Coxeter group with minimal splitting edge groups, then the vertex and edge groups of Λ are Coxeter.

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 main result in this paper is that CY(T) is isomorphic to At,n ⋊ Bn or At,n ⋊ Dn, depends on whether the signed graph T contains loops or not, or in other words C(T) is simply-laced or not, and t is the number of the cycles in T. This result extends the results of Rowen, Teicher and Vishne to generalized Coxeter groups which have a natural map onto one of the classical Coxeter groups.

Twist-rigid Coxeter groups

We prove that two angle-compatible Coxeter generating sets of a given finitely generated Coxeter group are conjugate provided one of them does not admit any elementary twist. This confirms a basic case of a general conjecture which describes a potential solution to the isomorphism problem for Coxeter groups.

On dominance and minuscule Weyl group elements

Fix a Dynkin graph and let λ be a coweight. When does there exist an element w of the corresponding Weyl group such that w is λ-minuscule and w(λ) is dominant? We answer this question for general Coxeter groups. We express and prove these results using a variant of Mozes’ game of numbers.

Coxeter groups are virtually special

In this paper we prove that every finitely generated Coxeter group has a finite index subgroup that is the fundamental group of a special cube complex. Some consequences include: Every f.g. Coxeter group is virtually a subgroup of a right-angled Coxeter group. Every word-hyperbolic Coxeter group has separable quasiconvex subgroups.

Symmetric generation of Coxeter groups

We provide involutory symmetric generating sets of finitely generated Coxeter groups, fulfilling a suitable finiteness condition, which in particular is fulfilled in the finite, affine and compact hyperbolic cases.

Continuous crystal and Duistermaat–Heckman measure for Coxeter groups

We introduce a notion of continuous crystal analogous, for general Coxeter groups, to the combinatorial crystals introduced by Kashiwara in representation theory of Lie algebras. We explore their main properties in the case of finite Coxeter groups, where we use a generalization of the Littelmann path model to show the existence of the crystals. We introduce a remarkable measure, analogous to the Duistermaat–Heckman measure, which we interpret in terms of Brownian motion. We also show that the Littelmann path operators can be derived from simple considerations on Sturm–Liouville equations.

Visual decompositions of Coxeter groups

A Coxeter system is an ordered pair (W,S) where S is the generating set in a particular type of presentation for the Coxeter group W. A subgroup of W is called special if it is generated by a subset of S. Amalgamated product decompositions of a Coxeter group having special factors and special amalgamated subgroup are easily recognized from the presentation of the Coxeter group. If a Coxeter group is a subgroup of the fundamental group of a given graph of groups, then the Coxeter group is also the fundamental group of a graph of special subgroups, where each vertex and edge group is a subgroup of a conjugate of a vertex or edge group of the given graph of groups. A vertex group of an arbitrary graph of groups decomposition of a Coxeter group is shown to split into parts conjugate to special groups and parts that are subgroups of edge groups of the given decomposition. Several applications of the main theorem are produced, including the classification of maximal FA subgroups of a finitely generated Coxeter group as all conjugates of certain special subgroups.

Deodhar Elements in Kazhdan-Lusztig Theory

The Kazhdan-Lusztig polynomials for finite Weyl groups arise in representation theory as well as the geometry of Schubert varieties. It was proved very soon after their introduction that they have nonnegative integer coefficients, but no simple all positive interpretation for them is known in general. Deodhar has given a framework, which generally involves recursion, to express the Kazhdan-Lusztig polynomials in a very attractive form. We use a new kind of pattern-avoidance that can be defined for general Coxeter groups to characterize when Deodhar's algorithm yields a non-recursive combinatorial formula for Kazhdan-Lusztig polynomials $P_{x,w}(q)$ of finite Weyl groups. This generalizes results of Billey-Warrington which identified the $321$-hexagon-avoiding permutations, and Fan-Green which identified the fully-tight Coxeter groups. We also show that the leading coefficient known as $\mu (x,w)$ for these Kazhdan―Lusztig polynomials is always either $0$ or $1$. Finally, we generalize the simple combinatorial formula for the Kazhdan―Lusztig polynomials of the $321$-hexagon-avoiding permutations to the case when $w$ is hexagon avoiding and maximally clustered. Les polynômes de Kazhdan-Lusztig $P_{x,w}(q)$ des groupes de Weyl finis apparaissent en théorie des représentations, ainsi qu’en géométrie des variétés de Schubert. Il a été démontré peu après leur introduction qu’ils avaient des coefficients entiers positifs, mais on ne connaît toujours pas d’interprétation combinatoire simple de cette propriété dans le cas général. Deodhar a proposé un cadre donnant un algorithme, en général récursif, calculant des formules attractives pour les polynômes de Kazhdan-Lusztig. Billey-Warrington ont démontré que cet algorithme est non récursif lorsque$w$ évite les hexagones et les $321$ et qu’il donne des formules combinatoires simples. Nous introduisons une notion d’évitement de schémas dansles groupes de Coxeter quelconques nous permettant de généraliser les résultats de Billey-Warrington à tout groupe de Weyl fini. Nous montrons que le coefficient de tête $\mu (x,w)$ de ces polynômes de Kazhdan-Lusztig est toujours $0$ ou $1$. Cela généralise aussi des résultats de Fan-Greenqui identifient les groupes de Coxeter complètement serrés. Enfin, en type $A$, nous obtenons une classe plus large de permutations évitant la récursion.

Embedded Factor Patterns for Deodhar Elements in Kazhdan-Lusztig Theory

The Kazhdan-Lusztig polynomials for nite Weyl groups arise in the geometry of Schubert varieties and representation theory. It was proved very soon after their introduction that they have nonnegative integer coefcients, but no simple all positive interpretation for them is known in general. Deodhar (16) has given a framework for computing the Kazhdan-Lusztig polynomials which generally involves recursion. We dene embedded factor pattern avoidance for general Coxeter groups and use it to characterize when Deodhar's algorithm yields a simple combinatorial formula for the Kazhdan-Lusztig polynomials of nite Weyl groups. Equivalently, if (W; S) is a Coxeter system for a nite Weyl group, we classify the elements w 2 W for which the Kazhdan-Lusztig basis element C 0 can be written as a monomial of C 0 where s 2 S. This work generalizes results of Billey-Warrington (8) that identied the Deodhar elements in type A as 321-hexagon-avoiding permutations, and Fan-Green (18) that identied the fully-tight Coxeter groups.

Matching theorems for systems of a finitely generated Coxeter group

In this paper we prove a series of matching theorems for two sets of Coxeter generators of a finitely generated Coxeter group that identify common features of the two sets of generators. As an application, we describe an algorithm for finding a set of Coxeter generators of maximum rank for a finitely generated Coxeter group.

Almost central involutions in split extensions of Coxeter groups by graph automorphisms

In this paper, given a split extension of an arbitrary Coxeter group by automorphisms of the Coxeter graph, we determine the involutions in that extension whose centralizer has finite index. Our result has applications to many problems such as the isomorphism problem of general Coxeter groups. In the argument, some properties of certain special elements and of the fixed-point subgroups by graph automorphisms in Coxeter groups, which are of independent interest, are also given.