Knowledge

Simplicial sphere

Source đź“ť

293:, proved in 1979 by Billera and Lee (existence) and Stanley (necessity). It has been conjectured that the same conditions are necessary for general simplicial spheres. The conjecture was proved by 68:, which asks about possible numbers of faces of different dimensions of a simplicial sphere. In December 2018, the g-conjecture was proven by 353: 206:
constructed an example of a non-polytopal simplicial sphere (that is, a simplicial sphere that is not the boundary of a polytope).
420: 439: 282:-spheres. In other words, what are the possible sequences of numbers of faces of each dimension for a simplicial 306: 210:
proved that, in fact, "most" simplicial spheres are non-polytopal. The smallest example is of dimension
181: 193: 105:, i.e. a simplicial sphere of dimension 1. This construction produces all simplicial circles. 161: 8: 225: 57:, however, in higher dimensions most simplicial spheres cannot be obtained in this way. 408: 329: 261: 40: 203: 444: 416: 395: 378: 390: 294: 69: 144: 140: 54: 328:
Adiprasito, Karim (2019). "Combinatorial Lefschetz theorems beyond positivity".
415:. Progress in Mathematics. Vol. 41 (Second ed.). Boston: Birkhäuser. 257: 189: 65: 433: 132: 21: 43: 274:, formulated by McMullen in 1970, asks for a complete characterization of 200:
implying that any simplicial 2-sphere is a boundary of a convex polytope.
136: 121: 86: 256:
vertices. This conjecture was proved for simplicial convex polytopes by
117: 109: 286:-sphere? In the case of polytopal spheres, the answer is given by the 207: 334: 47: 17: 180:= 4 is realized by the tetrahedron. By repeatedly performing the 354:"Amazing: Karim Adiprasito proved the g-conjecture for spheres!" 72:
in the more general context of rational homology spheres.
184:, it is easy to construct a simplicial sphere for any 53:. Some simplicial spheres arise as the boundaries of 379:"On the upper-bound conjecture for convex polytopes" 431: 60:One important open problem in the field was the 327: 394: 383:Journal of Combinatorial Theory, Series B 333: 376: 264:for general simplicial spheres in 1975. 196:(or edge graphs) of convex polytopes in 407: 432: 413:Combinatorics and commutative algebra 351: 127:More generally, the boundary of any ( 347: 345: 323: 321: 228:gives upper bounds for the numbers 13: 164:that any simplicial 2-sphere with 116:with triangular faces, such as an 14: 456: 342: 318: 370: 1: 312: 194:characterization of 1-skeleta 176:− 4 faces. The case of 155: 396:10.1016/0095-8956(71)90042-6 7: 300: 124:, is a simplicial 2-sphere. 75: 10: 461: 307:Dehn–Sommerville equations 352:Kalai, Gil (2018-12-25). 241:-faces of any simplicial 108:The boundary of a convex 440:Algebraic combinatorics 278:-vectors of simplicial 182:barycentric subdivision 358:Combinatorics and more 377:McMullen, P. (1971). 172:− 6 edges and 2 226:upper bound theorem 51:-dimensional sphere 297:in December 2018. 41:simplicial complex 103:simplicial circle 452: 426: 409:Stanley, Richard 401: 400: 398: 374: 368: 367: 365: 364: 349: 340: 339: 337: 325: 295:Karim Adiprasito 160:It follows from 147:is a simplicial 131:+1)-dimensional 70:Karim Adiprasito 64:, formulated by 55:convex polytopes 460: 459: 455: 454: 453: 451: 450: 449: 430: 429: 423: 404: 375: 371: 362: 360: 350: 343: 326: 319: 315: 303: 262:Richard Stanley 260:in 1970 and by 251: 236: 220: 204:Branko GrĂĽnbaum 188:≥ 4. Moreover, 162:Euler's formula 158: 145:Euclidean space 141:convex polytope 100: 78: 12: 11: 5: 458: 448: 447: 442: 428: 427: 421: 403: 402: 369: 341: 316: 314: 311: 310: 309: 302: 299: 258:Peter McMullen 249: 232: 221:= 8 vertices. 218: 190:Ernst Steinitz 168:vertices has 3 157: 154: 153: 152: 125: 106: 96: 77: 74: 66:Peter McMullen 9: 6: 4: 3: 2: 457: 446: 443: 441: 438: 437: 435: 424: 422:0-8176-3836-9 418: 414: 410: 406: 405: 397: 392: 388: 384: 380: 373: 359: 355: 348: 346: 336: 331: 324: 322: 317: 308: 305: 304: 298: 296: 292: 290: 285: 281: 277: 273: 271: 265: 263: 259: 255: 248: 245:-sphere with 244: 240: 235: 231: 227: 222: 217: 213: 209: 205: 201: 199: 195: 191: 187: 183: 179: 175: 171: 167: 163: 150: 146: 142: 139:) simplicial 138: 134: 130: 126: 123: 119: 115: 111: 107: 104: 99: 95: 92: 90: 84: 80: 79: 73: 71: 67: 63: 58: 56: 52: 50: 45: 42: 38: 36: 31: 30:combinatorial 27: 23: 22:combinatorics 19: 412: 386: 382: 372: 361:. Retrieved 357: 288: 287: 283: 279: 275: 269: 268: 266: 253: 246: 242: 238: 233: 229: 223: 215: 214:= 4 and has 211: 202: 197: 185: 177: 173: 169: 165: 159: 148: 128: 113: 102: 97: 93: 88: 82: 62:g-conjecture 61: 59: 48: 44:homeomorphic 34: 33: 29: 25: 15: 389:: 187–200. 272:-conjecture 122:icosahedron 434:Categories 363:2018-12-25 335:1812.10454 313:References 156:Properties 118:octahedron 110:polyhedron 26:simplicial 208:Gil Kalai 85:≥ 3, the 445:Topology 411:(1996). 301:See also 291:-theorem 151:-sphere. 81:For any 76:Examples 18:geometry 192:gave a 143:in the 137:bounded 133:compact 87:simple 46:to the 37:-sphere 419:  91:-cycle 330:arXiv 101:is a 39:is a 417:ISBN 267:The 224:The 135:(or 28:(or 24:, a 20:and 391:doi 237:of 120:or 112:in 16:In 436:: 387:10 385:. 381:. 356:. 344:^ 320:^ 252:= 32:) 425:. 399:. 393:: 366:. 338:. 332:: 289:g 284:d 280:d 276:f 270:g 254:n 250:0 247:f 243:d 239:i 234:i 230:f 219:0 216:f 212:d 198:R 186:n 178:n 174:n 170:n 166:n 149:d 129:d 114:R 98:n 94:C 89:n 83:n 49:d 35:d

Index

geometry
combinatorics
simplicial complex
homeomorphic
d-dimensional sphere
convex polytopes
Peter McMullen
Karim Adiprasito
simple n-cycle
polyhedron
octahedron
icosahedron
compact
bounded
convex polytope
Euclidean space
Euler's formula
barycentric subdivision
Ernst Steinitz
characterization of 1-skeleta
Branko GrĂĽnbaum
Gil Kalai
upper bound theorem
Peter McMullen
Richard Stanley
Karim Adiprasito
Dehn–Sommerville equations


arXiv

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

↑