Abstract
We give new lower bounds for the minimal number of simplices needed in a triangulation of the product of two convex polygons, improving the lower bounds in Bowen et al. (Topology 44:321–339, 2005).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
