... Convex Regular Icosahedron is composed by regular tetrahedral). Each n-simplex has edges, In n-polytope, how can calculate the maximum number of n-simplex edges that meets into a single n-simplex vertice?
Google - Imagine we have a regular convex n-polytope composed by a number of n-simplex. (For example
Details:
Added 3+ months ago:
I am interested to find a formula for calculating the number of direction from a point in n-dimensional tessellated space. The space is composed by n-simplex. In any vertices of n-simplexes meets a number of edges of n-sinplexes and i want to find how many meets into a single vertices to full the entire n-dimensional space around.
Added 3+ months ago:
For example: in 2 dimensional tessellated space with equilateral triangle, 6 edges meets in a single vertice. The meeting point is the center of hexagon. In 3 dimensional tessellated space with regulated tetrahedron, 12 edges meets in a single vertices. The meeting point is the center of regular convex icosahedron. But for 4 dimensional tessellated space? Or for n dimensional tessellated space?