Indexed metadata
A Remark on “an Inequality for the Number of Lattice Points in a Simplex”
Manfred W. Padberg
Source abstract
We show that it is possible to derive a lower bound on the number of lattice points in a simplex which is sharper than the one given by Aharon G. Beged Dov in the abovementioned paper. Furthermore, alternative upper and lower bounds are derived which in some special cases yield the exact number of lattice points in a simplex.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.