Lower and Upper Bounds for the Number of Lattice Points in a Simplex

DOI10.1137/0122012zbMath0242.90027OpenAlexW2087136539MaRDI QIDQ5653792

Aharon Gavriel Beged-Dov

Publication date: 1972

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0122012

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (9)

On tensor product approximation of analytic functions ⋮ Novel results for the anisotropic sparse grid quadrature ⋮ Polynomial approximation of anisotropic analytic functions of several variables ⋮ Polynomial approximation of symmetric functions ⋮ Percolating sets in bootstrap percolation on the Hamming graphs and triangular graphs ⋮ Homotopy techniques for solving sparse column support determinantal polynomial systems ⋮ Improved lower and upper bounds for the number of feasible solutions to a knapsaek problem ⋮ Hyperbolic cross approximation in infinite dimensions ⋮ Greedy approximations by signed harmonic sums and the Thue-Morse sequence

This page was built for publication: Lower and Upper Bounds for the Number of Lattice Points in a Simplex