Math

Conjecture, Stefan Langerman 2015:

A polytope that monohedrally tiles ℝ^d is a c-DDT if all of its facet-unfoldings tile ℝ^d, and every polytope has a facet-unfolding that tiles ℝ^d-1. The polytope must then have a facet-unfolding that tiles ℝ^d-2 and so on till an edge-unfolding that tiles ℝ^d-1 polytope has a facet-unfolding that tiles ℝ^d-3. The polytope must then have a facet-unfolding that tiles ℝ^d-1 and so on till an edge-unfolding that tiles ℝ²

At the time of publication, I was a 16 and belived to be the youngest author in the conference's history

Japan Conference on Discrete and Computational Geometry, Graphs, and Games JCDCG3 2022

At the time of publication, I was a 16 and belived to be the youngest author in the conference's history

Computational Geometry Research