答辩人：Anwita Bhowmik博士后、Aleksandr Valiuzhenich博士后

答辩委员会组成：

主席：宗传明天津大学教授；

委员（按姓氏音序排序）：

冯荣权：北京大学教授

傅士硕：重庆大学教授

林辉球：华东理工大学教授

王卫：西安交通大学教授

吴耀坤：上海交通大学教授

周进鑫：北京交通大学教授

秘书：张闫博河北师范大学副教授；

合作导师：苑立平  河北师范大学教授、 Sergey Goriainov 河北师范大学教授

Anwita Bhowmik is a postdoctoral researcher in the School of Mathematical Sciences at Hebei Normal University, China. Her research lies at the intersection of algebraic graph theory, algebraic combinatorics, and number theory, with particular emphasis on divisible design graphs, strongly regular graphs, and Paley-type constructions over finite fields. Very recently, she is also exploring some problems in certain subclasses of power semigroups. She holds a Ph.D. in Mathematics from the Indian Institute of Technology Guwahati, India. Prior to her doctoral studies, she earned her M.Sc. and B.Sc. (Honours) in Mathematics from Jadavpur University, India.

She has coauthored several research papers in international journals such as Discrete Mathematics, Designs, Codes and Cryptography, Graphs and Combinatorics, and Research in Number Theory.

Alexandr Valyuzhenich received his PhD in Mathematics from Novosibirsk State University (Russia) in 2015. He was a junior researcher (June 2015 - December 2015), a researcher (January 2016 - August 2021) and a senior researcher (August 2021 - April 2022) at Sobolev Institute of Mathematics (Novosibirsk, Russia). He was a postdoctoral researcher (April 2022 - December 2023) at 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. He has 26 published papers. In particular, he has papers in such journals as Discrete Mathematics, The Electronic Journal of Combinatorics, Linear Algebra and its Applications and Discrete Applied Mathematics.