Three proofs of Minkowski's second inequality in the geometry of numbers
R. P. Bambah, Alan C. Woods, Hans Zassenhaus
Abstract
Open-access reader
R. P. Bambah, Alan C. Woods, Hans Zassenhaus
Abstract
Open-access reader
Let K be a bounded, open convex set in euclidean n-space Rn, symmetric in the origin 0. Further let L be a lattice in Rn containing 0 and put extended over all positive real numbers ui for which uiK contains i linearly independent points of L. Denote the Jordan content of K by V(K) and the determinant of L by d(L). Minkowski's second inequality in the geometry of numbers states that Minkowski's original proof has been simplified by Weyl [6] and Cassels [7] and a different proof hasbeen given by Davenport [1].
OpenAlex reports 18 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Let K be a bounded, open convex set in euclidean n-space Rn, symmetric in the origin 0. Further let L be a lattice in Rn containing 0 and put extended over all positive real numbers ui for which uiK contains i linearly independent points of L. Denote the Jordan content of K by V(K) and the determinant of L by d(L). Minkowski's second inequality in the geometry of numbers states that Minkowski's original proof has been simplified by Weyl [6] and Cassels [7] and a different proof hasbeen given by Davenport [1].
Key concepts: Minkowski space, Geometry of numbers, Minkowski addition, Mathematics, Bounded function, Euclidean space, Combinatorics, Discrete geometry