Related papers: The canonical join complex for biclosed sets
A modular or distributive lattice is `diamond-colored' if its order diagram edges are colored in such a way that, within any diamond of edges, parallel edges have the same color. Such lattices arise naturally in combinatorial representation…
For any 1-reduced simplicial set $K$ we define a canonical, coassociative coproduct on $\Om C(K)$, the cobar construction applied to the normalized, integral chains on $K$, such that any canonical quasi-isomorphism of chain algebras from…
We describe arithmetic algorithms on a canonical number representation based on the Catalan family of combinatorial objects specified as a Haskell type class. Our algorithms work on a {\em generic} representation that we illustrate on…
The concept of a sectionally pseudocomplemented lattice was introduced by I. Chajda as an extension of relative pseudocomplementation for not necessarily distributive lattices. The typical example of such a lattice is the non-modular…
We represent finite join-semilattices and join-preserving morphisms as a category whose objects and morphisms are binary relations. It is a quotient category of $\mathsf{Rel}_f$'s arrow category, where self-duality arises by taking the…
Rigged configurations are combinatorial objects prominent in the study of solvable lattice models. Marginally large tableaux are semi-standard Young tableaux of special form that give a realization of the crystals ${\cal B}(\infty)$. We…
Hypertrees and noncrossing trees are well-established objects in the combinatorics literature, but the hybrid notion of a noncrossing hypertree has received less attention. In this article I investigate the poset of noncrossing hypertrees…
The set of all perfect matchings of a plane (weakly) elementary bipartite graph equipped with a partial order is a poset, moreover the poset is a finite distributive lattice and its Hasse diagram is isomorphic to $Z$-transformation directed…
We prove an identity for five arguments, valid in the lattice of natural numbers with gcd and lcm as lattice operations. More generally, this identity characterizes arbitrary distributive lattices. Fixing three of the five arguments, we…
We present an analogue of the differential calculus in which the role of polynomials is played by certain ordered sets and trees. Our combinatorial calculus has all nice features of the usual calculus and has an advantage that the elements…
We introduce two simplicial complexes, the noncrossing matching complex and the noncrossing bipartite complex. Both complexes are intimately related to the bubble lattice introduced in our earlier article "Bubble Lattices I: Structure"…
We define and study a class of finite topological spaces, which model the cell structure of a space obtained by gluing finitely many Euclidean convex polyhedral cells along congruent faces. We call these finite topological spaces,…
We exhibit an identity of abstract simplicial complexes between the well-studied complex of trees and the reduced minimal nested set complex of the partition lattice. We conclude that the order complex of the partition lattice can be…
It is known that a lattice is representable as a ring of sets iff the lattice is distributive. CRL is the class of bounded distributive lattices (DLs) which have representations preserving arbitrary joins and meets. jCRL is the class of DLs…
First, we prove that the set of $n\times n$ complex matrices is the closure of a certain open subset whose elements have a very specific canonical form under congruence, which is uniquely determined up to the values of some parameters, but…
We generalize the "facial weak order" of a finite Coxeter group to a partial order on a set of intervals in a complete lattice. We apply our construction to the lattice of torsion classes of a finite-dimensional algebra and consider its…
The Cartan scheme $\cal X$ of a finite group $G$ with a $(B,N)$-pair is defined to be the coherent configuration associated with the action of $G$ on the right cosets of the Cartan subgroup $B\cap N$ by the right multiplications. It is…
This article presents a study of an algebra spanned by the faces of a hyperplane arrangement. The quiver with relations of the algebra is computed and the algebra is shown to be a Koszul algebra. It is shown that the algebra depends only on…
The aim of the present paper is to study isomorphisms of canonical ${\cal E}$-lattices. Some interesting results are obtained in the particular case of isomorphisms between two subgroup ${\cal E}$-lattices.
We give a general notion of combinatory completeness with respect to a faithful cartesian club and use it systematically to obtain characterisations of a number of different kinds of applicative system. Each faithful cartesian club…