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

DOI10.1137/0122012MaRDI QIDQ5653792zbMATHOpenAlexFDO

Authors 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)

Cited in

(9)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5653792)