时间: 2025年5月6日 下午14:00-16:00
地点: Cybersecurity Innovation Building A-1236（网络安全创新大楼12楼A-1236）,
腾讯会议: 529-195-633
报告人: Ben Lund (Institute for Basic Science, Korea)
题目: Embedding distance graphs into subsets of finite vector spaces
摘要: Iosevich and Rudnev showed that every sufficiently large subset of a finite vector space determines every (algebraically defined) distance. I will talk about how to use their result, in combination with techniques developed in the study of pseudorandom graphs, to embed large classes of nearly spanning graphs of distances in arbitrary subsets of finite vector spaces. I will mention results from two recent papers, one joint with Debsoumya Chakraborti and the other with Chuandong Xu.
