Doubling convex sets in lattices: Characterizations and recognition algorithms

DOI10.1023/A:1016524118566zbMATH Open1010.06009OpenAlexW76773566MaRDI QIDQ698449FDOQ698449

Nathalie Caspard, Karell Bertet

Publication date: 18 September 2002

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1016524118566

zbMATH Keywords

convex setsposetrecognition algorithmdoublingarrow relations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Lattices (06B99)

Cited In (6)

• Generalizing semidistributivity
• Congruence normality: The characterization of the doubling class of convex sets
• The generalized doubling construction and formal concept analysis
• Congruence Normal Covers of Finitely Generated Lattice Varieties
• Enumerating maximal consistent closed sets in closure systems
• AN OVERVIEW OF Λ-TYPE OPERATIONS ON QUASI-SYMMETRIC FUNCTIONS

   Recommendations

• Congruence normality: The characterization of the doubling class of convex sets 👍 👎
• Doubling Constructions in Lattice Theory 👍 👎
• Doubling convex sets in lattices and a generalized semidistributivity condition 👍 👎
• The generalized doubling construction and formal concept analysis 👍 👎
• Congruence Normal Covers of Finitely Generated Lattice Varieties 👍 👎

This page was built for publication: Doubling convex sets in lattices: Characterizations and recognition algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698449)