Live briefing
Everything about Integral polytope
Convex polytope whose vertices all have integer Cartesian coordinates
In geometry and polyhedral combinatorics, an integral polytope is a convex polytope whose vertices all have integer Cartesian coordinates. That is, it is a polytope that equals the convex hull of its integer points. Integral polytopes are also called lattice polytopes or Z-polytopes. The special cases of two- and three-dimensional integral polytopes may be called integral polygons or integral polyhedra, respectively. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Integral polytopeA 5-minute orientation
- Skim a recent paper: Polytope symmetries of Feynman integralsInfluential work since 2022
- Pick up a classic book: Offbeat Integral Geometry on Symmetric SpacesThe most-reprinted book on the subject
- Read the landmark paper: On Counting Integral Points in a Convex Rational PolytopeCited 24 times
- Go sideways: Polyhedral combinatoricsA closely related topic
- Go sideways: Convex polytopeA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
On Counting Integral Points in a Convex Rational Polytope
Euler-Maclaurin with remainder for a simple integral polytope
The Co-2-plex Polytope and Integral Systems
When Is the Matching Polytope Box-Totally Dual Integral?
On the integral dicycle packings and covers and the linear ordering polytope
Derivative of an integral over a convex polytope
The weighted Euler-Maclaurin formula for a simple integral polytope
The integral polytope group
🆕 Influential since 2022
📚 Books worth reading
Offbeat Integral Geometry on Symmetric SpacesValery V. Volchkov · 2013
Positive Polynomials Convex Integral Polytopes And A Random Walk ProblemDavid E. Handelman · 1987
European Women in MathematicsEuropean Women in Mathematics. General Meeting · 2001
Positive polynomials, convex integral polytopes, and a random walk problemDavid Handelman · 1987- 📕The integration of polytopic membrane proteins into the endoplasmic reticulumVivienne Laird · 1996
Algebra, Geometry and Software SystemsMichael Joswig · 2003
Intelligent Information and Database SystemsAli Selamat · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Polyhedral combinatorics Polyhedral combinatorics is a branch of mathematics, within combinatorics and discrete geometry, that studies the problems of counting and describing the…
- Convex polytope A convex polytope is a special case of a polytope, having the additional property that it is also a convex set contained in the n-dimensional Euclidean…
- List of convexity topics This is a list of convexity topics, by Wikipedia page. Alpha blending - the process of combining a translucent foreground color with a background color…
- Polymake polymake is a software for the algorithmic treatment of convex polyhedra. Albeit primarily a tool to study the combinatorics and the geometry of convex…
- Ehrhart polynomial In mathematics, an integral polytope has an associated Ehrhart polynomial that encodes the relationship between the volume of a polytope and the number…
- Linear programming Linear programming (LP), also called linear optimization, is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical…
- Hypercube In geometry, a hypercube is an n-dimensional analogue of a square (n = 2) and a cube (n = 3); the special case for n = 4 is known as a tesseract. It is…
- Matching polytope In graph theory, the matching polytope of a given graph is a geometric object representing the possible matchings in the graph. It is a convex polytope…