相关论文: Dual spaces of lattices and semidistributive latti…

We describe digraphs with topology which give dual representations of ortholattices. This is done via so-called dual Plo\v{s}\v{c}ica spaces of lattices. First, we improve the definition of Plo\v{s}\v{c}ica spaces from an earlier paper to…

We describe the digraphs that are dual representations of finite lattices satisfying conditions related to meet-distributivity and modularity. This is done using the dual digraph representation of finite lattices by Craig, Gouveia and…

There are numerous generalizations of the celebrated Priestley duality for bounded distributive lattices to the non-distributive setting. The resulting dualities rely on an earlier foundational work of such authors as Nachbin,…

We develop dualities for complete perfect distributive quasi relation algebras and complete perfect distributive involutive FL-algebras. The duals are partially ordered frames with additional structure. These frames are analogous to the…

We develop a new duality for distributive and implicative meet semi-lattices. For distributive meet semi-lattices our duality generalizes Priestley's duality for distributive lattices and provides an improvement of Celani's duality. Our…

We establish a topological duality for bounded lattices. The two main features of our duality are that it generalizes Stone duality for bounded distributive lattices, and that the morphisms on either side are not the standard ones. A…

We provide a new perspective on extended Priestley duality for a large class of distributive lattices equipped with binary double quasioperators. Under this approach, non-lattice binary operations are each presented as a pair of partial…

This is a survey on selected developments in the theory of natural dualities where the author had the opportunity to make with his foreign colleagues several breakthroughs and move the theory forward. It is aimed as author's reflection on…

We revisit the problem of Stone duality for lattices with various quasioperators, first studied in [14], presenting a fresh duality result. The new result is an improvement over that of [14] in two important respects. First, the…

The natural join and the inner union combine in different ways tables of a relational database. Tropashko [18] observed that these two operations are the meet and join in a class of lattices-called the relational lattices- and proposed…

We connect Priestley duality for distributive lattices and its generalization to distributive meet-semilattices to Hofmann-Mislove-Stralka duality for semilattices. Among other things, this involves consideration of various morphisms…

Problem 540 of J. D. Lawson and M. Mislove in Open Problems in Topology asks whether the process of taking duals terminate after finitely many steps with topologies that are duals of each other. The problem for $T_1$ spaces was already…

This paper provides a fresh perspective on the representation of distributive bilattices and of related varieties. The techniques of naturalduality are employed to give, economically and in a uniform way, categories ofstructures dually…

We introduce a general framework for generating dualities between categories of partial orders and categories of ordered Stone spaces; we recover in particular the classical Priestley duality for distributive lattices and establish several…

Preorder polytopes, defined from preorders on finite sets, are introduced and studied from a lattice point enumeration point of view. They naturally generalize arbor polytopes, recently introduced and studied by the second named author.…

We prove a Fundamental Theorem of Finite Semidistributive Lattices (FTFSDL), modelled on Birkhoff's Fundamental Theorem of Finite Distributive Lattices. Our FTFSDL is of the form "A poset L is a finite semidistributive lattice if and only…

In this paper, we study the dualization in distributive lattices, a generalization of the well-known hypergraph dualization problem. We in particular propose equivalent formulations of the problem in terms of graphs, hypergraphs, and…

In 1986 Stanley associated to a poset the order polytope. The close interplay between its combinatorial and geometric properties makes the order polytope an object of tremendous interest. Double posets were introduced in 2011 by Malvenuto…

To every poset P, Stanley (1986) associated two polytopes, the order polytope and the chain polytope, whose geometric properties reflect the combinatorial qualities of P. This construction allows for deep insights into combinatorics by way…

A classical result of R.\,P. Dilworth states that every finite distributive lattice $D$ can be represented as the congruence lattice of a finite lattice~$L$. A~sharper form was published in G.~Gr\"atzer and E.\,T. Schmidt in 1962, adding…