2000 character limit reached
Flip-connectivity of triangulations of the product of a tetrahedron and simplex
Published 22 Jan 2016 in math.CO | (1601.06031v1)
Abstract: A flip is a minimal move between two triangulations of a polytope. An open question is whether any two triangulations of the product of two simplices can be connected through a series of flips. This was proven in the case where one of the simplices is a triangle by Santos in 2005. In this paper we extend this to when one of the simplices is a tetrahedron.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.