A note on supermodular sublattices in finite relatively complemented lattices

DOI10.1007/S00012-008-2123-8zbMATH Open1170.06001OpenAlexW2041594453MaRDI QIDQ998786FDOQ998786

Authors: Benoît Larose, Andrei Krokhin 

Publication date: 29 January 2009

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00012-008-2123-8

Recommendations

• Supermodular programming on finite lattices
• Supermodular programming on lattices
• Characterization of supermodular semilattice
• scientific article
• Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction

zbMATH Keywords

latticessupermodular functionsmaximum constraint satisfaction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Structure theory of lattices (06B05) Lattice ideals, congruence relations (06B10)

Cited In (10)

• Valuations and closure operators on finite lattices
• Characterization of supermodular semilattice
• The cone of supermodular games on finite distributive lattices
• A generalization of semimodular supersolvable lattice
• Supermodular programming on finite lattices
• Supermodular subgroup lattices.
• Title not available (Why is that?)
• Supermodularity and subadditivity properties of the entropy on the majorization lattice
• Title not available (Why is that?)
• Note on pseudolattices, lattices and submodular linear programs

This page was built for publication: A note on supermodular sublattices in finite relatively complemented lattices

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