Academic Report of School of Mathematical Sciences [2026] No. 113
(Series Report for High-Level University Construction No. 1372)
Title:The Acyclicity and Undecidability of Tight Tiling
Speaker:Professor Yang Chao (Guangdong University of Foreign Studies)
Time:14:30-15:30, Nov. 13, 2026
Location:Room 1420, Huiwen Building, Yuehai Campus
Abstract:The second part of Hilbert’s 18th Problem indicates that researchers in the early 20th century were not yet aware of the potential for non-periodicity and undecidability in the tiling problem. The first breakthrough in this area stemmed from the “Wang Tile” tiling problem proposed by Hao Wang in 1961. This report reviews the research history and latest developments regarding non-periodicity and undecidability in translation tilings, and presents some of our recent work. Finally, we introduce one of the over 700 results released by OpenAI on October 6, 2026, which concerns non-periodicity in translation tilings of a single tile in three-dimensional space.
Speaker Profile:Yang Chao is an associate professor and master’s advisor at the School of Mathematics and Statistics, Guangdong University of Foreign Studies, and serves as the chair of the Department of Mathematics Education. He earned both his bachelor’s and doctoral degrees (through an integrated master’s-to-Ph.D. program) from the University of Science and Technology of China. He previously served as a lecturer and associate researcher at the School of Mathematics, Sun Yat-sen University, and as a postdoctoral researcher in the Department of Mathematics at Texas State University. He has led and completed two projects funded by the National Natural Science Foundation of China and has published more than 40 academic papers in domestic and international journals, including Proceedings of the AMS, Discrete & Computational Geometry, Science in China: Mathematics (Chinese and English editions), Acta Mathematica Sinica (English edition), Journal of the Operations Research Society of China, Discrete Mathematics, Theoretical Computer Science, and Discrete Applied Mathematics. His primary research areas include tessellation problems in discrete geometry, as well as computational complexity in graph theory and combinatorial game theory.
Faculty and students are welcome to attend!
Invited by: Zhou Ze
School of Mathematical Sciences
November 10, 2026