Kyle Huang

Mathematics PhD student at BTU Cottbus, supported by the DFG priority program SPP 2458 Project "Combinatorial Synergies", residing in Berlin. I am co-advised by Gennadiy Averkov, Giulia Codenotti, and Ansgar Freyer, with projected end date in Fall 2027. My research interests include smooth polytopes, lattice width, unimodular triangulations, and more broadly toric geometry and geometry of numbers.

Email: krhuang5@gmail.com

GitHub: https://github.com/krhuang

Last Update: 17.05.26

SmoothGeneration

As part of my Master's Thesis I implemented a novel algorithm to generate all smooth 3-polytopes with <= 50 lattice points (previous work by Lundman went to 16). The data and the codebase can be found on the GitHub repository.

UniTriSat: Unimodular Triangulations via SATISFIABILITY

Robert Lauff, Charles Zhang, and I implemented a novel algorithm to check if a lattice polytope has a unimodular triangulation, via SAT-solvers. This ongoing work can be found at the UniTriSat GitHub repository. Currently the working code can check if a 3-polytope with 35 lattice points has a unimodular triangulation in around .2 seconds! Please write us if you have any lattice polytopes for which you would like to check for unimodular triangulations.

Villa Student Seminar

Together with Matthew Dupraz and Katarina Krivokuća we organize the Villa Student Seminar. Please email me if you would like to attend or be added to the mailing list.

Publications

Talks & Poster Presentations