Related papers: On slim rectangular lattices
The $\gamma$-Cambrian semilattices $\mathcal{C}_{\gamma}$ defined by Reading and Speyer are a family of meet-semilattices associated with a Coxeter group $W$ and a Coxeter element $\gamma\in W$, and they are lattices if and only if $W$ is…
We introduce the extra slow Tamari lattices, a new family of lattices defined on faithfully balanced tableaux. These tableaux arise naturally from the representation theory of type \( A \) quivers, and our construction extends the classical…
Zilber's Theorem states that a finite lattice $L$ is planar if{}f it has a complementary order relation. We provide a new proof for this crucial result and discuss some applications, including a canonical form for finite planar lattices and…
We prove that if $e$ is a join-irreducible element of a semimodular lattice $L$ of finite length and $h<e$ in $L$ such that $e$ does not cover $h$, then $e$ can be "lowered" to a covering of $h$ by taking a length-preserving semimodular…
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…
Let (L_i : i\in I) be a family of lattices in a nontrivial lattice variety V, and let \phi_i: L_i --> M, for i\in I, be isotone maps (not assumed to be lattice homomorphisms) to a common lattice M (not assumed to lie in V). We show that the…
Let $G$ be a real centre-free semisimple Lie group without compact factors. I prove that irreducible lattices in $G$ are rigid under two types of sublinear distortions. The first result is that the class of lattices in groups that do not…
Let $L$ be a lattice of finite length and let $d$ denote the minimum path length metric on the covering graph of $L$. For any $\xi=(x_1,\dots,x_k)\in L^k$, an element $y$ belonging to $L$ is called a median of $\xi$ if the sum…
We study quasi-isometric embeddings of symmetric spaces and non-uniform irreducible lattices in semisimple higher rank Lie groups. We show that any quasi-isometric embedding between symmetric spaces of the same rank can be decomposed into a…
Since their introduction by G. Gr\"atzer and E. Knapp in 2007, more than four dozen papers have been devoted to finite slim planar semimodular lattices (in short, SPS lattices or slim semimodular lattices) and to some related fields. In…
This article focuses on the relationship between pseudo-t-norms and the structure of lattices. First, we establish a necessary and sufficient condition for the existence of a left-continuous t-norm on the ordinal sum of two disjoint…
In this paper we study the lattice of restricted subalgebras of a restricted Lie algebra. In particular, we consider those algebras in which this lattice is dually atomistic, lower or upper semimodular, or in which every restricted…
There is a family of constructions to produce orthomodular structures from modular lattices, lattices that are M and M*-symmetric, relation algebras, the idempotents of a ring, the direct product decompositions of a set or group or…
We introduce the notion of a (strongly) topological lattice $\mathcal{L}=(L,\wedge ,\vee)$ with respect to a subset $X\subsetneqq L;$ aprototype is the lattice of (two-sided) ideals of a ring $R,$ which is(strongly) topological with respect…
Intervals in binary or n-ary relations or other discrete structures generalize the concept of interval in a linearly ordered set. Join-irreducible partitions into intervals are characterized in the lattice of all interval decompositions of…
Difference calculus compatible with polynomials (i.e., such that the divided difference operator of first order applied to any polynomial must yield a polynomial of lower degree) can only be made on special lattices well known in…
Finite (upper) nearlattices are essentially the same mathematical entities as finite semilattices, finite commutative idempotent semigroups, finite join-enriched meet semilattices, and chopped lattices. We prove that if an $n$-element…
From any directed graph $E$ one can construct the graph inverse semigroup $G(E)$, whose elements, roughly speaking, correspond to paths in $E$. Wang and Luo showed that the congruence lattice $L(G(E))$ of $G(E)$ is upper-semimodular for…
We introduce a partial order structure on the set of interval orders of a given size, and prove that such a structure is in fact a lattice. We also provide a way to compute meet and join inside this lattice. Finally, we show that, if we…
The well known Haldane map from spin chains into the $O(3)$ non linear sigma model is generalized to the case of spin ladders. This map allows us to explain the different qualitative behaviour between even and odd ladders, exactly in the…