报告题目：Tiling sets and perfect codes
报告人：张韬
邀请人：罗荣
时间： 2026年5月25日（星期一）下午14:30
地点：西南交通大学犀浦校区7号教学楼X7510
摘要：Tiling problems lie at the heart of discrete geometry and have garnered significant attention from researchers. Perfect codes, known for their optimal error-correcting capabilities, represent one of the most fundamental classes of codes. Interestingly, perfect codes can also be interpreted as tilings by certain geometric structures. In this talk, we begin with a theoretical investigation of tiling: the Fuglede conjecture. We then turn to the study of the existence of various types of perfect codes from an applied perspective, including the Golomb-Welch conjecture, the Etzion-Horak-AlBdaiwi conjecture, and the existence of perfect codes for limited-magnitude error balls.
报告人简介：张韬，西安电子科技大学教授。主要研究兴趣包括：离散几何、极值组合、组合设计和编码理论。迄今为止，在Science China Mathematics、Combinatorica、Applied and Computational Harmonic Analysis、Journal of Combinatorial Theory, Series A、IEEE Transactions on Information Theory等国际重要期刊发表论文30余篇。目前受邀担任IEEE Transactions on Information Theory杂志的Associate Editor。主持国家自然科学基金青年项目、面上项目各一项；陕西省自然科学基金面上项目一项。入选陕西省三秦英才引进计划青年项目和2024年度小米青年学者。曾获2019年度Kirkman奖章、2019年度新世界数学奖博士论文优胜奖和浙江省优博。
