Bill Martin is a Professor in the Department of Mathematical Sciences at Worcester Polytechnic Institute's College of Arts & Sciences. His research focuses on combinatorial structures, particularly association schemes and their applications in discrete geometry. His primary research interests include Combinatorics, Algebraic Combinatorics, Association Schemes, Discrete Geometry, Matrix Theory, and Graph Theory. His work explores the mathematical properties of sets of lines through the origin with specific angle constraints and how these relate to association schemes. His recent work has examined the application of Schoenberg's Theorem to rule out feasible parameter sets for cometric association schemes, building on doctoral research from his student Brian Kodalen. Professor Martin has mentored graduate students including Brian Kodalen, whose 2019 thesis work formed the foundation for Martin's 2020 seminar presentation on Schoenberg's Theorem and Association Schemes.
Frank Vallentin is a full professor of applied mathematics (computer science) at the Mathematical Institute of the University of Cologne, Germany. He has held academic positions at Technische Universiteit Delft, Centrum Wiskunde & Informatica (CWI), and the Hebrew University of Jerusalem. His research spans optimization, discrete geometry, harmonic analysis, and computational mathematics. Research Interests: His primary mathematical interests include semidefinite programming, combinatorial optimization, harmonic analysis, discrete geometry, combinatorics, geometry of numbers, special functions, computational complexity, and coding and information theory. These areas reflect a deep integration of theoretical mathematics with algorithmic and computational techniques. The 15 most recent publications reveal a strong focus on geometric optimization, lattice problems, energy minimization, and semidefinite programming bounds. Key themes include chromatic numbers of lattices, symplectic capacities, polarization phenomena, and algorithmic solutions to geometric problems. His work often involves recursive SDP hierarchies, extremal configurations, and computational verification of theoretical bounds. Scientific Awards and Grants: SIAG/Optimization Prize (2011, with Christine Bachoc) NWO VIDI Grant (2010–2015): Semidefinite programming and harmonic analysis DFG Project: Symplectic capacities of polytopes (2017–) EU Horizon 2020 MINOA Project: Optimization with limited quantum resources (2017–) DFG Project: Spectral bounds in extremal discrete geometry (2019–) Advising and Grants: Vallentin has advised numerous PhD and master’s students at TU Delft and the University of Cologne, covering topics in discrete geometry, optimization, coding theory, and quantum information. He has secured major research funding from NWO, DFG, and the EU, supporting interdisciplinary projects in algorithmic optimization and mathematical physics. He is actively involved in organizing workshops and summer schools. Labs and Teams: He leads a research group at the University of Cologne focusing on optimization and discrete geometry, with strong collaborations with CWI Amsterdam, TU Delft, and international institutes. His team works on theoretical and computational aspects of geometric optimization, often using symmetry reduction and harmonic analysis.
Pete Casazza is a faculty member at the University of Missouri, where he conducts research in frame theory, harmonic analysis, and related areas of applied mathematics. He has been an active speaker in academic seminars, presenting on topics such as two-distance sets and scalable frames. Research Interests: His work focuses on the theory of frames in Hilbert spaces, particularly tight and equiangular tight frames, with connections to combinatorics, geometry, and signal processing. He studies structural properties of vector sets with restricted inner products, including regular two-distance sets and their applications in quasi-symmetric designs and equiangular lines. Recent Work Trends: His recent publications and talks emphasize the geometric and algebraic structure of frames, including constructions of balanced and scalable systems. These have implications in coding theory, quantum information, and data science. Scientific Awards: No awards mentioned in the provided text. Advising and Grants: While no specific students or grants are listed, his sustained research output and seminar presence suggest active mentorship and likely grant involvement in mathematical sciences. Labs and Teams: No specific lab or team affiliations are mentioned in the provided material.
Leo Jimenez is a Visiting Assistant Professor at The Ohio State University, based at the Mathematics Department (implied by office code MA 430). His research focuses on model theory, differential algebra, and abstract algebra with applications to mathematical logic and algebraic structures. He is actively engaged in studying internality, fibrations, differential equations, and Galois theory. His recent work explores topics such as predicate expansions in model theory, splitting differential equations, and the structural properties of algebraic systems. Research themes consistently emphasize the interplay between algebraic structures and logical frameworks. No academic awards or grants are explicitly mentioned in the text. He has not listed advisees, but his work suggests involvement in graduate-level research supervision. His office is located at MA 430, 231 W. 18th Ave., Columbus, OH 43210.
Cristina Tonesi is an Associate Lecturer in the Department of Information Technology within the Faculty of Engineering and Architecture at Ghent University. Her academic career spans multiple publications in mathematical geometry and related fields from 1999 to 2006. Dr. Tonesi's research focuses on advanced mathematical structures, particularly in finite geometries and their applications. Her work demonstrates expertise in distance-regular graphs, 0,2-geometries, and chain structures. She has made significant contributions to the understanding of semipartial geometries, projective geometry, and the intersection of algebraic structures with geometric configurations. Her publication history shows a consistent focus on theoretical mathematics with applications in computer science. The research trajectory reveals increasing specialization in distance-regular structures and their group theoretical characterizations, culminating in her 2005 PhD dissertation on distance-regular geometries and group theoretical characterizations of (0,2)-geometries. Dr. Tonesi has collaborated extensively with leading researchers in her field including Frank De Clerck, Stefaan De Winter, Elisabeth Kuijken, and Helmut Karzel, demonstrating strong integration within the mathematical research community. Her academic output includes journal articles in reputable publications such as Journal of Geometry, Designs Codes and Cryptography, and Journal of Algebraic Combinatorics, along with a book chapter and her doctoral dissertation.
Yufei Zhao is an Associate Professor of Mathematics at the Massachusetts Institute of Technology (MIT). His research focuses on extremal, probabilistic, and additive combinatorics, with applications to graph theory, discrete geometry, and computer science. Dr. Zhao received his S.B. in Mathematics and Computer Science and Engineering from MIT in 2010, followed by an M.A.St. in Mathematics with Distinction from Cambridge University in 2011. He completed his Ph.D. in Mathematics at MIT in 2015 under the supervision of Jacob Fox. His research interests span a broad range of combinatorial mathematics, with particular emphasis on the interplay between structure and randomness. Dr. Zhao has made significant contributions to extremal graph theory, additive combinatorics, and the theory of pseudorandom graphs. His work often connects different areas of mathematics through innovative applications of combinatorial methods. Dr. Zhao's publications demonstrate a consistent focus on fundamental problems in combinatorics, with recent work exploring equiangular lines, spherical codes, extremal set theory, and the connections between graph theory and additive combinatorics. His research has been recognized with prestigious awards including the Fulkerson Prize (2024), NSF CAREER award (2021), Sloan Research Fellowship (2019), and Dénes König Prize (2018). Fulkerson Prize (2024) NSF CAREER award (2021) Sloan Research Fellowship (2019) Dénes König Prize (2018) Dr. Zhao actively mentors students, currently advising Travis Dillon, Dingding Dong, and Nitya Mani. His former PhD students include Benjamin Gunby, Jonathan Tidor, Aaron Berger, Ashwin Sah, and Mehtaab Sawhney. He has also authored the influential textbook "Graph Theory and Additive Combinatorics: Exploring Structure and Randomness" (Cambridge University Press, 2023), which has received high praise from leading mathematicians including Terry Tao and Ben Green.
Yury Polyanskiy is a Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology (MIT), affiliated with the Laboratory for Information and Decision Systems (LIDS), the Institute for Data, Systems, and Society (IDSS), and the MIT Statistics and Data Science Center. He holds a Ph.D. from Princeton University (2010) and an M.S. from the Moscow Institute of Physics and Technology (2005). His research focuses on information theory, machine learning, statistical inference, error-correcting codes, and wireless communication. He has contributed to fundamental limits of communication systems, finite-blocklength analysis, and applications of information theory to learning and signal processing. Notable awards include the 2020 IEEE Information Theory Society James Massey Award, the 2013 NSF CAREER Award, and the 2011 IEEE Information Theory Society Paper Award. His work spans theoretical advancements and practical applications, including the development of the SPECTRE toolbox for short-packet communication. He is also co-authoring a textbook on information theory. Recent research highlights include studies on quantization techniques for machine learning (e.g., NestQuant), transformer-based empirical Bayes methods, and novel approaches to massive random access in wireless networks (e.g., unsourced multiple access). His contributions bridge information theory and modern data science, addressing challenges in high-dimensional data representation, neural network dynamics, and efficient communication architectures.
Lacri Iancu is a Researcher at the Chair of Algebra within the Institute for Discrete Structures and Symbolic Computing at the University of Stuttgart. He is also a member of the Chair of Differential Geometry. His teaching spans multiple semesters, focusing on Linear Algebra, Mathematics for Informatics/Computer Science, and Algebra-related topics. He has taught courses such as 'Linear Algebra and Analytic Geometry,' 'Mathematics for Infotech,' and 'Reflection Groups,' alongside seminars and proseminars on algebraic themes. His research interests include algebraic structures, discrete mathematics, and applications of symbolic computing. He has been actively involved in academic advising and curriculum development, evidenced by his consistent teaching roles since 2012. No specific awards or publications are listed in the text, but his involvement in multiple academic committees and chairs highlights his contributions to the field.
Aluna Rizzoli is a Research Fellow in the Department of Mathematics at King’s College London, part of the Geometry Group. They hold a PhD from Imperial College London (2021), supervised by Martin Liebeck. Previously, they were an INI-Simons Postdoctoral Fellow at the University of Cambridge and an SNSF-funded Research Scientist at EPFL. Their research focuses on algebraic groups, rational actions, and computational algebra, with recent work on classifying stabilizers in symplectic and orthogonal Grassmannians. Education: PhD in Pure Mathematics, Imperial College London (2021) Research interests span algebraic geometry, cohomology theories, differential geometry, and representation theory. Their work integrates abstract algebraic structures with computational tools, such as Magma code analysis of matrix groups over finite fields. Awards include the INI-Simons Fellowship and SNSF funding. They also engage in side projects in Data Science and Machine Learning. Part of the Geometry Group at King’s College London, Aluna contributes to collaborative research in symplectic geometry and algebraic group actions. Current efforts explore connections between finite and infinite group cases through computational methods.
Lex Schrijver is a Professor of Mathematics at the University of Amsterdam since 1990 and a CWI-Fellow at Centrum voor Wiskunde en Informatica (CWI) since 1989. His research focuses on discrete mathematics, optimization, and algorithms, with significant contributions to graph theory, combinatorics, and coding theory. Research Interests: Discrete Mathematics, Optimization, Algorithms, Graph Theory, Combinatorics, Coding Theory. Awards: EURO Gold Medal (2015) Honorary Doctorate from Eotvos Lorand University (2011) Franz Edelman Award (2008) SIGMA Prize (2008) John von Neumann Theory Prize (2006) Spinoza Prijs (2005) Ridder in de orde van de Nederlandse Leeuw (2005) Lanchester Prize (2004, 1986) Fulkerson Prize (2003, 1982) Van Dantzig Prize - SIAM / MPS (2003) Eredoctoraat from University of Waterloo (2002) Projects: Involved in the Networks project, funded by the Netherlands Organisation for Scientific Research (NWO). Professional Activities: Fellow of the American Mathematical Society (AMS) and SIAM.
Pierre Bienvenu is a Research Scientist at the Johann Radon Institute for Computational and Applied Mathematics (RICAM), part of the Austrian Academy of Sciences, since June 2025. Previously, he held postdoctoral positions at the Technische Universität Graz (2021-2022), the Max Planck Institute for Mathematics in Bonn (2020-2021), and the Institut Camille Jordan in Lyon/St-Etienne (2018-2020). He also served as a Teaching Fellow at Trinity College Dublin (2022-2023) and as a Lecturer at the American University in Paris in Spring 2018. His educational background includes a PhD in Mathematics from the University of Bristol (2014-2018), supervised by Julia Wolf, with a thesis titled "Linear, bilinear and polynomial configurations in function fields and the primes." Bienvenu's research lies at the intersection of arithmetic combinatorics, number theory, and harmonic analysis. He employs analytic, combinatorial, probabilistic, and algebraic methods to study problems in additive combinatorics, such as configurations in prime numbers, sum-product estimates, and density of sumsets. His work has strong connections to ergodic theory and theoretical computer science, particularly in pseudorandomness and error-correcting codes. His recent publications, spanning from 2017 to 2025, focus on density constraints, intersective sets, power monoids, and transference principles in additive combinatorics. These works often involve deep applications of higher-order Fourier analysis and the Green-Tao method, addressing fundamental questions about the structure of sets of integers and primes. As a member of RICAM, Bienvenu contributes to the institute's research groups in computational mathematics and number theory, collaborating with an international network of mathematicians on cutting-edge problems in arithmetic combinatorics.
Hugues Verdure is an Associate Professor in the Department of Mathematics and Statistics at UiT The Arctic University of Norway . His research focuses on algebraic combinatorics, matroid theory, and error-correcting codes, with a strong emphasis on symmetric polynomial optimization and algebraic geometry. Research Groups: Applied and Computational Algebra Projects: Albatros, POEMA, RAGOpt His work explores connections between coding theory and algebraic structures, including studies on rank metric codes, Betti numbers, and matroid invariants. Collaborative efforts span disciplines such as polynomial optimization, symmetric ideals, and combinatorial coding.
Emanuela De Negri is a Full Professor at the University of Genoa's Department of Mathematics (DIMA), serving on both the Academic Senate and Department Board. Her teaching responsibilities span undergraduate and graduate programs including Computer Science (Algebra), Mathematics (Linear Algebra and Analytic Geometry, Coding Theory), and Biomedical Engineering (Geometry). Her research centers on Commutative Algebra and Algebraic Geometry, with emphasis on structural properties of ideals and varieties. Key areas include initial ideals, radical ideals, semiregular sequences, and secant varieties, often exploring combinatorial and computational aspects with applications in coding theory and cryptography. Recent work reveals consistent focus on multigraded structures and characteristic-free methods. Publications from 2020-2022 demonstrate collaborative research patterns, particularly with Conca and Gorla, addressing foundational questions in ideal theory and tensor decompositions. The work shows strong interdisciplinary connections between abstract algebra and information theory, notably in encryption and error-correcting codes.
Rob Eggermont is an Assistant Professor in the Department of Mathematics and Computer Science at Eindhoven University of Technology (TU/e), specializing in the Discrete Algebra and Geometry research group. His work focuses on finiteness properties in infinite-dimensional algebraic settings with symmetry, connecting algebraic geometry, representation theory, and combinatorics. His research has significant applications in fields including phylogenetics, chemistry, and algebraic statistics. Education: MSc in Mathematics from Leiden University (2011), cum laude PhD from Eindhoven University of Technology (2015), cum laude Rob Eggermont's research centers on how algebraic structures with symmetry maintain finiteness properties even in infinite-dimensional settings. His work on topological noetherianity demonstrates that in systems with sufficient symmetry, problems involving millions of variables can be as tractable as those with only a few variables. This has profound implications for computational algebra and geometric modeling. His research group plays a leading role in algebraic graph theory, finite and incidence geometry, and discrete Lie theory. An analysis of his recent publications (2017-2025) reveals a consistent focus on polynomial representations, GL-varieties, and symmetric matrix structures. His work frequently explores how finiteness properties emerge in infinite-dimensional settings through symmetry constraints. Collaborations with Jan Draisma and other mathematicians form a significant portion of his output, indicating strong research networks in algebraic geometry and representation theory. Scientific Awards: Jong Talent Aanmoedigingsprijs (2007) - awarded to the best first-year mathematics student at Leiden University Veni grant 016.Veni.192.113 from the Netherlands Organization for Scientific Research (NWO) Dr. Eggermont has secured research funding through competitive grants and has participated in numerous international workshops and conferences, including the AIM workshop on 'Representation stability' (San Jose, 2016) and the BIRS workshop on 'Free Resolutions, Representations, and Asymptotic Algebra' (Banff, 2016). His research group actively contributes to the DIAMANT symposium and the Intercity Number Theory Seminar. Within the Discrete Algebra and Geometry group at TU/e, Eggermont collaborates with colleagues on advancing the theoretical foundations of algebraic structures with symmetry. His work has helped establish connections between representation theory, combinatorics, and practical applications in scientific computing.
Assistant Professor at the University of Ljubljana's Faculty of Computer and Information Science (FRI) specializing in theoretical computer science and discrete mathematics. His research bridges cryptography, graph theory, and metric geometry with practical applications in algorithm design and security protocols. Research Focus: Primary interests include cryptography (hash function analysis), graph theory (combinatorial structures, graph databases), and discrete geometry (metric cones, polyhedral combinatorics). His work demonstrates strong interdisciplinary connections between theoretical mathematics and computational problem-solving. Publication Trends: Recent publications reveal a consistent focus on combinatorial structures with applications in both cryptography and geometry. His research combines rigorous mathematical proofs with computational implementations, particularly evident in metric space analysis and graph-theoretical frameworks. Projects: Leads significant open-source initiatives including gap-graphs (computational graph theory) and GraphZOO (graph database), alongside the Kriptogram crypto portal for cryptographic education in Slovene. Teaching: Maintains office hours by appointment with focus on advanced mathematical and cryptographic concepts. Integrates research directly into teaching through computational projects and open-source tools development.
