Skip to main content Accessibility help
×
Hostname: page-component-77f85d65b8-v2srd Total loading time: 0 Render date: 2026-04-13T22:48:55.050Z Has data issue: false hasContentIssue false

References

Published online by Cambridge University Press:  22 December 2025

Peter McMullen
Peter McMullen
Affiliation:
University College London
Get access

Information

Type
Chapter
Information
Convex Polytopes and Polyhedra , pp. 597 - 619
Publisher: Cambridge University Press
Print publication year: 2026

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Book purchase

Temporarily unavailable

References

Adin, R. M, A new cubical h-vector. Discrete Math. 157 (1996), 3–14. [8B,14G] *CrossRefGoogle Scholar
Adin, R. M, Kalmanovich, D. and Nevo, E, On the cone of f-vectors of cubical polytopes. Proc. Amer. Math. Soc. 147 (2019), 1851–1866. [14G]CrossRefGoogle Scholar
Adiprasito, K. A., Toric chordality. J. Math. Pures Appl. 108 (2017), 783–807. [14G]CrossRefGoogle Scholar
Adiprasito, K. A, FAQ on the g-theorem and the hard Lefschetz theorem for face rings. Rend. Apl. Mat. (7) 40 (2019), 97–111. [14F]Google Scholar
Adiprasito, K. A, Combinatorial Lefschetz theorems beyond positivity.Annals Math. (to appear). [14A]Google Scholar
Adiprasito, K. A, Huh, J. and Katz, E, Hodge theory of matroids. Notices Amer. Math. Soc. 64 (2017), 26–30. [14E]CrossRefGoogle Scholar
Adiprasito, K. A, Huh, J. and , E Katz, Hodge theory for combinatorial geometries. Annals Math. (2) 188 (2018), 381–452. [14E]CrossRefGoogle Scholar
Adiprasito, K. A, Kalmanovich, D. and , E Nevo, On the realization space of the cube. J. Eur. Math. Soc. 26 (2024), 261–273. [14G]CrossRefGoogle Scholar
Adiprasito, K. A, Nevo, E. and Samper, J. A., Higher chordality: from graphs to complexes. Proc. Amer. Math. Soc. 144 (2016), 3317–3329. [14E,14G]CrossRefGoogle Scholar
Adiprasito, K. A, Nevo, E. and Samper, J. A, A geometric lower bound theorem. Geom. Funct. Anal. 26 (2016), 359–378. [14E,14G]CrossRefGoogle Scholar
Adiprasito, K. A, Papadakis, S. A. and Petropou, V, Anisotropy, biased pairings, and the Lefschetz property for pseudomanifolds and cycles (pre-print, 2021). [14A]Google Scholar
Aleksandrov, A. D, A theorem on convex polyhedra (Russian). Trudy Fiz.-Mat. Inst. Im Steklova 4 (1933), 87. [9A,15C]Google Scholar
Aleksandrov, A. D, To the theory of mixed volumes of convex bodies, I: Extension of certain concepts of the theory of convex bodies (Russian). Mat. Sbornik N.S. 2 (1937), 947–972. (English translation in Selected Works, Part I, Selected Scientific Papers, Gordon and Breach (1996), 31–59.) [12D]Google Scholar
Aleksandrov, A. D, To the theory of mixed volumes of convex bodies, II: New inequalities for mixed volumes and their applications (Russian). Mat. Sbornik N.S. 2 (1937), 1205–1238. (English translation in Selected Works, Part I, Selected Scientific Papers, Gordon and Breach (1996), 61–97.) [14C,15A]Google Scholar
Aleksandrov, A. D., On packing of space by polytopes (Russian). Vestnik Leningrad. Univ. (Ser. Mat. Fiz. Him.) 9 (1954), 33–43. [11B]Google Scholar
Aleksandrov, A. D., Convex Polyhedra. Springer Monographs in Mathematics (Springer, Berlin–Heidelberg–New York, 2005) (Russian original, Gosudarstv. Izdat. Tekhn.-Teor. Lit., Moscow–Leningrad, 1950). [11B]Google Scholar
Alesker, S., Description of translation invariant valuations on convex sets with solution of P. McMullen’s conjecture. Geom. Funct. Anal. 11 (2001), 244–272. [13E]CrossRefGoogle Scholar
Alesker, S., Algebraic structures on valuations, their properties and applications. Proc. I.C.M. 2002, vol. II, Higher Ed. Press (Beijing, 2002), 757–764. [20D]Google Scholar
Alesker, S., The multiplicative structure on continuous polynomial valuations. Geom. Funct. Anal. 14 (2004), 1–26. [13E,20D]CrossRefGoogle Scholar
Altshuler, A. and Steinberg, L., Neighbourly 4-polytopes with 9 vertices.J. Combin. Theory (A) 15 (1973), 270–287. [7E]CrossRefGoogle Scholar
Anderson, I, Combinatorics of Finite Sets. Oxford University Press (Oxford, 1987). [0F]Google Scholar
Assouad, P., Caractérisations de sous-espaces normés de L1 de dimension finie. Séminaire d’Analyse Fonctionnelle (École Polytechnique Palaiseau), 1979–1980, exposé No 19. [10A]Google Scholar
Bagchi, B. and Datta, B., On stellated spheres and a tightness criterion for combinatorial manifolds. Eur. J. Comb. 36 (2014), 294–313. [14G]CrossRefGoogle Scholar
Baker, M., Hodge theory in combinatorics. Bull. Amer. Math. Soc. 55 (2018), 57–80. [10B,14C,14E]CrossRefGoogle Scholar
Balinski, M. L., On the graph structure of convex polyhedra in n-space.Pacific J. Math. 11 (1961), 431–434. [7A]CrossRefGoogle Scholar
Barnette, D. W., The minimum number of vertices of a simple polytope. Israel J. Math. 9 (1971), 121–125. [14A]CrossRefGoogle Scholar
Barnette, D. W., A proof of the lower bound conjecture for convex polytopes. Pacific J. Math. 46 (1973), 349–354. [14G]CrossRefGoogle Scholar
Barnette, D. W., Graph theorems for manifolds. Israel J. Math. 16 (1973), 62–72. [7A]CrossRefGoogle Scholar
Barnette, D. W., An upper bound for the diameter of a polytope. Discrete Math. 10 (1974), 9–13. [7E]CrossRefGoogle Scholar
Barnette, D. W., A short proof of the d-connectedness of d-polytopes.Discrete Math. 137 (1995), 351–352. [7A]CrossRefGoogle Scholar
Barvinok, A., A Course in Convexity. Graduate Studies in Mathematics 54 (Amer. Math. Soc., Providence, R.I., 2002). [8C,10B]Google Scholar
Barvinok, A and Novik, I., A centrally symmetric version of the cyclic polytope. Discrete Comput. Geom. 39 (2008), 76–99. [9B]CrossRefGoogle Scholar
Bayer, M. M., Face numbers and subdivisions of polytopes. In Polytopes: Abstract, Convex and Computational (eds. T. Bisztriczky, , McMullen, P., Schneider, R. and Ivić, A. Weiss), NATO ASI Series C 440, Kluwer Dordrecht, 1994), 155–171. [14G]Google Scholar
Bayer, M. M., The cd-index: a survey. In Contemp. Math. 764 (2021), 1–19. [8A]CrossRefGoogle Scholar
Bayer, M. M. and Billera, L. J., Generalized Dehn–Sommerville relations for polytopes, spheres and Eulerian partially ordered sets. Invent. Math. 79 (1985), 143–157. [8A]CrossRefGoogle Scholar
Bayer, M. M. and Klapper, A., A new index for polytopes. Discrete Comput. Geom. 6 (1991), 33–47. [8A]CrossRefGoogle Scholar
Bayer, M. M. and Lee, C. W., Combinatorial aspects of convex polytopes. Chapter 2.3 in Handbook of Convex Geometry (ed. Gruber, P. M. and Wills, J. M.), North-Holland (1993), 485–534. [8A]Google Scholar
Bayer, M. M. and Sturmfels, B., polytopes, Lawrence. Canad. J. Math. 42(1990), 62–79. [6D]CrossRefGoogle Scholar
Bernig, A. and Faifman, D., Generalized translation invariant valuations and the polytope algebra. Advances Math. 290 (2016), 36–72. [13C]CrossRefGoogle Scholar
Bernig, A, Kotrbatý, J. and Wannerer, T., Hard Lefschetz theorem and Hodge–Riemann relations for convex valuations (preprint, 2023). [15A]Google Scholar
Bernshtein, D. N, The number of integral points in integral polyhedra (Russian). Funktsional. Anal. i Prilozhen. 10 (1976), 72–73. (English translation: Functional Anal. Appl. 10 (1976), 293–294.) [21D]Google Scholar
Betke, U, Gitterpunkte und Gitterpunktfunktionale. Habilitationsschrift (Siegen, 1979). [21D]Google Scholar
Betke, U, Das Einschließungs-Ausschließungsprinzip für Gitterpolytope (manuscript). [21B]Google Scholar
Betke, U, Mixed volumes of polytopes. Archiv Math. 58 (1992), 388–391. [5B,13B]CrossRefGoogle Scholar
Betke, U and Kneser, M, Zerlegungen und Bewertungen von Gitterpolytopen. J. reine angew. Math. 358 (1985), 202–208. [21B,21D]Google Scholar
Betke, U and McMullen, P, Lattice points in lattice polytopes. Monatsh. Math. 99 (1985), 253–265. [21D]CrossRefGoogle Scholar
Billera, L. J., The algebra of piecewise polynomial functions. Advances Math. 76 (1989), 170–183. [19H]CrossRefGoogle Scholar
Billera, L. J., Filliman, P. and Sturmfels, B., Constructions and complexity of secondary polytopes. Advances Math. 83 (1990), 155–179. [2D]CrossRefGoogle Scholar
Billera, L. J. and Lee, C. W., Sufficiency of McMullen’s conditions for f-vectors of simplicial polytopes. Bull. Amer. Math. Soc. (New Series) 2 (1980), 181–185. [14B]CrossRefGoogle Scholar
Billera, L. J. and Lee, C. W., A proof of the sufficiency of McMullen’s conditions for f-vectors of simplicial convex polytopes. J. Combin. Theory A 31 (1981), 237–255. [14B]CrossRefGoogle Scholar
Billera, L. J. and Rose, L. L., Modules of piecewise polynomials and their freeness. Math. Z. 209 (1992), 485–497. [14F,19H]CrossRefGoogle Scholar
Billera, L. J. and Sturmfels, B., Fiber polytopes. Annals Math. 135 (1992), 527–549. [2D,13B,20A]CrossRefGoogle Scholar
Billera, L. J. and Sturmfels, B., Iterated fiber polytopes. Mathematika 41 (1994), 348–363. [2D]CrossRefGoogle Scholar
Blaschke, W., Kreis und Kugel (2nd. ed.). de Gruyter, W. (Berlin, 1956) (1st. ed., 1916). [15D]CrossRefGoogle Scholar
Blaschke, W., Vorlesungen über Integralgeometrie (3rd. ed.). VEB Deutsch. Verl. d. Wiss. (Berlin, 1955) (1st. ed., 1935, 1937). [17A]Google Scholar
Blaschke, W. and Hessenberg, G., Lehrsätze über konvexe Körper. Jber. Deutsch. Math.-Verein. 26 (1917), 215–220. [9A]Google Scholar
Blind, G. and Blind, R., Shellings and the lower bound theorem. Discrete Comput. Geom. 21 (1999), 519–526. [14G]CrossRefGoogle Scholar
Blind, G. and Blind, R., Gaps in the numbers of vertices of cubical polytopes, I. Discrete Comput. Geom. 11 (1994), 351–356. [8B]CrossRefGoogle Scholar
Blind, G. and Blind, R., The cubical d-polytopes with fewer than 2d+1 vertices. Discrete Comput. Geom. 13 (1995), 321–345. [8B]Google Scholar
Jr., K. Böröczky and Ludwig, M., Valuations on lattice polytopes. In Tensor valuations and their applications in stochastic geometry and imaging, Lecture Notes in Math. (Springer, Cham.) 2177 (2017), 213–234. [21E]Google Scholar
Jr, K. Böröczky and Ludwig, M., Minkowski valuations on lattice polytopes. J. Eur. Math. Soc. 21 (2019), 163–197. [21E]Google Scholar
Bokowski, J., Computational synthetic geometry. In Polytopes: Abstract, Convex and Computational (eds. Bisztriczky, T., McMullen, P., Schneider, R. and Weiss, A. I.), NATO ASI Series C 440, Kluwer Aca-demic Publishers (Dordrecht, 1994), 335–358. [6F]CrossRefGoogle Scholar
Bolker, E. D., A class of convex bodies. Trans. Amer. Math. Soc. 145 (1969), 323–346. [10A,10B]CrossRefGoogle Scholar
Bollobás, B., Modern Graph Theory (Graduate Studies in Mathematics 184), Springer (New York, 1998). [3E]CrossRefGoogle Scholar
Bondesen, A. and Brøndsted, A., A dual proof of the upper bound conjecture for convex polytopes. Math. Scand. 46 (1980), 95–102. [8C]CrossRefGoogle Scholar
Bonnesen, T. and Fenchel, W., Theorie der Konvexen Körper. Springer (Berlin, 1934). [9A,15E]Google Scholar
Bonnice, W. and Klee, V. L., The generation of convex hulls. Ann. Math.152 (1963), 1–29. [6C]CrossRefGoogle Scholar
Bonnice, W. and Reay, J. R., Interior points of convex hulls. Israel J. Math.4 (1966), 243–248. [6C]CrossRefGoogle Scholar
Bonnice, W. and Reay, J. R., Relative interiors of convex hulls. Proc. Amer. Math. Soc. 20 (1969), 246–250. [6C]CrossRefGoogle Scholar
Brianchon, C. J., Théorème nouveau sur les polyèdres. J. Ecole (Royale) Polytechnique 15 (1837), 317–319. [18F]Google Scholar
Brion, M., Piecewise polynomial functions, convex polytopes and enumerative geometry. Parameter Spaces, Banach Center Publications 36 (1996), 25–44. [19H]CrossRefGoogle Scholar
Brion, M., The structure of the polytope algebra. Tôhoku Math. J. 49 (1997), 1–32. [17B,18A,19H]CrossRefGoogle Scholar
Brøndsted, A., An Introduction to Convex Polytopes. Graduate Texts in Mathematics 90, Springer (New York, 1983). [8C]Google Scholar
Bruggesser, H. and Mani, P., Shellable decompositions of cells and spheres. Math. Scand. 29 (1971), 197–205. [6E]CrossRefGoogle Scholar
Buck, R. C., Partition of space. Amer. Math. Monthly 50 (1943), 541–544. [10F]CrossRefGoogle Scholar
Bui, H. T., Pineda-Villavicencio, G. and Ugon, J., The linkedness of cubical polytopes: the cube. Electron. J. Combin. 28 (2021), Paper No. 3.45 (20 pp.). [7B]CrossRefGoogle Scholar
Bui, V., Every generating polytope is strongly monotypic. Discrete Comput. Geom. 73 (2025), 49–61. [3D]CrossRefGoogle Scholar
Burton, G. R., The nonneighbourliness of centrally symmetric polytopes having many vertices. J. Combin. Theory A 58 (1991), 321–322. [9B]CrossRefGoogle Scholar
Camenga, K. A., Vector spaces spanned by angle sums of polytopes. Beitr. Algebra Geom. 47 (2006), 447–462. [18F]Google Scholar
Carathéodory, C., Ueber den Variabilitätsbereich der Koeffizienten von Potenzreihen, die gegebene Werte nicht annehmen. Math. Ann. 64 (1907), 95–115. [6F]CrossRefGoogle Scholar
Carathéodory, C., Ueber den Variabilitätsbereich der Fourierschen Konstanten von positiven harmonischen Funktionen. Rend. Circ. Mat. Palermo. 32 (1911), 193–217. [6F]CrossRefGoogle Scholar
Castillo, F., Doolittle, J., Goeckner, B., Ross, M. S. and Ying, L., Minkowski summands of cubes. In Proc. 33rd Conf. Formal Power Series Algebraic Combinatorics (Ramat Gan) (Séminaire Lotharingien de Combinatoire 85B (2021), Article #59, 12 pp.). [3C]Google Scholar
Clements, G. F. and Lindstrom, B., A generalization of a theorem of Macaulay, J. Combin. Theory 7 (1969), 230–238. [0F]CrossRefGoogle Scholar
Coble, A. B., Point sets and associated Cremona groups, II. Trans. Amer. Math. Soc. 16 (1915), 155–198. [0E]Google Scholar
Coble, A. B., Point sets and associated Cremona groups, II, Trans. Amer. Math. Soc. 17 (1916), 345–385. [0E]Google Scholar
Coble, A. B., Associated sets of points. Trans. Amer. Math. Soc. 24 (1922), 1–20. [0E]CrossRefGoogle Scholar
Coxeter, H. S. M., A problem of collinear points. Amer. Math. Monthly 55 (1948), 26–28. [10B]CrossRefGoogle Scholar
Coxeter, H. S. M., The classification of zonohedra by means of projective diagrams. J. Math. Pure Appl. 41 (1962), 137–156. [10B]Google Scholar
Coxeter, H. S. M., Regular Polytopes (4th edition). Dover (New York, 1973). [6F]Google Scholar
Dăscălescu, S., Năstăsescu, C. and Raianu, Ş., Hopf Algebras: an Introduction. Pure and Applied Mathematics 235, Marcel-Dekker (New York, 2001). [0G]Google Scholar
Danzer, L. and Grünbaum, B., Über zwei Probleme bezüglich konvexer Körper von P. Erdős und von V. L. Klee. Math. Z. 79 (1962), 95–99. [9B]CrossRefGoogle Scholar
Danzer, L., Grünbaum, B. and Klee, V. L., Helly’s theorem and its relatives. In Convexity, Proc. Symposia Pure Math., vol VII (Amer. Math. Soc., Providence, R.I., 1963), 101–180. [1E]Google Scholar
Dantzig, G. B., Linear Programming and Extensions. Princeton University Press (1963) (4th printing with corrections, 1968). [3E]Google Scholar
Davis, C., Theory of positive linear dependence. Amer. J. Math. 76 (1954), 733–746. [0E,6B]CrossRefGoogle Scholar
Dehn, M., Über raumgleiche Polyeder. Nachr. Akad. Wiss. Göttingen, Math.-Phys. Kl. 1900, 345–354. [12B]Google Scholar
Dehn, M., Über den Rauminhalt. Math. Ann. 55 (1902), 465–478. [12B]CrossRefGoogle Scholar
de Loera, J. A., Nonregular triangulations of products of simplices. Discrete Comput. Geom. 15 (1996), 253–264. [5C]CrossRefGoogle Scholar
Descartes, R., De solidorum elementis. In Œvres 10 (Tannery, Paris, 1897–1913), 265–276. [8A]Google Scholar
Develin, M., Disjoint faces of complementary dimension. Beitr. Algebra Geom. 45 (2004), 463–464. [6A]Google Scholar
Deza, M. and Grishukhin, V., Properties of parallelotopes equivalent to Voronoi’s conjecture. European J. Combin. 25 (2004), 517–533. [11C]CrossRefGoogle Scholar
Deza, M. and Grishukhin, V, Vorono˘ı’s conjecture and space tiling zonotopes. Mathematika 51 (2004), 1–10. [11D]CrossRefGoogle Scholar
Dirac, G. A., Extensions of Menger’s theorem. J. London Math. Soc. 38 (1963), 148–163. [7B]CrossRefGoogle Scholar
Dolgachev, I., Review of [331] by Stanley. Math. Reviews (1981), 81f:52014. [14E]Google Scholar
Dowling, T. A. and Wilson, R. M., The slimmest geometric lattices. Trans. Amer. Math. Soc. 196 (1974), 203–216. [10B]CrossRefGoogle Scholar
Ehrhart, E., Sur un problème de géométrie diophantienne linéaire, I.J. reine angew. Math. 226 (1967), 1–29. [21D]Google Scholar
Ehrhart, E., Démonstration de la loi de réciprocité pour un polyèdre entier. C.R. Acad. Sc. Paris, Sér. A 265 (1967), 5–7. [21D]Google Scholar
Ehrhart, E., Démonstration de la loi de réciprocité du polyèdre rationnel. C.R. Acad. Sc. Paris, Sér. A 265 (1967), 91–94. [21D]Google Scholar
Ehrhart, E., Sur la loi de réciprocité des polyèdres rationnels. C.R. Acad. Sc. Paris, Sér. A 266 (1968), 696–697. [21D]Google Scholar
Ehrhart, E., Polynômes Arithmétiques et Méthode des Polyedrès en Combinatoire, Birkhäuser (Basel–Stuttgart, 1977). [21D]Google Scholar
Engel, P., Geometric crystallography. Chapter 3.7 in Handbook of Convex Geometry (ed. Gruber, P. M. and Wills, J. M.), North-Holland (Amsterdam, 1993). [11C]Google Scholar
, R. M. Erdahl, Zonotopes, dicing and Voronoi’s conjecture on parallelohedra. European J. Combin. 20 (1999), 527–549. [11D]CrossRefGoogle Scholar
Erdős, P., Problem 4065 – Three point collinearity. Amer. Math. Monthly 51 (1944), 169–171. [10B]Google Scholar
Esterov, A., Tropical varieties with polynomial weights and corner loci of piecewise polynomials. Mosc. Math. J. 12 (2012), 55–76. [12D]CrossRefGoogle Scholar
Euler, L., Elementa doctrinae solidorum. Opera Mathematica 26, 71–93. [8A]Google Scholar
Euler, L., Demonstratio nonnullarum insignium proprietatum quibus solida hedris planis inclusa sunt praedita. Opera Mathematica 26, 94–108. [8A]Google Scholar
Eur, C., Essence of independence: Hodge theory of matroids since June Huh. Bull. Amer. Math. Soc. (new series) 61 (2024), 73–102. [14C,14E]Google Scholar
Eur, C. and Larson, M., Combinatorial Hodge theory. Notices Amer. Math. Soc. 72 (2025), 261–270. [14C,14E]CrossRefGoogle Scholar
Ewald, G., Combinatorial Convexity and Algebraic Geometry (Graduate Texts in Mathematics 168), Springer (1996). [3A]CrossRefGoogle Scholar
Ewald, G., Kleinschmidt, P. and Ch, Schulz, Kombinatorische Klassifikation symmetrischer Polytope. Abh. Math. Sem. Univ. Hamburg 45 (1976), 191–206. [9C]CrossRefGoogle Scholar
Ewald, G. and Voß, K., Konvexe Polytope mit Symmetriegruppe. Comm. Math. Helvet. 48 (1973), 137–150. [0E,9C]CrossRefGoogle Scholar
Fenchel, W., Convex Cones, Sets and Functions. Mimeographed lecture notes, Princeton University (1951). [4A]Google Scholar
Fischer, K. G. and Shapiro, J., The prime ideal structure of the Minkowski ring of polytopes. J. Pure Appl. Algebra 78 (1992), 239–251. [2B,17B]CrossRefGoogle Scholar
Fischer, K. G. and Shapiro, J., Generating prime ideals in the Minkowski ring of polytopes. In Lecture Notes in Pure and Appl. Maths. 151 (Dekker, New York, 1994), 111–130. [17B]Google Scholar
Fleming, B. and Karu, K., Hard Lefschetz theorem for simple polytopes. J. Algebraic Combin. 32 (2010), 227–239. [14E]CrossRefGoogle Scholar
Florian, F., The integral polytope group. Adv. Geom. 21 (2021), 45–62. [21B]Google Scholar
Ford, L. R. Jr. and Fulkerson, D. R., Flows in Networks, Princeton University Press (Princeton, N.J., 1962). [3E]Google Scholar
Freyer, A., Ludwig, M. and Rubey, M., Unimodular valuations beyond Ehrhart (preprint, 2024). [21E]CrossRefGoogle Scholar
Fulton, W. and Sturmfels, B., Intersection theory on toric varieties. Topology 36 (1997), 335–353. [18A]CrossRefGoogle Scholar
Gale, D., Neighboring vertices on a convex polyhedron. In Linear Inequalities and Related Systems (ed. Kuhn, H. W. and Tucker, A. W.), Princeton (1956), 255–263. [0E]Google Scholar
Gale, D., The Theory of Linear Economic Models. McGraw-Hill (New York–Toronto–London, 1960). [3E]Google Scholar
Gale, D., Neighborly and cyclic polytopes. Convexity (Proc. Symp. Pure Math. 7), Amer. Math. Soc. (Providence, R.I., 1963), 225–232. [0E]Google Scholar
Gale, D., On the number of faces of a convex polytope. Canad. J. Math. 16 (1964), 12–17. [0E]CrossRefGoogle Scholar
Gallivan, S., Properties of the One-skeleton of a Convex Body. Ph.D. Thesis, Univ. London (1974). [7C]Google Scholar
Gallivan, S., Disjoint edge paths between given vertices of a convex polytope. J. Combin. Theory (A) 39 (1985), 112–115. [7B,7C]CrossRefGoogle Scholar
Gallivan, S., Lockeberg, E. R. and McMullen, P., Complete subgraphs of the graphs of convex polytopes. Discrete Math. 34 (1981), 25–29. [7C]CrossRefGoogle Scholar
Gardner, R. J., Geometric Tomography (second edition) (Encyclopedia of Mathematics and its Applications 58). Cambridge University Press (2006). [15E]Google Scholar
Gel’fand, I. M., Zelevinski˘ı, A. V. and Kapranov, M. M., Newton polytopes of principal A-determinants. Soviet Math. Doklady 40 (1990), 287–281. [2D,5C,6B]Google Scholar
Gerencser, B. and Harangi, V., Acute sets of exponentially optimal size. Discrete Comput. Geom. 62 (2019), 775–780. [9B]CrossRefGoogle Scholar
Gerwien, P., Zerschneidung jeder beliebigen Anzahl von gleichen geradlinigen Figuren in dieselben Stücke. J. reine angew. Math. 10 (1833), 228–234. [12B]Google Scholar
Gerwien, P., Zerschneidung jeder beliebigen Menge verschieden gestalteter Figuren von gleichem Inhalt auf der Kugelfläche in dieselben Stücke. J. reine angew. Math. 10 (1833), 235–240. [12B]Google Scholar
Gordon, E. V., An Introduction to Old Norse (2nd edition, revised by Taylor, A. R.). Oxford University Press (Oxford, 1957). [12B]Google Scholar
Gram, J. P., Om Rumvinklerne i et Polyeder. Tidsskr. Math. (Copenhagen) (3) 4 (1874), 161–163. [18F]Google Scholar
Green, G., An Essay on the Application of Mathematical Analysis to the Theories of Electricity and Magnetism. Privately published (Nottingham, 1828). (Reprinted in J. reine angew. Math. 39 (1850), 73–89; 44 (1852), 356–374; 47 (1854), 161–221.) [12C]Google Scholar
Griffiths, P. and Harris, J., Principles of Algebraic Geometry. Wiley-Interscience (New York, 1978). [14C]Google Scholar
Groemer, H., Continuity properties of Vorono˘ı domains. Monatsh. Math. 75 (1971), 423–431. [11C]CrossRefGoogle Scholar
Groemer, H., Minkowski addition and mixed volumes. Geom. Dedicata 6 (1977), 141–163. [4A]CrossRefGoogle Scholar
Groemer, H., On the extension of additive functions on classes of convex sets. Pacific J. Math. 75 (1978), 397–410. [16A]CrossRefGoogle Scholar
Gruber, P. M., Convex and Discrete Geometry. Springer (Berlin–Heidelberg–New York, 2007). [21D]Google Scholar
Gruber, P. M. and Wills, J. M., Handbook of Convex Geometry. North-Holland (Amsterdam, etc., 1993). [21D]Google Scholar
Grünbaum, B., Convex Polytopes. Wiley-Interscience (New York, 1967). (2nd edition prepared by V. Kaibel, V. L. Klee and G. M. Ziegler, Springer (2003).) [0E,0H,1A,1D,1F,3,6,6A,6B,6E,6F,7A,7D,8A,8B,8C,8D,9B,10A,10B] [10F,13C,14A,15D,16B,18F]Google Scholar
Günzel, H., On the universal partition theorem for 4-polytopes. Discrete Comput. Geom. 19 (1998), 521–552. [6D]CrossRefGoogle Scholar
Haberl, C., Minkowski valuations intertwining the special linear group. J. Eur. Math. Soc. 14 (2012), 1565–1597. [15E]CrossRefGoogle Scholar
Hadwiger, H., Mittelpunktspolyeder und translative Zerlegungsgleichheit. Math. Nachr. 8 (1952), 53–58. [18E]CrossRefGoogle Scholar
Hadwiger, H., Translationsinvariante, additive und schwachstetige Polyederfunktionale. Arch. Math. 3 (1952), 387–394. [2B]CrossRefGoogle Scholar
Hadwiger, H., Über additive Funktionale k-dimensionaler Eipolyeder. Publ. Math. Debrecen 3 (1953), 87–94. [18E]CrossRefGoogle Scholar
Hadwiger, H., Ungelöstes Problem Nr. 17. Elem. Math. 12 (1957), 61–62. [6F]Google Scholar
Hadwiger, H., Vorlesungen über Inhalt, Oberfläche und Isoperimetrie. Springer (Berlin, 1957). [12A,12B,17A,18A,18D]CrossRefGoogle Scholar
Hadwiger, H., Ungelöstes Problem Nr. 55. Elem. Math. 27 (1972), 57. [6G]Google Scholar
Halsey, E. R., Zonotopal complexes on the d-cube. Ph.D. Thesis, University of Washington (1972). [9B]Google Scholar
Hersh, P. and Novik, I., A short simplicial h-vector and the upper bound theorem. Discrete Comput. Geom. 28 (2002), 283–289. [8C]CrossRefGoogle Scholar
Hertel, E., Mittelpunktspolyeder im E4. Elem. Math. 29 (1974), 59–64. [18E]Google Scholar
Hilbert, D., Mathematische Probleme. Nachr. Königl. Ges. Wiss. Göttingen, Math.-Phys. Kl. (1900), 253–297. (English translation: Bull. Amer. Math. Soc. 8 (1902), 437–479.) [12B]Google Scholar
Holt, F. B. and Klee, V. L., Many polytopes meeting the conjectured Hirsch bound. Discrete Comput. Geom. 20 (1998), 1–17. [7B]CrossRefGoogle Scholar
Huber, B. and Sturmfels, B., A polyhedral method for solving sparse polynomial systems. Math. Comp. 64 (1995), 1541–1555. [5B]CrossRefGoogle Scholar
Huh, J., Combinatorial applications of the Hodge–Riemann relations. In Proc. Internat. Congr. Math., Rio de Janeiro, Brazil, 2018 IV (2019), 3093–3111. [14E]Google Scholar
Huh, J., Combinatorics and Hodge theory. In Proc. Internat. Congr. Math., Helsinki, Finland, 2022 1 (2023), 212–239. [14E]Google Scholar
Jessen, B. and Thorup, A., The algebra of polytopes in affine spaces. Math. Scand. 43 (1978), 211–240. [12A,18A,18B,18C,18E]CrossRefGoogle Scholar
Joswig, M. and Ziegler, G., Neighborly cubical polytopes. Discrete Comput. Geom. 24 (2000), 325–344. [8B]CrossRefGoogle Scholar
Kalai, G., Rigidity and the lower bound theorem, I. Invent. Math. 88 (1987), 125–151. [13F]CrossRefGoogle Scholar
Kalai, G., The number of faces of centrally-symmetric polytopes (Research Problem). Graphs Comb. 5 (1989), 389–391. [14H]CrossRefGoogle Scholar
G.Kalai, , On low-dimensional faces that high-dimensional polytopes must have. Combinatorica 10 (1990), 271–280. [8B]Google Scholar
Kalai, G., Some aspects of the combinatorial theory of convex polytopes. In Polytopes: Abstract, Convex and Computational (eds. BisztriczkyMcMullen, T. P., Schneider, R. and Ivić Weiss, A.), NATO ASI Series C 440, Kluwer (Dordrecht, 1994), 205–229. [14G]CrossRefGoogle Scholar
Kalai, G., Polytope skeletons and paths. In Handbook of Discrete and Computational Geometry (eds. Goodman, J. E. and O’Rourke, J.), CRC Press (Boca Raton, 1997). [6B]Google Scholar
Kallay, M., Decomposability of Convex Polytopes. Ph.D. Thesis, Hebrew University of Jerusalem (1979) (Hebrew, with English summary). [3C]Google Scholar
Kallay, M., Indecomposable polytopes. Israel J. Math. 41 (1982), 235–243. [3C]CrossRefGoogle Scholar
Karu, K., Hard Lefschetz theorem for nonrational polytopes. Invent. Math. 157 (2004), 419–447. [14E]CrossRefGoogle Scholar
Katona, G., A theorem on finite sets. In Theory of Graphs (Proc. Colloquium at Tihany, Sept. 1966), Academic Press and Akadémiai Kiado (Budapest, 1968), 187–207. [14A]Google Scholar
Kelly, L. M. and Moser, W. O. J., On the number of ordinary lines determined by n points. Canad. J. Math. 10 (1958), 210–219. [10B]CrossRefGoogle Scholar
Kind, B. and Kleinschmidt, P., Cohen-Macaulay-Komplexe und ihre Para-metrisierung. Math. Z. 167 (1979), 173–179. [14F]CrossRefGoogle Scholar
Klain, D. A., A short proof of Hadwiger’s characterization theorem. Mathematika 42 (1995), 329–339. [18D]CrossRefGoogle Scholar
Klee, V. L., The number of vertices of a convex polytope. Canad. J. Math. 16 (1964), 701–720. [8C]CrossRefGoogle Scholar
Klee, V. L., A comparison of primal and dual methods in linear programming. Numer. Math. 9 (1966), 227–235. [0E,6B]CrossRefGoogle Scholar
Kleinschmidt, P. and Lee, C. W., On k-stacked polytopes. Discrete Math. 48 (1984), 125–127. [14G]CrossRefGoogle Scholar
Kneser, H. and Süss, W., Die Volumina in linearen Scharen konvexer Körper. Mat. Tidsskr. B (1932), 19–25. [15D]Google Scholar
Kruskal, J. B., The number of simplices in a complex. In Mathematical Optimization Techniques (ed. Bellman, R.), Univ. California Press (Berkeley, Cal., 1963), 251–278. [14A]CrossRefGoogle Scholar
Larman, D. G. and Mani(-Levitska), P., On the existence of certain configurations within graphs and the 1-skeletons of polytopes. Proc. London Math. Soc. (3) 20, 144–160. [7B,7C]Google Scholar
Lawrence, J., Minkowski rings (unpublished notes, 1985). [17B]Google Scholar
Lawrence, J., Valuations and polarity. Discrete Comput. Geom. 3 (1988), 307–324. [16D]CrossRefGoogle Scholar
Lawson, C. L., Transforming triangulations. Discrete Math. 3 (1972), 365–372. [21E]CrossRefGoogle Scholar
Lee, C. W., Some recent results on convex polytopes. Contemp. Math. 114 (1990), 3–19. [13F]CrossRefGoogle Scholar
Lee, C. W., Generalized stress and motions. In Polytopes: Abstract, Convex and Computational (ed. T. Bisztriczky, , McMullen, P., Schneider, R. and Weiss, A. I.), NATO ASI Series C, Vol. 440, Kluwer (1994), 249–271. [13F,14G]CrossRefGoogle Scholar
Lee, C. W., spheres, P.L., convex polytopes, and stress. Discrete Comput. Geom. 15 (1996), 389–421. [13D,13F,14G,19E]CrossRefGoogle Scholar
Lindström, B., On the realization of convex polytopes, Euler’s formula and Möbius functions. Aequat. Math. 6 (1971), 235–240. [6D]CrossRefGoogle Scholar
Linial, N. and Novik, I., How neighborly can a centrally symmetric polytope be? Discrete Comput. Geom. 36 (2006), 273–281. [9B]CrossRefGoogle Scholar
Lockeberg, E. R., Refinements in Boundary Complexes of Polytopes. Ph.D. Thesis, Univ. London (1977). [7C,7D,7E]Google Scholar
Lonke, Y., On zonoids whose polars are zonoids. Israel J. Math. 102 (1997), 1–12. [10B]CrossRefGoogle Scholar
Ludwig, M., Projection bodies and valuations. Advances Math. 172 (2002), 158–168. [15E]CrossRefGoogle Scholar
Ludwig, M., Minkowski valuations. Trans. Amer. Math. Soc. 357 (2005), 4157–4190. [15E]Google Scholar
Ludwig, M., Valuations in the affine geometry of convex bodies. In Integral Geometry and Convexity, World Sci. Publ. (Hackensack, N.J., 2006), 49–65. [15E]CrossRefGoogle Scholar
Ludwig, M. and Silverstein, L., Tensor valuations on lattice polytopes. Advances Math. 319 (2017), 76–110. [21E]CrossRefGoogle Scholar
Lutwak, E., Inequalities for mixed projection bodies. Trans. Amer. Math. Soc. 339 (1993), 901–916. [15E]CrossRefGoogle Scholar
Macaulay, F. S., Some properties of enumeration in the theory of modular systems. Proc. London Math. Soc. (2) 26 (1927), 531–555. [0F]CrossRefGoogle Scholar
Macdonald, I. G., The volume of a lattice polyhedron. Proc. Camb. Phil. Soc. 59 (1963), 719–726. [21D]CrossRefGoogle Scholar
Macdonald, I. G., Polynomials associated with finite cell-complexes. J. London Math. Soc. (2) 4 (1971), 181–192. [8A,21D]CrossRefGoogle Scholar
Mani, P., Inner illumination of convex polytopes. Comment. Math. Helvet. 49 (1974), 65–73. [6G]CrossRefGoogle Scholar
Marcus, D. A., Gale diagrams of convex polytopes and positive spanning sets of vectors. Discrete Appl. Math. 9 (1984), 47–67. [6G]CrossRefGoogle Scholar
McAllister, T. B. and Woods, K. M., The minimum period of the Ehrhart quasi-polynomial of a rational polytope. J. Combin. Theory A 109 (2005), 345–352.CrossRefGoogle Scholar
McDonald, J., Fractional power series solutions for systems of equations. Discrete Comput. Geom. 27 (2002), 501–529. [20E]CrossRefGoogle Scholar
McMullen, P., Combinatorial Properties of Convex Polytopes. Ph.D. Thesis, University of Birmingham (1968). [6A]Google Scholar
McMullen, P., On a problem of Klee concerning convex polytopes. Israel J. Math. 8 (1970), 1–4. [8C,14A]CrossRefGoogle Scholar
McMullen, P., Polytopes with centrally symmetric faces. Israel J. Math. 8 (1970), 194–196. [9A]CrossRefGoogle Scholar
McMullen, P., The maximum numbers of faces of a convex polytope. Mathematika 17 (1970), 179–184. [6E,8B,8C,14A]CrossRefGoogle Scholar
McMullen, P., On the upper-bound conjecture for convex polytopes. J. Combin. Theory (B) 10 (1971), 187–200. [8A,8B,8C,14A]CrossRefGoogle Scholar
McMullen, P., The minimum numbers of facets of a convex polytope. J. London Math. Soc. (2) 3 (1971), 350–354. [8D]CrossRefGoogle Scholar
McMullen, P., The numbers of faces of simplicial polytopes. Israel J. Math. 9 (1971), 570–599. [14A]CrossRefGoogle Scholar
McMullen, P., On zonotopes. Trans. Amer. Math. Soc. 159 (1971), 91–109. [6C,10C,10D]CrossRefGoogle Scholar
, P. McMullen, Representations of polytopes and polyhedral sets. Geom. Dedicata 2 (1973), 83–99. [0E,3A,3B,15C]Google Scholar
McMullen, P., Metrical and combinatorial properties of convex polytopes. In Proc. Internat. Congr. Math., Vancouver, Canada, 1974 1 (1975), 491– 495. [16B,16F,17A,17F,17H,21D]Google Scholar
McMullen, P., Space tiling zonotopes. Mathematika 22 (1975), 202–211. [11D]CrossRefGoogle Scholar
McMullen, P., Non-linear angle-sum relations for polyhedral cones and polytopes. Math. Proc. Camb. Phil. Soc. 78 (1975), 247–261. [16F,18D,18E]CrossRefGoogle Scholar
McMullen, P., Polytopes with centrally symmetric facets. Israel J. Math 23 (1976), 337–338. [9A]CrossRefGoogle Scholar
McMullen, P., Valuations and Euler-type relations on certain classes of convex polytopes. Proc. London Math. Soc. 35 (1977), 113–135. [16B] [17A,17F,17G,17H,21D]CrossRefGoogle Scholar
McMullen, P., Transforms, diagrams and representations. Contributions to Geometry (ed. Tölke, J. and Wills, J. M.), Birkhäuser (Basel, 1979), 92–130. [0E,3A,6B,7C,9C]CrossRefGoogle Scholar
McMullen, P., Convex bodies which tile space by translation. Mathematika 27 (1980), 113–121. [11B]CrossRefGoogle Scholar
McMullen, P., Convex bodies which tile space by translation: acknowledgment of priority. Mathematika 28 (1981), 191. [11B]CrossRefGoogle Scholar
, P. McMullen, Weakly continuous valuations on convex polytopes. Arch. Math. 41 (1983), 555–564. [19F]CrossRefGoogle Scholar
McMullen, P., Angle-sum relations for polyhedral sets. Mathematika 33 (1986), 175–188. [18F]CrossRefGoogle Scholar
McMullen, P., Indecomposable convex polytopes. Israel J. Math. 58 (1987), 321–323. [3C]CrossRefGoogle Scholar
McMullen, P., The polytope algebra. Advances Math. 78 (1989), 76–130. [13C,14E,17B,17C,17F,18A,18B,18C,18E,19B,19E,20F]CrossRefGoogle Scholar
McMullen, P., On simple polytopes. Invent. Math. 113 (1993), 419–444. [14,14C,14E,14F]CrossRefGoogle Scholar
McMullen, P., Valuations and dissections. Handbook of Convex Geometry (ed. Gruber, P. M. and Wills, J. M.), North-Holland (1993), 933–988. [12B] [17B,17E]CrossRefGoogle Scholar
McMullen, P., Separation in the polytope algebra. Beiträge Alg. Geom. 34 (1993), 15–30. [18D,19B]Google Scholar
McMullen, P., Weights on polytopes. Discrete Comput. Geom. 15 (1996), 363–388. [13,14C,14E,19B]CrossRefGoogle Scholar
McMullen, P., Isometry covariant valuations on convex bodies. Rend. Circ. Mat. Palermo II, Suppl. 50 (1997), 259–271. [19A,19E]Google Scholar
McMullen, P., Polytope algebras, tensor weights and piecewise polynomials. In Intuitive Geometry (ed. Szabó, L.), Bolyai Soc. Math. Stud. 6 (1997), 159–177. [19H]Google Scholar
McMullen, P., Duality, sections and projections of certain euclidean tilings. Geom. Dedicata 49 (1994), 183–202. [5A,5B,11A]CrossRefGoogle Scholar
McMullen, P., New combinations of convex sets. Geom. Dedicata 78 (1999), 1–19. [2C]CrossRefGoogle Scholar
McMullen, P., Triangulations of simplicial polytopes. Beitr. Alg. Geom. 45 (2004), 37–46. [14G]Google Scholar
McMullen, P., Fibre tilings. Mathematika 50 (2003), 1–33. [5D,5E,5F,6B] [20F]CrossRefGoogle Scholar
McMullen, P., Mixed fibre polytopes. Discrete Comput. Geom. 32 (2004), 521–532. [20A,20D,20E,20F]CrossRefGoogle Scholar
McMullen, P., Valuations and tensor weights on polytopes. Mathematika 53 (2006), 1–47. [19]CrossRefGoogle Scholar
McMullen, P., Polytopes with parathetic faces. Rev. Roumaine Math. Pures Appl. 51 (2006), 65–76. [6B]Google Scholar
McMullen, P., Convex polytopes: algebra and combinatorics. Contemp. Math. 423 (2007), 235–267. [14,14C]CrossRefGoogle Scholar
McMullen, P., Valuations on lattice polytopes. Advances Math. 220 (2009), 303–323. [21B]CrossRefGoogle Scholar
McMullen, P., Associated polyhedra and dual linear programs. Beiträge Alg. Geom. 51 (2010), 509–518. [3E]Google Scholar
McMullen, P., Translation tilings by polytopes. Symmetry: Culture and Science 22 (2011), 7–26. [11B,11D]Google Scholar
McMullen, P., Geometric Regular Polytopes (Encyclopedia of Mathematics and Its Applications 172). Cambridge University Press (Cambridge, 2020). [6A,10B]CrossRefGoogle Scholar
McMullen, P., Identifying a polytope by its fibre polytopes. Beiträge Alg. Geom. 62 (2021), 101–108. [20B,20C]CrossRefGoogle Scholar
McMullen, P., On monotypic polytopes. Discrete Comput. Geom. (to be published). [3D]Google Scholar
McMullen, P. and Schneider, R., Valuations on convex bodies. In: Convexity and its Applications (ed. Gruber, P. M. and Wills, J. M.), Birkhäuser (Basel, 1983), 170–247. [2D,16A,17A,17B]CrossRefGoogle Scholar
McMullen, P., Schneider, R. and Shephard, G. C., Monotypic polytopes and their intersection properties. Geom. Dedicata 3 (1974), 99–129. [3D,6C]CrossRefGoogle Scholar
McMullen, P. and Shephard, G. C., Diagrams for centrally symmetric polytopes. Mathematika 15 (1968), 123–138. [0E,9B]CrossRefGoogle Scholar
McMullen, P. and Shephard, G. C., Polytopes with an axis of symmetry. Canad. J. Math. 22 (1970), 265–287. [9C]CrossRefGoogle Scholar
McMullen, P.and Shephard, G. C., Convex Polytopes and the Upper-Bound Conjecture (London Math. Soc. Lecture Notes Ser. 3). Cambridge University Press (1971). [1E,6A,6B,8A,8C]Google Scholar
McMullen, P. and Walkup, D. W., A generalized lower-bound conjecture for simplicial polytopes. Mathematika 18 (1971), 264–273. [6B,14A,14G]CrossRefGoogle Scholar
Meier, C., Multilinearität bei Polyederaddition. Arch. Math. 29 (1977), 210–217. [17A,17F]CrossRefGoogle Scholar
Meyer, W. J., Indecomposable polytopes. Trans. Amer. Math. Soc. 190 (1974), 77–86. [3B]CrossRefGoogle Scholar
Minkowski, H., Allgemeine Lehrsätze über die konvexen Polyeder. Nachr. Ges. wiss. Göttingen, Math.-Phys. Kl. (1897), 198–219 (Ges. Abh., Vol. II, B. G. Teubner (Leipzig–Berlin, 1911), 103–121). [9A,15D,17A]Google Scholar
Minkowski, H., Theorie der konvexen Körper, insbesondere Begründung ihres Oberflächenbegriffs. Ges. Abh., Vol. II, B. G. Teubner (Leipzig– Berlin, 1911), 131–229. [15E,17A]Google Scholar
Mnëv, M. E., On manifolds of combinatorial types of projective configurations and convex polyhedra. Soviet Math. Doklady 32 (1985), 335–337. [6D]Google Scholar
Mnëv, M. E., The universality theorems on the classification problem of configuration varieties and convex polytope varieties. In Topology and Geometry – Rohlin Seminar (ed. O. Ya. Viro), Lecture Notes in Mathematics 1346, Springer (Heidelberg, 1988), 527–544. [6D]CrossRefGoogle Scholar
Moreau, J.-J., Proximité et dualité dans un espace hilbertien. Bull. Soc. Math. France 93 (1965), 273–299. [5B]CrossRefGoogle Scholar
Morelli, R., A theory of polyhedra. Advances Math. 97 (1993), 1–73. [16A,16F,17A,17B,17C,18A,18C]CrossRefGoogle Scholar
Morelli, R., Translation scissors congruence. Advances Math. 100 (1993), 1–27. [16A,17B]CrossRefGoogle Scholar
Motzkin, T. S., Linear Inequalities. Lecture Notes, Univ. California, Los Angeles (1951). [0E]Google Scholar
Motzkin, T. S., Comonotone curves and polyhedra. Abstract 111 in Bull. Amer. Math. Soc. 63 (1957), 35. [0E,8C]Google Scholar
Motzkin, T. S., A combinatorial result on maximally convex sets. Abstract 65T-303, Notices Amer. Math. Soc. 12 (1965), 603. [0E]Google Scholar
Murai, S. and Nevo, E., On the generalized lower bound conjecture for polytopes and spheres. Acta Math. 210 (2013), 185–202. [14G]CrossRefGoogle Scholar
Murai, S., Novik, I. and Zheng, H., Affine stresses, inverse systems, and reconstruction problems. Internat. Math. Research Notices 2024 (2024), 8540–8556. [14G]CrossRefGoogle Scholar
Nagel, U., Empty simplices of polytopes and graded Betti numbers. Discrete Comput. Geom. 39 (2008), 389–410. [14G]CrossRefGoogle Scholar
Novik, I., The lower bound theorem for centrally symmetric simple polytopes. Mathematika 46 (1999), 231–240. [14H]CrossRefGoogle Scholar
Novik, I., From acute sets to centrally symmetric 2-neighborly polytopes. SIAM J. Discrete Math. 32 (2018), 1572–1576. [9B]CrossRefGoogle Scholar
Oda, T. and Park, H. S., Linear Gale diagrams and Gelfand–Kapranov– Zelevinskiy decompositions. Tôhoku Math. J. (2) 43 (1991), 375–399. [0E,14F]CrossRefGoogle Scholar
Paffenholz, A. and Werner, A., Constructions for 4-polytopes and the cone of flag vectors. In Contemp. Math. 423 (2006), 283–303. [6A]CrossRefGoogle Scholar
Panina, G. Yu. and Streinu, I., Virtual polytopes (Russian). Uspekhi Mat. Nauk 70 (2015), 139–202. (Trans. in Russian Math. Surveys 70 (2015), 1105–1165.) [17A]CrossRefGoogle Scholar
Papadakis, S. A. and Petropou, V., The characteristic 2 anisotropicity of simplicial spheres (preprint, 2020). [14A]Google Scholar
Paterson, H. D., On the Combinatorics of Convex Polytopes. Ph.D. Thesis, University of London (2004). [13A,14E,19C]Google Scholar
Perles, M. A. and Sallee, G. T., Cell complexes, valuations and the Euler relation. Canad. J. Math. 22 (1970), 235–241. [16B]CrossRefGoogle Scholar
Perles, M. A. and Shephard, G. C., Angle sums of convex polytopes. Math. Scand. 21 (1967), 199–218. [18F]CrossRefGoogle Scholar
Pineda-Villavicencio, G., A new proof of Balinski’s theorem on the connectivity of polytopes. Discrete Math. 344 (2021), Paper No. 112408 (3 pp.). [7A]CrossRefGoogle Scholar
Poincaré, H., Sur la généralisation d’un théorème d’Euler relatif aux polyèdres. Compt. Rend. Acad. Sci. Paris 117 (1893), 144–145. [18F]Google Scholar
Pukhlikov, A. V. and Khovanski˘ı, A. G., Finitely additive measures of virtual polytopes. St. Petersburg Math. J. 4 (1993), 337–356 (trans. from Russian). [17A,17C,17E]Google Scholar
Purdy, G., Polytopes with prescribed contents of (n − 1)-facets. Israel J. Math. 30 (1978), 54–56. [15C]CrossRefGoogle Scholar
Reay, J. R., Generalizations of a Theorem of Carathéodory. Mem. Amer. Math. Soc. 54 (1965). [6C]Google Scholar
Reay, J. R., A new proof of the Bonnice–Klee theorem. Proc. Amer. Math. Soc. 16 (1965), 585–587. [6C]Google Scholar
Reeve, J. E., On the volume of lattice polyhedra. Proc. London Math. Soc. (3) 7 (1957), 378–395. [21D]CrossRefGoogle Scholar
Reeve, J. E., A further note on the volume of lattice polyhedra. J. London Math. Soc. 34 (1959), 57–62. [21D]CrossRefGoogle Scholar
Richter-Gebert, J., Realization Spaces of Polytopes. Lecture Notes in Mathematics 1643, Springer (1996). [6D]CrossRefGoogle Scholar
Richter-Gebert, J., Perspectives on Projective Geometry. Springer-Verlag (Berlin, Heidelberg, 2011). [6D]CrossRefGoogle Scholar
Richter-Gebert, J and Ziegler, G. M., Realization spaces of 4-polytopes are universal. Bull. Amer. Math. Soc., New Ser. 32 (1995), 403–412. [6D]CrossRefGoogle Scholar
Roberts, A. W. and Varberg, D. E., Convex Functions. Academic Press (1973). [4A]Google Scholar
Robinson, A., Introduction to Model Theory and to the Metamathematics of Algebra. North-Holland (Amsterdam, 1963). [0A]Google Scholar
Rockafellar, R. T., Convex Analysis. Princeton University Press (1970). [2C,4A,4B,4C,5B]CrossRefGoogle Scholar
Rosenfeld, M., Inner illumination of convex polytopes. Elem. Math. 30 (1975), 27–28. [6G]Google Scholar
Rota, G.-C., On the foundations of combinatorial theory, I: Theory of Möbius functions. Z. Wahrscheinlichkeitstheorie verw. Geb. 2 (1964), 340–368. [0F]CrossRefGoogle Scholar
Rybnikov, K., Stresses and liftings of cell-complexes. Discrete Comput. Geom. 21 (1999), 481–517. [5A,11C,13F]CrossRefGoogle Scholar
Sah, C.-H., Hilbert’s Third Problem: Scissors Congruence. Pitman (San Francisco, 1979). [12A,18E]Google Scholar
Saito, M., Hodge structure via filtered -modules. Astérisque 130 (1985), 342–351. [14E]Google Scholar
Sallee, G. T., A valuation property of Steiner points. Mathematika 13 (1966), 76–82. [2D,17G]CrossRefGoogle Scholar
Sallee, G. T., Polytopes, valuations and the Euler relation. Canad. J. Math. 20 (1968), 1412–1424. [16B,17G]CrossRefGoogle Scholar
Schneider, R., Über eine Integralgleichung in der Theorie der konvexer Körper. Math. Nachr. 101 (1970), 55–75. [10A]CrossRefGoogle Scholar
Schneider, R., Zonoids whose polars are zonoids. Proc. Amer. Math. Soc. 50 (1975), 365–368. [10B]CrossRefGoogle Scholar
Schneider, R., Neighbourliness of centrally symmetric polytopes in high dimensions. Mathematika 22 (1975), 176–181. [9B]CrossRefGoogle Scholar
Schneider, R., Polytopes and Brunn-Minkowski theory. In Polytopes: Abstract, Convex and Computational (eds. Bisztriczky, T., McMullen, P., Schneider, R. and Weiss, A. I.), NATO ASI Series C 440, Kluwer (Dordrecht etc., 1994), 273–299. [5B]CrossRefGoogle Scholar
Schneider, R., Mixed polytopes. Discrete Comput. Geom. 29 (2003), 575–593. [20,20F]CrossRefGoogle Scholar
Schneider, R., Convex Bodies: the Brunn-Minkowski Theory (second expanded edition) (Encyclopedia of Mathematics and its Applications 151). Cambridge University Press (2014). [1,1A,1E,4C,12D,15,15A,15B,15D,15E] [16F,18D]Google Scholar
Schneider, R., On a formula for the volume of polytopes. In Geometric Aspects of Functional Analysis II (Israel Seminar, 2017–2019), Lecture Notes Math. 2266 (Springer, 2020), 335–345. [12D]Google Scholar
Schützenberger, M.-P., A characteristic property of certain polynomials of Moore, E. F. and Shannon, C. E.. In RLE Progress Report 55 (Research Lab. of Electronics, MIT, 1959), 117–131. [14A]Google Scholar
Shannon, R. W., A lower bound on the number of cells in arrangements of hyperplanes. J. Combin. Theory A 20 (1976), 327–335. [10B]CrossRefGoogle Scholar
Shenfeld, Y. and van Handel, R., The extremals of the Alexandrov–Fenchel inequality for convex polytopes. Acta Math. 231 (2023), 89–204. [15A]CrossRefGoogle Scholar
Shephard, G. C., Decomposable convex polyhedra. Mathematika 10 (1963), 89–95. [2B,3C,13C]CrossRefGoogle Scholar
Shephard, G. C., The Steiner point of a convex polytope. Canad. J. Math. 18 (1966), 1294–1300. [16B,17G]CrossRefGoogle Scholar
Shephard, G. C., Polytopes with centrally symmetric faces. Canad. J. Math. 19 (1967), 1206–1213. [9A]CrossRefGoogle Scholar
Shephard, G. C., An elementary proof of Gram’s theorem for convex polytopes. Canad. J. Math. 19 (1967), 1214–1217. [18F]CrossRefGoogle Scholar
Shephard, G. C., The mean width of a convex polytope. J. London Math. Soc. 43 (1968), 207–209. [16B,17G]CrossRefGoogle Scholar
Shephard, G. C., Euler-type relations for convex polytopes. Proc. London Math. Soc. (3) 18 (1968), 597–606. [16B,17G]CrossRefGoogle Scholar
Shephard, G. C., Diagrams for positive bases. J. London Math. Soc. (2) 4 (1971), 165–175. [6C]CrossRefGoogle Scholar
Shephard, G. C., Polyhedral diagrams for sections of the non-negative orthant. Mathematika 18 (1971), 255–263. [3A,5D]CrossRefGoogle Scholar
Shephard, G. C., Spherical complexes and radial projections of polytopes. Israel J. Math. 9 (1971), 257–262. [3A,5D]CrossRefGoogle Scholar
Shephard, G. C., Combinatorial properties of associated zonotopes. Canad. J. Math. 24 (1974), 302–321. [0B,10D,10E]CrossRefGoogle Scholar
Shephard, G. C., Space-filling zonotopes. Mathematika 21 (1974), 261–269. [11D]CrossRefGoogle Scholar
Sjöberg, H. and Ziegler, G. M., Characterizing face and flag vector pairs for polytopes. Discrete Comput. Geom. 64 (2020), 174–199. [8D]CrossRefGoogle Scholar
Smilansky, Z., Convex hulls of generalized moment curves. Israel J. Math. 43 (1985), 115–128. [6F]CrossRefGoogle Scholar
Smilansky, Z., An indecomposable polytope, all of whose facets are decomposable. Mathematika 33 (1986), 192–196. [3C]CrossRefGoogle Scholar
Smilansky, Z., Decomposability of Polytopes and Polyhedra. Ph.D. Thesis, Hebrew University of Jerusalem (1986) (Hebrew, with English summary). [3C]Google Scholar
Smilansky, Z., Decomposability of polytopes and polyhedra. Geom. Ded. 24 (1987), 29–49. [3C]CrossRefGoogle Scholar
Smilansky, Z., Bi-cyclic 4-polytopes. Israel J. Math. 70 (1990), 82–92. [6F]CrossRefGoogle Scholar
Sommerville, D. M. Y., The relations connecting the angle-sum and volume of a polytope in space of n dimensions. Proc. Royal Soc. London, Ser. A 115 (1927), 103–119. [16B]Google Scholar
Spiegel, W., Ein Beitrag über additive, translationsinvariante, stetige Eikörperfunktionale. Geom. Dedicata 7 (1978), 9–19. [17A,17F]CrossRefGoogle Scholar
Stanley, R. P., The upper-bound conjecture and Cohen-Macaulay rings. Stud. Appl. Math. 54 (1975), 135–142. [14G]CrossRefGoogle Scholar
Stanley, R. P., The numbers of faces of a simplicial convex polytope. Advances Math. 35 (1980), 236–238. [14C,14E,14F]CrossRefGoogle Scholar
Stanley, R. P., Decompositions of rational convex polytopes. Ann. Discrete Math. 6 (1980), 333–342. [21D]CrossRefGoogle Scholar
Stanley, R. P., Generalized h-vectors, intersection cohomology of toric varieties, and related results. In Commutative Algebra and Combinatorics (ed. Nagata, M. and Matsumura, H.), Advanced Studies in Pure Mathematics 11 (Kinokuniya, Tokyo and North-Holland, New York, 1987), 187–213. [14E]CrossRefGoogle Scholar
Stanley, R. P., On the number of faces of centrally symmetric simplicial polytopes. Graphs Comb. 3 (1987), 55–66. [14H]CrossRefGoogle Scholar
Stanley, R. P., A survey of Eulerian posets. Polytopes: Abstract, Convex and Computational (ed. Bisztriczky, T., McMullen, P., Schneider, R. and Weiss, A. I.), NATO ASI Series C 440, Kluwer Academic Publishers (Dordrecht, 1994), 187–213. [14A,14E]Google Scholar
Stanley, R. P., Combinatorics and Commutative Algebra (2nd edition). Birkhäuser (Basel, 1996). [14G]Google Scholar
Stein, R., Additivität und Einschließungs-Ausschließungsprinzip für Funktionale von Gitterpolytopen. Dissertation (Dortmund, 1982). [21B]Google Scholar
Sylvester, J. J., Mathematical question 11851. The Educational Times 59 (1893), 98. [10B]Google Scholar
Tay, T.-S., White, N. and Whitely, W., Skeletal rigidity of simplicial complexes. European J. Combin. 16 (1995), 381–403, 503–523. [13F,14G]CrossRefGoogle Scholar
Thompson, A. C., Minkowski Geometry (Encyclopedia of Mathematics and its Applications 63). Cambridge University Press (1996). [12C]Google Scholar
Thorpe, B. (editor), The Anglo-Saxon Chronicle. Longman, Green, Longman and Roberts (London, 1861). [12B]Google Scholar
Timorin, V. A., An analogue of the Hodge–Riemann relations for simple convex polytopes (Russian). Uspekhi Mat. Nauk 54 (1999), 113–162. (Trans. in Russian Math. Surveys 54 (1999), 381–426.) [14E]Google Scholar
Timorin, V. A., On polytopes that are simple at the edges (Russian). Funktsional’nyi Analiz i ego Prilozheniya 35 (2001), 36–47. (Trans. in Functional Analysis and its Applications 35 (2001), 189–198.) [14E]Google Scholar
Venkov, B. A., On a class of euclidean polytopes (Russian). Vestnik Leningr. Univ. (Ser. Mat. Fiz. Him.) 9 (1954), 11–31. [11B]Google Scholar

Accessibility standard: Unknown

Why this information is here

This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

Accessibility Information

Accessibility compliance for the PDF of this chapter is currently unknown and may be updated in the future.

Save book to Kindle

To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • References
  • Peter McMullen, University College London
  • Book: Convex Polytopes and Polyhedra
  • Online publication: 22 December 2025
  • Chapter DOI: https://doi.org/10.1017/9781009699976.025
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • References
  • Peter McMullen, University College London
  • Book: Convex Polytopes and Polyhedra
  • Online publication: 22 December 2025
  • Chapter DOI: https://doi.org/10.1017/9781009699976.025
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • References
  • Peter McMullen, University College London
  • Book: Convex Polytopes and Polyhedra
  • Online publication: 22 December 2025
  • Chapter DOI: https://doi.org/10.1017/9781009699976.025
Available formats
×