Related papers: Lattices from Pointed Building Sets: Generalized O…

We exhibit explicit infinite families of finitely presented, Kazhdan, simple groups that are pairwise not measure equivalent. These groups are lattices acting on products of buildings. We obtain the result by studying vanishing and…

For any irrational cut-and-project setup, we demonstrate a natural infinite family of windows which gives rise to separated nets that are each bounded distance to a lattice. Our proof provides a new construction, using a sufficient…

The lattice of noncrossing partitions is well-known for its wide variety of combinatorial appearances and properties. For example, the lattice is rank-symmetric and enumerated by the Catalan numbers. In this article, we introduce a large…

Meet-distributive lattices form an intriguing class of lattices, because they are precisely the lattices obtainable from a closure operator with the so-called anti-exchange property. Moreover, meet-distributive lattices are join…

We introduce a construction called realisation which transforms posets into posets. We show that realisations share several key features with upper semilattices. For example, we define local dimensions of points in a poset and show that…

We announce various results concerning the structure of compactly generated simple locally compact groups. We introduce a local invariant, called the structure lattice, which consists of commensurability classes of compact subgroups with…

The aim of this paper is to establish a lattice theoretical framework to study the partially ordered set $\operatorname{\mathsf{tors}} A$ of torsion classes over a finite-dimensional algebra $A$. We show that $\operatorname{\mathsf{tors}}…

Given a subspace arrangement, there are several De Concini-Procesi models associated to it, depending on distinct sets of initial combinatorial data (building sets). The first goal of this paper is to describe, for the root arrangements of…

We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…

Using Singer polygons, we construct locally finite affine buildings of types ~A_2 and ~C_2 which admit uniform lattices acting regularly on panels. This construction produces very explicit descriptions of these buildings as well as very…

Let A, B, S be categories, let F:A-->S and G:B-->S be functors. We assume that for "many" objects a in A, there exists an object b in B such that F(a) is isomorphic to G(b). We establish a general framework under which it is possible to…

A structure $\cal S$ is quasi-projective if for every structure $\cal T$, for every homomorphism $f : {\cal S} \rightarrow {\cal T}$ and every epimorphism $j: {\cal S}\rightarrow {\cal T}$ there is an endomorphism $\phi$ of $\cal S$ such…

For a many-to-many matching market, we study the lattice structure of the set of random stable matchings. We define a partial order on the random stable set and present two intuitive binary operations to compute the least upper bound and…

We introduce the priority lattice, a structure arising from the priority search algorithm on rooted trees and forests. We prove bijectively that its maximal chains are labeled by parking functions, and that the maximal chains of its…

We discuss the relationship between the multiple Hamiltonian structures of the generalized Toda lattices and that of the generalized Volterra lattices. We use a symmtery approach for Poisson structures that generalizes the Poisson…

This thesis finds its place in the interplay between algebraic and geometric combinatorics. We focus on studying two different families of lattices in relation to the weak order: the permutree lattices and the $s$-weak order. The first part…

We introduce a novel definition of orientation on the triples of a family of pairwise intersecting planar convex sets and study its properties. In particular, we compare it to other systems of orientations on triples that satisfy a…

We examine the lattice of all order congruences of a finite poset from the viewpoint of combinatorial algebraic topology. We will prove that the order complex of the lattice of all nontrivial order congruences (or order-preserving…

For a presentation $\mathcal{A}$ of a transversal matroid $M$, we study the set $T_{\mathcal{A}}$ of single-element transversal extensions of $M$ that have presentations that extend $\mathcal{A}$; we order these extensions by the weak…

A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…