-
报告题目：Semidefinite Programming Bounds for Designs on Spheres and Hamming Spaces报告人：Wei-Hsuan Yu时间：2026年9月29日14:00-15:00地点：第四教学楼215摘要：We use semidefinite programming(SDP) methods for spherical codes and energy minimization to improve lower bounds for designs on spheres and Hamming spaces in low-dimensional cases. In particular, we use the SDP to improve the bounds for Hamming designs (or orthogonal arrays, equivalently) and the harmonic index 4-designs on spheres.报告人简介：Wei-Hsuan Yu is an associate professor in the Department of Mathematics at National Central University. He received his Ph.D. in Mathematics from the University of Maryland, College Park, under the supervision of Professor Alexander Barg. He was a fixed-term assistant professor at Michigan State University and a postdoctoral researcher at ICERM, Brown University.His research interests include algebraic combinatorics, discrete geometry, and coding theory, with a particular focus on two-distance sets, equiangular lines, and combinatorial designs. He has published many papers in highly prestigious journals such as Advances in Mathematics, Journal of Combinatorial Theory Series A, Physical Review Letters. Professor Yu is supported from Ministry of Science and Technology’s Outstanding Young Scholars Research Program, the NCTS Young Theorist Award.
2026-09-28
-
报告题目：Unit gain graphs with two eigenvalues and lines in complex space with few angles报告人：Edwin van Dam时间：2026年9月29日（星期二）下午13:00地点：第四教学楼 215教室摘要：Since the introduction of the Hermitian adjacency matrix for digraphs, interest in so-called complex unit gain graphs has surged. In this talk, we consider such gain graphs with two distinct eigenvalues. Analogously to (undirected) graphs whose traditional adjacency matrix has few distinct eigenvalues, a great deal of structural symmetry is required. Besides combinatorial considerations, also the representation by lines in complex space is essential in the study of considered gain graphs. Examples are drawn from various relevant concepts from quantum information theory related to lines in complex space with few angles, such as SIC-POVMs and MUBs. Other examples relate to the hexacode, Coxeter-Todd lattice, and the Van Lint-Schrijver association scheme. Many other examples can be obtained as induced subgraphs by employing a technique parallel to the dismantling of certain association schemes. Specific examples thus arise from (partial) spreads in some small generalized quadrangles. Finally, we give a full classification of two-eigenvalue gain graphs with degree at most 4, or with a multiplicity at most 3.报告人简介：Edwin R. van Dam is currently a Full Professor in the Department of Econometrics and Operations Research at Tilburg University, the Netherlands. He obtained his Ph.D. from Tilburg University.His main research interests include algebraic graph theory, spectral graph theory, distance-regular graphs, association schemes, and the use of eigenvalue methods in combinatorics. Professor van Dam has published over 100 papers in highly prestigious journals such as Inventiones Mathematicae, Journal of Combinatorial Theory Series A, Journal of Combinatorial Theory Series B. He is an Editor-in-Chief of the Electronic Journal of Combinatorics.。
2026-09-24
-
-
-
-
