Related papers: SB-Labelings, Distributivity, and Bruhat Order on …

In this paper we introduce abstract string modules and give an explicit bijection between the submodule lattice of an abstract string module and the perfect matching lattice of the corresponding abstract snake graph. In particular, we make…

For a finite Coxeter system and a subset of its diagram nodes, we define spherical elements (a generalization of Coxeter elements). Conjecturally, for Weyl groups, spherical elements index Schubert varieties in a flag manifold G/B that are…

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…

In recent papers we have refined a conjecture of Lehrer and Solomon expressing the characters of a finite Coxeter group $W$ afforded by the homogeneous components of its Orlik-Solomon algebra as sums of characters induced from linear…

We introduce the annex of an element $x$ in a Coxeter group as the set of elements $y$ such that $x \nleq y$ with respect to Bruhat order. This notion provides a complementary perspective to the study of Bruhat intervals and their…

For two subsets S and T of a given lattice L, we define a relative distributive (modular) property over L, that underlies a large family including the usual class of distributive (modular) lattices. Our proposed class will be called…

The extended weak order on a Coxeter group $W$ is the poset of biclosed sets in its root system. In (Barkley-Speyer 2024), it was shown that when $W=\widetilde{S}_n$ is the affine symmetric group, then the extended weak order is a quotient…

Given a Coxeter system (W,S) equipped with an involutive automorphism T, the set of twisted identities is i(T) = {T(w)^{-1}w : w \in W}. We point out how i(T) shows up in several contexts and prove that if there is no s \in S such that…

In this article, we propose to initiate the general study of involution systems. An {\em involution system}, that is, a group $W$ generated by a set of involutions $S$, is naturally endowed with a {\em weak order} arising from orienting the…

Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets. This…

In this chapter, we trace the path from the Tamari lattice, via lattice congruences of the weak order, to the definition of Cambrian lattices in the context of finite Coxeter groups, and onward to the construction of Cambrian fans. We then…

The purpose of this article is to shed new light on the combinatorial structure of Kazhdan-Lusztig cells in infinite Coxeter groups $W$. Our main focus is the set $\D$ of distinguished involutions in $W$, which was introduced by Lusztig in…

We call a lattice crosscut-simplicial if the crosscut complex of every atomic interval is equal to the boundary of a simplex. Every interval of such a lattice is either contractible or homotopy equivalent to a sphere. Recently, Hersh and…

For L a finite lattice, let C(L) denote the set of pairs g = (g_0,g_1) such that g_0 is a lower cover of g_1 and order it as follows: g <= d iff g_0 <= d_0, g_1 <= d_1, but not g_1 <= d_0. Let C(L,g) denote the connected component of g in…

A finite poset (partially ordered set) $P$ with ${\hat 0}$ is called of distributive type if every interval $[{\hat 0}, a]$, $a \in P$, of $P$ is a distributive lattice. From a viewpoint of ASL's (algebras with straightening laws), the…

Let W be a Coxeter group with Coxeter generators S. The rank of the Coxeter system (W,S) is the cardinality |S| of S. The Coxeter system (W,S) has finite rank if and only if W is finitely generated. If (W,S) has infinite rank, then |S| =…

We define a natural lattice structure on all subsets of a finite root system that extends the weak order on the elements of the corresponding Coxeter group. For crystallographic root systems, we show that the subposet of this lattice…

In this article we provide a new finite class of elements in any Coxeter system (W,S) called low elements. They are defined from Brink and Howlett's small roots, which are strongly linked to the automatic structure of (W,S). Our first main…

Let $G$ be a reductive algebraic group and let $Z$ be the stabilizer of a nilpotent element $e$ of the Lie algebra of $G$. We consider the action of $Z$ on the flag variety of $G$, and we focus on the case where this action has a finite…

For any finite Coxeter system $(W,S)$ we construct a certain noncommutative algebra, so-called {\it bracket algebra}, together with a familiy of commuting elements, so-called {\it Dunkl elements.} Dunkl elements conjecturally generate an…