Distributive polytope

In the geometry of convex polytopes, a distributive polytope is a convex polytope for which coordinatewise minima and maxima of pairs of points remain within the polytope. For example, this property is true of the unit cube, so the unit cube is a distributive polytope. It is called a distributive polytope because the coordinatewise minimum and coordinatewise maximum operations form the meet and join operations of a continuous distributive lattice on the points of the polytope.[1]

Every face of a distributive polytope is itself a distributive polytope. The distributive polytopes all of whose vertex coordinates are 0 or 1 are exactly the order polytopes.[1]

See also

References

  1. ^ a b Felsner, Stefan; Knauer, Kolja (2011), "Distributive lattices, polyhedra, and generalized flows", European Journal of Combinatorics, 32 (1): 45–59, doi:10.1016/j.ejc.2010.07.011, MR 2727459.

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.