Geodesic
Almost Simplicial Polytopes: The Lower and Upper Bound Theorems
Canadian journal of mathematics, Tome 72 (2020) no. 2, pp. 537-556

Voir la notice de l'article provenant de la source Cambridge University Press

We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called almost simplicial polytopes. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$, and $s$, thus generalizing the classical Lower Bound Theorem by Barnette and the Upper Bound Theorem by McMullen, which treat the case where $s=0$. We characterize the minimizers and provide examples of maximizers for any $d$. Our construction of maximizers is a generalization of cyclic polytopes, based on a suitable variation of the moment curve, and is of independent interest.
DOI : 10.4153/S0008414X18000123
Mots-clés : polytope, simplicial polytope, almost simplicial polytope, Lower Bound theorem, Upper Bound theorem, graph rigidity, h-vector, f-vector 
Nevo, Eran; Pineda-Villavicencio, Guillermo; Ugon, Julien; Yost, David. Almost Simplicial Polytopes: The Lower and Upper Bound Theorems. Canadian journal of mathematics, Tome 72 (2020) no. 2, pp. 537-556. doi: 10.4153/S0008414X18000123
@article{10_4153_S0008414X18000123,
     author = {Nevo, Eran and Pineda-Villavicencio, Guillermo and Ugon, Julien and Yost, David},
     title = {Almost {Simplicial} {Polytopes:} {The} {Lower} and {Upper} {Bound} {Theorems}},
     journal = {Canadian journal of mathematics},
     pages = {537--556},
     year = {2020},
     volume = {72},
     number = {2},
     doi = {10.4153/S0008414X18000123},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/S0008414X18000123/}
}
TY  - JOUR
AU  - Nevo, Eran
AU  - Pineda-Villavicencio, Guillermo
AU  - Ugon, Julien
AU  - Yost, David
TI  - Almost Simplicial Polytopes: The Lower and Upper Bound Theorems
JO  - Canadian journal of mathematics
PY  - 2020
SP  - 537
EP  - 556
VL  - 72
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.4153/S0008414X18000123/
DO  - 10.4153/S0008414X18000123
ID  - 10_4153_S0008414X18000123
ER  - 
%0 Journal Article
%A Nevo, Eran
%A Pineda-Villavicencio, Guillermo
%A Ugon, Julien
%A Yost, David
%T Almost Simplicial Polytopes: The Lower and Upper Bound Theorems
%J Canadian journal of mathematics
%D 2020
%P 537-556
%V 72
%N 2
%U http://geodesic.mathdoc.fr/articles/10.4153/S0008414X18000123/
%R 10.4153/S0008414X18000123
%F 10_4153_S0008414X18000123

[1] Adiprasito, K. A. and Sanyal, R., Relative Stanley–Reisner theory and upper bound theorems for Minkowski sums. Publ. Math. Inst. Hautes Études Sci. 124(2016), 99–163. https://doi.org/10.1007/s10240-016-0083-7. Google Scholar

[2] Asimow, L. and Roth, B., The rigidity of graphs. Trans. Amer. Math. Soc. 245(1978), 279–289. https://doi.org/10.2307/1998867. Google Scholar

[3] Asimow, L. and Roth, B., The rigidity of graphs. II. J. Math. Anal. Appl. 68(1979), 171–190. https://doi.org/10.1016/0022-247X(79)90108-2. Google Scholar

[4] Barnette, D. W., The minimum number of vertices of a simple polytope. Israel J. Math. 10(1971), 121–125. https://doi.org/10.1007/BF02771522. Google Scholar

[5] Barnette, D. W., A proof of the lower bound conjecture for convex polytopes. Pacific J. Math. 46(1973), 349–354. Google Scholar

[6] 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 Ser. A 31(1981), 237–255. https://doi.org/10.1016/0097-3165(81)90058-3. Google Scholar

[7] Billera, L. J. and Lee, C. W., The numbers of faces of polytope pairs and unbounded polyhedra. European J. Combin. 2(1981), no. 4, 307–322. https://doi.org/10.1016/S0195-6698(81)80037-6. Google Scholar

[8] Braden, T., Remarks on the combinatorial intersection cohomology of fans. Pure Appl. Math. Q. 2(2006), no. 4, 1149–1186. https://doi.org/10.4310/PAMQ.2006.v2.n4.a10. Google Scholar

[9] Braden, T. and Macpherson, R. D., Intersection homology of toric varieties and a conjecture of Kalai. Comment. Math. Helv. 74(1999), no. 3, 442–455. https://doi.org/10.1007/s000140050098. Google Scholar

[10] Brøndsted, A., An introduction to convex polytopes. Graduate Texts in Mathematics, 90, Springer-Verlag, New York–Berlin, 1983. Google Scholar

[11] Bruggesser, H. and Mani, P., Shellable decompositions of cells and spheres. Math. Scand. 29(1971), 197–205. https://doi.org/10.7146/math.scand.a-11045. Google Scholar

[12] Goodman, J. E. and O’Rourke, J., eds. Handbook of discrete and computational geometry, Second ed., Discrete Mathematics and its Applications (Boca Raton), Chapman & Hall/CRC, Boca Raton, FL, 2004. https://doi.org/10.1201/9781420035315. Google Scholar

[13] Grünbaum, B., Convex polytopes, Second ed., Graduate Texts in Mathematics, 221, Springer-Verlag, New York, 2003. https://doi.org/10.1007/978-1-4613-0019-9. Google Scholar

[14] Kalai, G., Rigidity and the lower bound theorem. I. Invent. Math. 88(1987), no. 1, 125–151. https://doi.org/10.1007/BF01405094. Google Scholar

[15] Kalai, G., Some aspects of the combinatorial theory of convex polytopes. In: Polytopes: abstract, convex and computational (Scarborough, ON, 1993). NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., 440, Kluwer Acad. Publ., Dordrecht, 1994, pp. 205–229. Google Scholar

[16] Karavelas, M. I. and Tzanaki, E., The maximum number of faces of the Minkowski sum of two convex polytopes. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 2012, pp. 11–22. Google Scholar

[17] Karu, K., Hard Lefschetz theorem for nonrational polytopes. Invent. Math. 157(2004), 419–447. https://doi.org/10.1007/s00222-004-0358-3. Google Scholar

[18] Kolins, S., f-vectors of triangulated balls. Discrete Comput. Geom. 46(2011), 427–446. https://doi.org/10.1007/s00454-010-9300-1. Google Scholar

[19] Mcmullen, P., The maximum numbers of faces of a convex polytope. Mathematika 17(1970), 179–184. https://doi.org/10.1112/S0025579300002850. Google Scholar

[20] Mcmullen, P., The numbers of faces of simplicial polytopes. Israel J. Math. 9(1971), 559–570. https://doi.org/10.1007/BF02771471. Google Scholar

[21] Mcmullen, P. and Walkup, D. W., A generalized lower-bound conjecture for simplicial polytopes. Mathematika 18(1971), 264–273. https://doi.org/10.1112/S0025579300005520. Google Scholar

[22] Murai, S. and Nevo, E., On the generalized lower bound conjecture for polytopes and spheres. Acta Math. 210(2013), no. 1, 185–202. https://doi.org/10.1007/s11511-013-0093-y. Google Scholar

[23] Nevo, E. and Novinsky, E., A characterization of simplicial polytopes with g = 1. J. Combin. Theory Ser. A 118(2011), 387–395. https://doi.org/10.1016/j.jcta.2009.12.011. Google Scholar

[24] Stanley, R. P., The number of faces of a simplicial convex polytope. Adv. Math. 35(1980), 236–238. https://doi.org/10.1016/0001-8708(80)90050-X. Google Scholar

[25] Stanley, R. P., Generalized H-vectors, intersection cohomology of toric varieties, and related results. In: Commutative algebra and combinatorics (Kyoto, 1985). Adv. Stud. Pure Math., 11, North-Holland, Amsterdam, 1987, pp. 187–213. Google Scholar

[26] Whiteley, W., Infinitesimally rigid polyhedra. I. Statics of frameworks. Trans. Amer. Math. Soc. 285(1984), no. 2, 431–465. https://doi.org/10.2307/1999446. Google Scholar

[27] Ziegler, G. M., Lectures on polytopes. Graduate Texts in Mathematics, 152, Springer-Verlag, New York, 1995. https://doi.org/10.1007/978-1-4613-8431-1. Google Scholar

Cité par Sources :