Related papers: Sortable elements and Cambrian lattices

$W$-algebras are certain algebraic structures associated to a finite dimensional Lie algebra $\mathfrak g$ and a nilpotent element $f$ via Hamiltonian reduction. In this note we give a review of a recent approach to the study of (classical…

We present a relatively simple description of binary, definable subsets of models of weakly quasi-o-minimal theories. In particular, we closely describe definable linear orders and prove a weak version of the monotonicity theorem. We also…

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…

Every reduced ring $R$ has a natural partial order defined by $a\le b$ if $a^2=ab$; it generalizes the natural order on a boolean ring. The article examines when $R$ is a lower semi-lattice in this order with examples drawn from weakly Baer…

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| =…

The set of permutations on a finite set can be given the lattice structure known as the weak Bruhat order. This lattice structure is generalized to the set of words on a fixed alphabet $\Sigma$ = {x,y,z,...}, where each letter has a fixed…

The sets of all neutral, distributive and lower-modular elements of the lattice of semigroup varieties are finite, countably infinite and uncountably infinite, respectively. In 2018, we established that there are precisely three neutral…

In this paper, we decompose the set of fully commutative elements into natural subsets when the Coxeter group is of type $D_n$, and study the combinatorics of these subsets, revealing hidden structures. (We do not consider type $A_n$ first,…

We denote by Conc(A) the semilattice of all finitely generated congruences of an (universal) algebra A, and we define Conc(V) as the class of all isomorphic copies of all Conc(A), for A in V, for any variety V of algebras. Let V and W be…

We show the uniqueness and existence of the Euler form for a simply-laced generalized root system. This enables us to show that the Coxeter element for a simply-laced generalized root system is admissible in the sense of R.~W.~Carter. As an…

We introduce new class of limitedly L-weakly compact operators from a Banach space to a Banach lattice. This class is a proper subclass of the Bourgain-Diestel operators and it contains properly the class of L-weakly compact operators. We…

The paper presents geometric models for the set WO of weak orders on a finite set. In particulary, WO is modeled as a set of vertices of a cubical subdivision of a permutahedron. This approach is an alternative to the usual representation…

A lattice-ordered group (an $\ell$-group) $G(\oplus, \vee, \wedge)$ can be naturally viewed as a semiring $G(\vee,\oplus)$. We give a full classification of (abelian) $\ell$-groups which are finitely generated as semirings, by first showing…

There is an ``algebraisation'' of the notion of weak factorisation system (w.f.s.) known as a natural weak factorisation system. In it, the two classes of maps of a w.f.s. are replaced by two categories of maps-with-structure, where the…

For a finite distributive lattice $D$, let us call $Q \subseteq D$ \emph{principal congruence representable}, if there is a finite lattice $L$ such that the congruence lattice of $L$ is isomorphic to $D$ and the principal congruences of $L$…

An element w of a Coxeter group W is said to be fully commutative, if any reduced expression of w can be obtained from any other by transposing adjacent pairs of generators. These elements were described in 1996 by Stembridge in the case of…

In this paper we investigate the endomorphism algebras of standard cluster tilting objects in the stably 2-Calabi-Yau categories $\Sub{\Lambda_w}$ with elements $w$ in Coxeter groups in \cite{BIRSc}. They are examples of the 2-Auslander…

In this paper we consider arbitrary intervals in the left weak order on the symmetric group $S_n$. We show that the Lehmer codes of permutations in an interval form a distributive lattice under the product order. Furthermore, the…

It is shown that there is an order isomorphism $\phi'$ from the poset $V$ of $B\times B$-orbits on the wonderful compactification of a semi-simple adjoint group $G$ with Weyl group $W$ to an interval in reverse Chevalley-Bruhat order on a…

Dilworth's theorem. Every finite distributive lattice $D$ can be represented as the congruence lattice of a finite lattice $L$. We want: Every finite distributive lattice $D$ can be represented as the congruence lattice of a nice finite…