Lower and Upper Bounds for the Number of Lattice Points in a Simplex
From MaRDI portal
Publication:5653792
DOI10.1137/0122012zbMATH Open0242.90027OpenAlexW2087136539MaRDI QIDQ5653792FDOQ5653792
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
Cited In (9)
- Polynomial approximation of symmetric functions
- Percolating sets in bootstrap percolation on the Hamming graphs and triangular graphs
- On tensor product approximation of analytic functions
- Polynomial approximation of anisotropic analytic functions of several variables
- Hyperbolic cross approximation in infinite dimensions
- Improved lower and upper bounds for the number of feasible solutions to a knapsaek problem
- Novel results for the anisotropic sparse grid quadrature
- Greedy approximations by signed harmonic sums and the Thue-Morse sequence
- Homotopy techniques for solving sparse column support determinantal polynomial systems
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)
