相关论文: Lattice congruences of the weak order

When W is a finite Coxeter group of classical type (A, B, or D), noncrossing partitions associated to W and compatibility of almost positive roots in the associated root system are known to be modeled by certain planar diagrams. We show how…

In this paper, we study the maximal chains of lattices which generalizes both the weak order and the Tamari lattice: certain lattices of maximal tubings. A maximal tubing poset $\mathfrak{L}(G)$ is defined for any graph $G$, but for the…

The set of weights of a finite-dimensional representation of a reductive Lie algebra has a natural poset structure ("weight poset"). Studying certain combinatorial problems related to antichains in weight posets, we realised that the best…

Oshima's Lemma describes the orbits of parabolic subgroups of irreducible finite Weyl groups on crystallographic root systems. This note generalises that result to all root systems of finite Coxeter groups, and provides a self contained…

For a closure space (P,f) with f(\emptyset)=\emptyset, the closures of open subsets of P, called the regular closed subsets, form an ortholattice Reg(P,f), extending the poset Clop(P,f) of all clopen subsets. If (P,f) is a finite convex…

Given an arbitrary Coxeter system $(W,S)$ and a nonnegative integer $m$, the $m$-Shi arrangement of $(W,S)$ is a subarrangement of the Coxeter hyperplane arrangement of $(W,S)$. The classical Shi arrangement ($m=0$) was introduced in the…

After the investigation of the congruent and non-congruent hyperball packings related to doubly truncated Coxeter orthoscheme tilings \cite{SzJ1}, we consider the corresponding covering problems. In \cite{MSSz} the authors gave a partial…

We consider the integer points in a unimodular cone K ordered by a lexicographic rule defined by a lattice basis. To each integer point x in K we associate a family of inequalities (lex-cuts) that defines the convex hull of the integer…

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…

The collection CL(T) of nonempty convex sublattices of a lattice T ordered by bi-domination is a lattice. We say that T has the fixed point property for convex sublattices (CLFPP for short) if every order preserving map f from T to CL(T)…

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…

A careful study is made of embeddings of posets which have a convex range. We observe that such embeddings share nice properties with the homomorphisms of more restrictive categories; for example, we show that every order embedding between…

In this paper, we give a class of reflection rigid Coxeter systems. Let $(W,S)$ be a Coxeter system. Suppose that (1) for each $s,t\in S$ such that $m(s,t)$ is odd, $\{s,t\}$ is a maximal spherical subset of $S$, (2) there does not exist a…

Parabolic subgroups $W_I$ of Coxeter systems $(W,S)$, as well as their ordinary and double quotients $W / W_I$ and $W_I \backslash W / W_J$, appear in many contexts in combinatorics and Lie theory, including the geometry and topology of…

In this note, we characterize affine and non-affine Coxeter systems among all Coxeter systems in terms of the structure of their reflection orders. For an infinite irreducible system $(W,S)$, we show that affineness can be characterized in…

Given a Coxeter system $(W,S)$ and a multiparameter $\mathbf{q}$ of real numbers indexed by $S$, one can define the weighted $L^2$-cohomology groups and associate to them a nonnegative real number called the weighted $L^2$-Betti number. We…

For a left vector space V over a totally ordered division ring F, let Co(V) denote the lattice of convex subsets of V. We prove that every lattice L can be embedded into Co(V) for some left F-vector space V. Furthermore, if L is finite…

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…

This is the first of a series of papers which define and study structures called rootoids, which are groupoids equipped with a representation in the category of Boolean rings and with an associated 1-cocycle. The axioms for rootoids are…

We define the notion of connectivity set for elements of any finitely generated Coxeter group. Then we define an order related to this new statistic and show that the poset is graded and each interval is a shellable lattice. This implies…