×

Convex bodies and convexity on Grassmann cones. I-IV. (English) Zbl 0112.37301


PDFBibTeX XMLCite
Full Text: DOI EuDML

References:

[1] Alexandroff, P., andH. Hopf: Topologie I, Berlin 1935, (reprinted Ann Arbor, Mich. 1945).
[2] Barthel, W.: Zum Busemannschen und Brunn-Minkowskischen Satz. Math. Z.70, 407-420 (1959). · Zbl 0085.16702
[3] Bonnesen, T., andW. Fenchel: Theorie der konvexen Körper. Berlin 1934 and New York 1948. · Zbl 0008.07708
[4] Bourbaki, N.: Algèbre Multilinéaire, Éléments de Math. I, Livre II Chap. 3. Paris 1958. · Zbl 0098.02501
[5] Busemann, H.: Convex surfaces. New York 1958. · Zbl 0196.55101
[6] ?? Area in affine spaces III. Rend. Circ. Mat. Palermo, Ser. II,9, 226-242 (1960). · Zbl 0104.17103
[7] ?? Convexity on Grassmann manifolds. Enseign. Math.7, 139-152 (1961). · Zbl 0104.16902
[8] ??, andE. G. Strauss: Area and normality. Pacific J. Math.10, 35-72 (1960). · Zbl 0101.40102
[9] Cartan, É.: Leçons sur la géometrie des espaces de Riemann. 2nd Ed. Paris 1946. · Zbl 0060.38101
[10] Coxeter, H. S. M.: Regular polytopes. New York 1948. · Zbl 0031.06502
[11] Dowker, C. H.: On minimum circumscribed polygons. Bull. Amer. Math. Soc.50, 120-122 (1944). · Zbl 0061.37806
[12] Hadwiger, H.: Vorlesungen über Inhalt, Oberfläche und Isoperimetrie. Berlin-Göttingen-Heidelberg: Springer 1957. · Zbl 0078.35703
[13] Petkantschin, B.: Integralgeometrie 6, Zusammenhänge zwischen den Dichten der linearen Unterräume imn-dimensionalen Raum. Abhandl. Math. Seminar Hamburg. Univ.11, 249-310 (1936). · Zbl 0014.12601
[14] Shephard, G. C.: Inequalities between mixed volumes of convex sets. Mathematika7, 125-138 (1960). · Zbl 0108.35203
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.