The Many Aspects of Counting Lattice Points in Polytopes. Loera, J. A D. abstract bibtex A wide variety of topics in pure and applied mathematics involve the problem of counting the number of lattice points inside a convex bounded polyhedron, for short called a polytope. Applications range from the very pure (number theory, toric Hilbert functions, Kostant’s partition function in representation theory) to the most applied (cryptography, integer programming, contingency tables). This paper is a survey of this problem and its applications. We review the basic structure theorems about this type of counting problem. Perhaps the most famous special case is the theory of Ehrhart polynomials, introduced in the 1960s by Eug`ene Ehrhart. These polynomials count the number of lattice points in the different integral dilations of an integral convex polytope. We discuss recent algorithmic solutions to this problem and conclude with a look at what happens when trying to count lattice points in more complicated regions of space.
@article{loera_many_nodate,
title = {The {Many} {Aspects} of {Counting} {Lattice} {Points} in {Polytopes}},
abstract = {A wide variety of topics in pure and applied mathematics involve the problem of counting the number of lattice points inside a convex bounded polyhedron, for short called a polytope. Applications range from the very pure (number theory, toric Hilbert functions, Kostant’s partition function in representation theory) to the most applied (cryptography, integer programming, contingency tables). This paper is a survey of this problem and its applications. We review the basic structure theorems about this type of counting problem. Perhaps the most famous special case is the theory of Ehrhart polynomials, introduced in the 1960s by Eug`ene Ehrhart. These polynomials count the number of lattice points in the different integral dilations of an integral convex polytope. We discuss recent algorithmic solutions to this problem and conclude with a look at what happens when trying to count lattice points in more complicated regions of space.},
language = {en},
author = {Loera, Jesus A De},
pages = {25}
}
Downloads: 0
{"_id":"5TyxDtHWbMXZGM8XS","bibbaseid":"loera-themanyaspectsofcountinglatticepointsinpolytopes","authorIDs":[],"author_short":["Loera, J. A D."],"bibdata":{"bibtype":"article","type":"article","title":"The Many Aspects of Counting Lattice Points in Polytopes","abstract":"A wide variety of topics in pure and applied mathematics involve the problem of counting the number of lattice points inside a convex bounded polyhedron, for short called a polytope. Applications range from the very pure (number theory, toric Hilbert functions, Kostant’s partition function in representation theory) to the most applied (cryptography, integer programming, contingency tables). This paper is a survey of this problem and its applications. We review the basic structure theorems about this type of counting problem. Perhaps the most famous special case is the theory of Ehrhart polynomials, introduced in the 1960s by Eug`ene Ehrhart. These polynomials count the number of lattice points in the different integral dilations of an integral convex polytope. We discuss recent algorithmic solutions to this problem and conclude with a look at what happens when trying to count lattice points in more complicated regions of space.","language":"en","author":[{"propositions":[],"lastnames":["Loera"],"firstnames":["Jesus","A","De"],"suffixes":[]}],"pages":"25","bibtex":"@article{loera_many_nodate,\n\ttitle = {The {Many} {Aspects} of {Counting} {Lattice} {Points} in {Polytopes}},\n\tabstract = {A wide variety of topics in pure and applied mathematics involve the problem of counting the number of lattice points inside a convex bounded polyhedron, for short called a polytope. Applications range from the very pure (number theory, toric Hilbert functions, Kostant’s partition function in representation theory) to the most applied (cryptography, integer programming, contingency tables). This paper is a survey of this problem and its applications. We review the basic structure theorems about this type of counting problem. Perhaps the most famous special case is the theory of Ehrhart polynomials, introduced in the 1960s by Eug`ene Ehrhart. These polynomials count the number of lattice points in the different integral dilations of an integral convex polytope. We discuss recent algorithmic solutions to this problem and conclude with a look at what happens when trying to count lattice points in more complicated regions of space.},\n\tlanguage = {en},\n\tauthor = {Loera, Jesus A De},\n\tpages = {25}\n}\n\n","author_short":["Loera, J. A D."],"key":"loera_many_nodate","id":"loera_many_nodate","bibbaseid":"loera-themanyaspectsofcountinglatticepointsinpolytopes","role":"author","urls":{},"downloads":0,"html":""},"bibtype":"article","biburl":"https://bibbase.org/zotero/bencwbrown","creationDate":"2019-10-04T12:33:53.920Z","downloads":0,"keywords":[],"search_terms":["many","aspects","counting","lattice","points","polytopes","loera"],"title":"The Many Aspects of Counting Lattice Points in Polytopes","year":null,"dataSources":["d4CogEm2wQ8uKii9s"]}