Premium
Binary Convexities and Distributive Lattices
Author(s) -
van de Vel M.
Publication year - 1984
Publication title -
proceedings of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.899
H-Index - 65
eISSN - 1460-244X
pISSN - 0024-6115
DOI - 10.1112/plms/s3-48.1.1
Subject(s) - intersection (aeronautics) , distributive property , mathematics , binary operation , pairwise comparison , convexity , regular polygon , binary number , binary relation , construct (python library) , pure mathematics , base (topology) , dimension (graph theory) , combinatorics , discrete mathematics , computer science , mathematical analysis , geometry , arithmetic , statistics , financial economics , engineering , economics , programming language , aerospace engineering
A convex structure is binary if every finite family of pairwise intersecting convex sets has a non‐empty intersection. Distributive lattices with the convexity of all order‐convex sublattices are a prominent type of examples, because they correspond exactly to the intervals of a binary convex structure which has a certain separation properly. In one direction, this result relies on a study of so‐called base‐point orders induced by a convex structure. Thesis ordering are used to construct an ‘intrinsic’ topology. For binary convexities, certain basic questions are answered with the aid of some results on completely distributive lattices. Several applications are given. Dimension problems are studied in a subsequent paper.