Related papers: Annexes in affine Coxeter complexes
I introduce a method to generate families of CSS codes with interesting code parameters. The object of study is Coxeter groups, both finite and infinite (reducible or not), and a geometrically motivated partial order of Coxeter group…
We lay the foundations of the first-order model theory of Coxeter groups. Firstly, with the exception of the $2$-spherical non-affine case (which we leave open), we characterize the superstable Coxeter groups of finite rank, which we show…
We show that any lower Bruhat interval in a Coxeter group is a disjoint union of certain two-sided cosets as a consequence of Lifting Property and Subword Property. Furthermore, we describe these details in terms of Bruhat graphs, graded…
In certain finite posets, the expected down-degree of their elements is the same whether computed with respect to either the uniform distribution or the distribution weighting an element by the number of maximal chains passing through it.…
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…
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…
We use geometry of Davis complex of a Coxeter group to prove the following result: if G is an infinite indecomposable Coxeter group and $H\subset G$ is a finite index reflection subgroup then the rank of H is not less than the rank of G.…
If the complement of a closed convex set in a closed convex cone is bounded, then this complement minus the apex of the cone is called a coconvex set. Coconvex sets appear in singularity theory (they are closely related to Newton diagrams)…
The boolean elements of a Coxeter group have been characterized and shown to possess many interesting properties and applications. Here we introduce "prism permutations," a generalization of those elements, characterizing the prism…
A Coxeter group admits infinite-dimensional irreducible complex representations if and only if it is not finite or affine. In this paper, we provide a construction of some of those representations for certain Coxeter groups using some…
We introduce the class of linearly shellable pure simplicial complexes. The characterizing property is the existence of a labeling of their vertices such that all linear extensions of the Bruhat order on the set of facets are shelling…
We give a criterion for a finitely generated odd-angled Coxeter group to have a proper finite index subgroup generated by reflections. The answer is given in terms of the least prime divisors of the exponents of the Coxeter relations.
Coxeter groups are equipped with a partial order known as the weak order, such that $u \leq v$ if the inversions of $u$ are a subset of the inversions of $v$. In finite Coxeter groups, weak order is a complete lattice, but in infinite…
There is a well-known classification of conjugacy classes of involutions in finite Coxeter groups, in terms of subsets of nodes of their Coxeter graphs. In many cases, the product of an involution with the longest element is again an…
We extend properties of the weak order on finite Coxeter groups to Weyl groupoids admitting a finite root system. In particular, we determine the topological structure of intervals with respect to weak order, and show that the set of…
The characterization of orbits of roots under the action of a Coxeter element is a fundamental tool in the study of finite root systems and their reflection groups. This paper develops the analogous tool in the affine setting, adding detail…
The deletion order of a finitely generated Coxeter group W is a total order on the elements which, as is proved, is a refinement of the Bruhat order. This order is applied in [8] to construct Elnitsky tilings for any finite Coxeter group.…
In this article, we establish some new combinatorial properties of cone types in Coxeter groups. Firstly, we show that for any element $x$ in a Coxeter group $W$ and root $\beta$ in its inversion set $\Phi(x)$, the set of elements $y \in W$…
We give a criterion for Bruhat order on noncrossing partitions corresponding to the Coxeter element $c=s_1 s_2\cdots s_n$. Using it we prove that the Bruhat order endows noncrossing partitions with a lattice structure. We then explain what…
An element of a Coxeter group $W$ is called fully commutative if any two of its reduced decompositions can be related by a series of transpositions of adjacent commuting generators. In the preprint "Fully commutative elements in finite and…