Related papers: Depth in classical Coexter groups

We construct a method by which we can calculate the precision with which an algorithm identifies the shape of a cluster. We present our results for several well known clustering algorithms and suggest ways to improve performance for newer…

Let $\mathcal{W}$ be the set of strongly real elements of $W$, a Coxeter group. Then for $w \in \mathcal{W}$, $e(w)$, the excess of $w$, is defined by $e(w) = \min\{\ell(x) + \ell(y) - \ell(w) \; | \; w=xy, x^2 = y^2 = 1\}$. When $W$ is…

Ehrhart theory measures a polytope P discretely by counting the lattice points inside its dilates P, 2P, 3P, .... We compute the Ehrhart quasipolynomials of the standard Coxeter permutahedra for the classical Coxeter groups, expressing them…

In this chapter, we give an overview of Billey-Postnikov (BP) decompositions which have become an important tool for understanding the geometry and combinatorics of Schubert varieties. BP decompositions are factorizations of Coxeter group…

Coupled length and time scales determine the dynamic behavior of polymers and underlie their unique viscoelastic properties. To resolve the long-time dynamics it is imperative to determine which time and length scales must be correctly…

There has been recent interest in novel Clifford geometric invariants of linear transformations. This motivates the investigation of such invariants for a certain type of geometric transformation of interest in the context of root systems,…

The Temperley--Lieb algebra is a finite dimensional associative algebra that arose in the context of statistical mechanics and occurs naturally as a quotient of the Hecke algebra arising from a Coxeter group of type $A$. It is often…

We construct and study polyhedral product models for classifying spaces of right-angled Artin and Coxeter groups, general graph product groups and their commutator subgroups. By way of application, we give a criterion of freeness for the…

We study coherence of graph products and Coxeter groups and obtain many results in this direction.

We refine a conjecture by Lehrer and Solomon on the structure of the Orlik-Solomon algebra of a finite Coxeter group $W$ and relate it to the descent algebra of $W$. As a result, we claim that both the group algebra of $W$, as well as the…

For a finite Coxeter group $W$ and $w$ an element of $W$ the `excess' of $w$ is defined to be $e(w) = \min\{\ell(x) + \ell(y) - \ell(w) \; | \; w=xy, \; x^2 = y^2 = 1\}$ where $\ell$ is the length function on $W$. Here we investigate the…

We explore the Borel complexity of some basic families of subsets of a countable group (large, small, thin, sparse and other) defined by the size of their elements. Applying the obtained results to the Stone-\v{C}ech compactification $\beta…

Brink and Howlett have introduced a partial ordering, called dominance, on the positive roots in the Tits realization of Coxeter groups (Math. Ann. 296 (1993), 179--190). Recently a concept called $\infty$-height is introduced to each…

We study the appearance of notable interval structures -- lattices, modular lattices, distributive lattices, and boolean lattices -- in both the Bruhat and weak orders of Coxeter groups. We collect and expand upon known results for…

Folding subgroups give a way to realize non-simply-laced Coxeter groups as subgroups of simply-laced Coxeter groups. In this paper, we study how folding subgroups of finite and affine type are distributed length-wise by calculating the…

We study the minimal length elements in some double cosets of Coxeter groups and use them to study Lusztig's $G$-stable pieces and the generalization of $G$-stable pieces introduced by Lu and Yakimov. We also use them to study the minimal…

We investigate small $p$-groups with cohomology rings of depth higher than predicted by Duflot's theorem. In these groups, a sampling would suggest several naive conjectures about the degrees of the additional regular sequence elements. We…

For a connected Noetherian unstable algebra $R$ over the mod $p$ Steenrod algebra, we prove versions of theorems of Duflot and Carlson on the depth of $R$, originally proved when $R$ is the mod $p$ cohomology ring of a finite group. This…

The tree-depth is a parameter introduced under several names as a measure of sparsity of a graph. We compute asymptotic values of the tree-depth of random graphs. For dense graphs, p>> 1/n, the tree-depth of a random graph G is a.a.s.…

In one of his papers on the weak order of Coxeter groups, Dyer formulates several conjectures. Among these, one affirms that the extended weak order forms a lattice, while another offers an algebraic-geometric description of the join of two…