On order polynomially complete lattices
From MaRDI portal
It is proven that every order polynomially complete lattice is bounded. Hence, a polynomially complete lattice cannot be countably infinite. This partially solves one of the most famous problems in the theory of polynomially complete lattices. However, the problem remains open for the uncountable case.
Recommendations
Cites work
Cited in
(11)- On locally order-polynomially complete modular lattices
- An algebraic construction of the ring of piecewise polynomial functions
- Pre-fixed points of polynomial functions of lattices
- Interpolation of monotone functions in lattices
- On order-polynomial completeness of lattices
- Many order types on integer grids of polynomial size
- scientific article; zbMATH DE number 446461 (Why is no real title available?)
- On the structure of the lattice of closed classes of polynomials
- scientific article; zbMATH DE number 1129496 (Why is no real title available?)
- Lattice-ordered algebras with polynomial inequalities
- There are no infinite order polynomially complete lattices, after all
This page was built for publication: On order polynomially complete lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802250)