Minimum supports of eigenfunctions of Hamming graphs

主 讲 人 ：Alexandr Valyuzhenich    

活动时间：11月21日19时00分    

地      点 ：数学科学学院D203报告厅（Zoom 会议： https://us06web.zoom.us/j/84475767730?pwd=nSJeFrqBeJzesc3EMCO6pbwhLBdMtD.1 （会议号: 844 7576 7730 ；密码: 090149）

讲座内容：

Let G be a graph and λ be an eigenvalue of G.What is the minimum cardinality of the support of a λ-eigenfunction of G? We will survey results on this problem in the special case where G is the Hamming graph H (n, q), that is, the simple graph whose vertex set is the direct product of n copies of the integers modulo q, with two vertices adjacent if and only if they differ in exactly one position. Additionally, we will discuss applications of these results to the theory of perfect bitrades and to coding theory.

主讲人介绍：

Alexandr Valyuzhenich defended his PhD thesis at Novosibirsk State University (Russia) in 2015. He was a junior researcher (June 2015 - Dec 2015), a researcher (Jan 2016 - Aug 2021), and a senior researcher (Aug 2021 - Apr 2022) at the Sobolev Institute of Mathematics (Novosibirsk, Russia). He was a postdoctoral researcher (Apr 2022 - Dec 2023) at the Moscow Institute of Physics and Technology (Moscow, Russia). At the end of 2023, he joined Hebei Normal University as a postdoctoral researcher. His main research interests are algebraic graph theory, coding theory, combinatorics on words, and permutation patterns.

发布时间：2024-11-19 10:10:18