For right-angled Coxeter groups WΓ, we obtain a condition on Γ that is necessary and sufficient to ensure that WΓ is thick and thus not relatively hyperbolic. We show that Coxeter groups which are not thick all admit canonical minimal relatively hyperbolic structures; further, we show that in such a structure, the peripheral subgroups are both parabolic (in the Coxeter group-theoretic sense) an...

We study the exactness of certain combinatorially defined complexes which generalize the Orlik-Solomon algebra of a geometric lattice. The main results pertain to complex reflection arrangements and their restrictions. In particular, we consider the corresponding relation complexes and give a simple proof of the n-formality of these hyperplane arrangements. As an application, we are able to bou...

We generalize the brick polytope of V. Pilaud and F. Santos to spherical subword complexes for finite Coxeter groups. This construction provides polytopal realizations for a certain class of subword complexes containing all cluster complexes of finite types. For the latter, the brick polytopes turn out to coincide with the known realizations of generalized associahedra, thus opening new perspec...

Coxeter decompositions of hyperbolic simplices where studied in math.MG/0212010 and math.MG/0210067. In this paper we use the methods of these works to classify Coxeter decompositions of bounded convex pyramids and triangular prisms in the hyperbolic space IH.

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...

We generalize the brick polytope of V. Pilaud and F. Santos to spherical subword complexes for finite Coxeter groups. This construction provides polytopal realizations for a certain class of subword complexes containing all cluster complexes of finite types. For the latter, the brick polytopes turn out to coincide with the known realizations of generalized associahedra, thus opening new perspec...

Let W be a finite Coxeter group and X a subset of W . The length polynomial LW,X(t) is defined by LW,X(t) = ∑ x∈X t `(x), where ` is the length function on W . In this article we derive expressions for the length polynomial where X is any conjugacy class of involutions, or the set of all involutions, in any finite Coxeter group W . In particular, these results correct errors in [6] for the invo...

We establish recursions counting various classes of chains in the noncrossing partition lattice of a finite Coxeter group. The recursions specialize a general relation which is proven uniformly (i.e. without appealing to the classification of finite Coxeter groups) using basic facts about noncrossing partitions. We solve these recursions for each finite Coxeter group in the classification. Amon...

We describe a sufficient condition for graphs used in a construction of Thomassen (which yields hypohamiltonian graphs) to produce maximally non-hamiltonian (MNH) graphs as well. Then we show that the Coxeter graph fulfils this sufficient condition, and thus applying the Thomassen’s construction to multiple copies of the Coxeter graph yields infinitely many MNH graphs with girth 7. So far, the ...