Sublattices of lattices of order-convex sets, II. Posets of finite length
Marina V. Semenova, Friedrich Wehrung
Abstract
For a positive integer n, we denote by SUB (resp., SUBn) the class of all lattices that can be embedded into the lattice Co(P) of all order-convex subsets of a partially ordered set P (resp., P of length at most n). We prove the following results: (1) SUBn is a finitely based variety, for any n ≥ 1. (2) SUB2 is locally finite. (3) A finite atomistic lattice L without D-cycles belongs to SUB iff it belongs to SUB2; this result does not extend to the nonatomistic case. (4) SUBn is not locally finite for n ≥ 3.
Create a lesson
Related papers
Linear-exponent bounds for the automatic complexity of rational diagonals modulo prime powers
Alex Shvets
How Does One Cut a 30-60-90 Triangle?
Ed Pegg, Brian Trease, Andrew Hudson et al.
A Computational Verification of the Markov Uniqueness Conjecture for z≤ 10500000
Hu Tan, Ying Zhang
On Some Special Cases of the Weber-Schafheitlin Integral
V. G. Zborovskii
Harborth's theorem p(5)=18 revisited
Mike Winkler
Bernstein and Stieltjes properties of some functions involving logarithmic functions
Feng Qi