About: Integer points in convex polyhedra

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Integer points in convex polyhedra Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

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.

Attributes	Values
rdfs:label	Integer points in convex polyhedra (en)
rdfs:comment	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. (en)
sameAs	Integer points in convex polyhedra
dbp:wikiPageUsesTemplate	dbt:Citation dbt:Reflist
Subject	Polyhedra Polytopes Linear algebra Linear programming Lattice points
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Integer_points_in_convex_polyhedra?oldid=988329524&ns=0
Wikipage page ID	25292663 (xsd:integer)
page length (characters) of wiki page	4272 (xsd:nonNegativeInteger)
Wikipage revision ID	988329524 (xsd:integer)
Link from a Wikipage to another Wikipage	Algebraic geometry Statistics Polyhedra Polytopes Linear algebra Linear programming Pick's theorem Commutative algebra Computer science Convex set Ehrhart polynomial Minkowski's theorem Lattice points System of linear equations Integer Integer programming Integral polytope Loop optimization Lattice (group) Polyhedron Polytope Representation theory
has abstract	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. The set of integer points, or, more generally, the set of points of an affine lattice, in a polyhedron is called Z-polyhedron, from the mathematical notation or Z for the set of integer numbers. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Integer_points_in_convex_polyhedra
is Wikipage redirect of	Integer points in a convex polyhedron Integer points in convex polyhedron Integer points in polyhedra Lattice points in polyhedra Z-polyhedra
is Link from a Wikipage to another Wikipage of	Frameworks supporting the polyhedral model Integer points in a convex polyhedron Integer points in convex polyhedron Integer points in polyhedra Double exponential function Lattice points in polyhedra
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Integer_points_in_convex_polyhedra

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (71 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software