5779 dimensional polytopes
Source: 2019 Israel Olympic Revenge, P2
June 11, 2022
combinatorical geometrycombinatoricsolympic revenge
Problem Statement
A -dimensional polytope is call a -tope if it has exactly -dimensional faces. Find all sequences of nonnegative integers, not all , such that the following condition holds:It is possible to tesselate every -dimensional polytope with convex -dimensional polytopes, such that the number of -topes in the tessellation is proportional to , while there are no -topes in the tessellation if .