Abstract

A new type of lattices, lattice of cubes, is defined and described. It is proved that the number of all subcubes of the cube of the dimension m is 3m. It is shown that the set of such subcubes with an appropriate choice of the operations of union and intersection is a lattice, called the lattice of cubes. An algorithm of constructing this lattice is proposed, and the problem of minimization and maximization of supermodular functions is considered on it. Particular examples of such functions are given. Optimizations algorithms, as well as the possibility of setting and solving a new class of problems on the cubes lattices are discussed.

Full Text

Published Version

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.