Skip to main content
Commonmark migration
Source Link

##Eberhard Theorem

Eberhard Theorem

##Extensions of Eberhard theorem

Extensions of Eberhard theorem

##High dimensions

High dimensions

###2-dimensional faces

2-dimensional faces

###Stacked polytopes

Stacked polytopes

##Eberhard Theorem

##Extensions of Eberhard theorem

##High dimensions

###2-dimensional faces

###Stacked polytopes

Eberhard Theorem

Extensions of Eberhard theorem

High dimensions

2-dimensional faces

Stacked polytopes

replaced http://mathoverflow.net/ with https://mathoverflow.net/
Source Link

Perhaps an even more natural extension is to consider the type of facets a given d-simensional polytope have. You can ask for a simple 4 polytope (a 4-polytope whose graph is 4-regular) what are the number of facets $p_Q$ isomorphic to a given 3-polytope Q. This gives you a vector indexed by combinatorial types of simple 3-polytopes, but I am not aware of any Eberhard type theorem and I do not know even which 3-polytopes should be considered as the analogs of the hexagons in the above formula. Dually stated and extented to triangulations of 3-spheres the question is to associate to a triangulated 3-simensional sphere (or just simplicial 3-polytope) the list of links of vertices (with multiplicities) it has. A related MO question is this onethis one.

Perhaps an even more natural extension is to consider the type of facets a given d-simensional polytope have. You can ask for a simple 4 polytope (a 4-polytope whose graph is 4-regular) what are the number of facets $p_Q$ isomorphic to a given 3-polytope Q. This gives you a vector indexed by combinatorial types of simple 3-polytopes, but I am not aware of any Eberhard type theorem and I do not know even which 3-polytopes should be considered as the analogs of the hexagons in the above formula. Dually stated and extented to triangulations of 3-spheres the question is to associate to a triangulated 3-simensional sphere (or just simplicial 3-polytope) the list of links of vertices (with multiplicities) it has. A related MO question is this one.

Perhaps an even more natural extension is to consider the type of facets a given d-simensional polytope have. You can ask for a simple 4 polytope (a 4-polytope whose graph is 4-regular) what are the number of facets $p_Q$ isomorphic to a given 3-polytope Q. This gives you a vector indexed by combinatorial types of simple 3-polytopes, but I am not aware of any Eberhard type theorem and I do not know even which 3-polytopes should be considered as the analogs of the hexagons in the above formula. Dually stated and extented to triangulations of 3-spheres the question is to associate to a triangulated 3-simensional sphere (or just simplicial 3-polytope) the list of links of vertices (with multiplicities) it has. A related MO question is this one.

deleted 232 characters in body
Source Link
Gil Kalai
  • 24.7k
  • 38
  • 235
  • 327

A related question that was studied in several papers is: for which d-polytopes P there is a (d+1) polytopes Q such that all faces of Q are isomorphic to P. Such polytopes P are called "facets". An intriguing open problem is if the icosahedron is a facet. Update: Karim Adiprasito and Guenter Ziegler have just shown that the answer is no. (For all other regular polytopes P it is known that P is a facet only if there is a regular (d+1)-polytope all whose facets are isomorphic to P.

A related question that was studied in several papers is: for which d-polytopes P there is a (d+1) polytopes Q such that all faces of Q are isomorphic to P. Such polytopes P are called "facets". An intriguing open problem is if the icosahedron is a facet. Update: Karim Adiprasito and Guenter Ziegler have just shown that the answer is no. (For all other regular polytopes P it is known that P is a facet only if there is a regular (d+1)-polytope all whose facets are isomorphic to P.

A related question that was studied in several papers is: for which d-polytopes P there is a (d+1) polytopes Q such that all faces of Q are isomorphic to P. Such polytopes P are called "facets". An intriguing open problem is if the icosahedron is a facet.

added 88 characters in body
Source Link
Gil Kalai
  • 24.7k
  • 38
  • 235
  • 327
Loading
added 433 characters in body
Source Link
Gil Kalai
  • 24.7k
  • 38
  • 235
  • 327
Loading
added 838 characters in body
Source Link
Gil Kalai
  • 24.7k
  • 38
  • 235
  • 327
Loading
added 1259 characters in body; deleted 2 characters in body
Source Link
Gil Kalai
  • 24.7k
  • 38
  • 235
  • 327
Loading
added 2 characters in body
Source Link
Gil Kalai
  • 24.7k
  • 38
  • 235
  • 327
Loading
added 728 characters in body
Source Link
Gil Kalai
  • 24.7k
  • 38
  • 235
  • 327
Loading
added 951 characters in body
Source Link
Gil Kalai
  • 24.7k
  • 38
  • 235
  • 327
Loading
Post Made Community Wiki
Source Link
Gil Kalai
  • 24.7k
  • 38
  • 235
  • 327
Loading