Related papers: Shellability of noncrossing partition lattices
We present the proof of the cyclic sieving conjectures for generalised non-crossing partitions associated to well-generated complex reflection groups due to Armstrong, respectively to Bessis and Reiner, for the 26 exceptional well-generated…
We introduce a new class of lattices, the modernistic lattices, and their duals, the comodernistic lattices. We show that every modernistic or comodernistic lattice has shellable order complex. We go on to exhibit a large number of examples…
This note aims to clarify what conditions on a connected Lie group G imply that its maximal connected normal solvable subgroup R intersects each lattice of G as a lattice in R.
It is shown that lattices of a family of split solvable subgroups of PSL(N + 1, C) are complex Kleinian using techniques of Lie groups and dynamical systems, also that there exists a minimal limit set for the action of these lattices on the…
Two constructions of lattice packings of $ n $-dimensional cross-polytopes ($ \ell_1 $ balls) are described, the density of which exceeds that of any prior construction by a factor of at least $ 2^{\frac{n}{\ln n}(1 + o(1))} $ when $ n \to…
The purpose of this note is describe and classify the splittable lattices in the completely solvable metabelian Lie group (semidirect product of abelian vector groups) $G:=\mathbb{R}^n\rtimes_\eta\mathbb{R}^m$, where $\eta$ is the…
If a partition of a lattice in R^d is selfsimilar, it is called lattice substitution system (LSS). Such sets represent nonperiodic, but highly ordered structures. An important property of such structures is, whether they are model sets or…
A covering of a group is a finite set of proper subgroups whose union is the whole group. A covering is minimal if there is no covering of smaller cardinality, and it is nilpotent if all its members are nilpotent subgroups. We complete a…
For $\textrm{SL}(n,\mathbb{R})$ ($n\geq3$), $\textrm{SO}(n+1,n)$ ($n\geq2$), $\textrm{Sp}(2n,\mathbb{R})$ ($n\geq2$) and for the adjoint real split form of the exceptional group $\textrm{G}_2$, we exhibit non-uniform lattices in which we…
We prove that an irreducible lattice in a real semi-simple Lie group of real rank at least two and finite center is not left-orderable.
Schutzenberger's theorem for the ordinary RSK correspondence naturally extends to Chen et. al's correspondence for matchings and partitions. Thus the counting of bilaterally symmetric $k$-noncrossing partitions naturally arises as an…
We show that certain graphs of groups with cyclic edge groups are aTmenable. In particular, this holds when each vertex group is either virtually special or acts properly and semisimply on $\mathbb{H}^n$.
Let $\mathcal{L}$ be the noncrossing partition lattice associated to a finite Coxeter group $W$. In this paper we construct explicit bases for the top homology groups of intervals and rank-selected subposets of $\mathcal{L}$. We define a…
The usual, or type A_n, Tamari lattice is a partial order on T_n^A, the triangulations of an (n+3)-gon. We define a partial order on T_n^B, the set of centrally symmetric triangulations of a (2n+2)-gon. We show that it is a lattice, and…
In this note we define the notion of collarable slices of Lagrangian submanifolds. Those are slices of Lagrangian submanifolds which can be isotoped through Lagrangian submanifolds to a cylinder over a Legendrian embedding near a contact…
For a given complete lattice L, we investigate whether L can be decomposed as a direct product of directly indecomposable lattices. We prove that this is the case if every element of L is a join of join-irreducible elements and dually, thus…
The total number of noncrossing partitions of type $\Psi$ is the $n$th Catalan number $\frac{1}{n+1}\binom{2n}{n}$ when $\Psi=A_{n-1}$, and the binomial $\binom{2n}{n}$ when $\Psi=B_n$, and these numbers coincide with the correspondent…
Categorical skew lattices are a variety of skew lattices on which the natural partial order is especially well behaved. While most skew lattices of interest are categorical, not all are. They are characterized by a countable family of…
A subset $X$ of a finite lattice $L$ is CD-independent if the meet of any two incomparable elements of $X$ equals 0. In 2009, Cz\'edli, Hartmann and Schmidt proved that any two maximal CD-independent subsets of a finite distributive lattice…
We prove that there is a lattice embedded from every countable distributive lattice into the Boolean algebra of computable subsets of $\mathbb{N}$. Along the way, we discuss all relevant results about lattices, Boolean algebras and…