The study of integer points in convex polyhedra is motivated by questions such as "how many nonnegative integer-valued solutions does a system of linear equations with nonnegative coefficients have" or "how many solutions does an integer linear program have". Counting integer points in polyhedra or other questions about them arise in representation theory, commutative algebra, algebraic geometry, statistics, and computer science.
Property | Value |
---|---|
dbo:abstract |
|
dbo:thumbnail | |
dbo:wikiPageExternalLink | |
dbo:wikiPageID |
|
dbo:wikiPageLength |
|
dbo:wikiPageRevisionID |
|
dbo:wikiPageWikiLink |
|
dbp:wikiPageUsesTemplate | |
dcterms:subject | |
rdfs:comment |
|
rdfs:label |
|
owl:sameAs | |
prov:wasDerivedFrom | |
foaf:depiction | |
foaf:isPrimaryTopicOf | |
is dbo:wikiPageRedirects of | |
is dbo:wikiPageWikiLink of | |
is foaf:primaryTopic of |