기초과학연구원 이산수학그룹
On December 26, 2025, Donggyu Kim (김동규) from the Georgia Institute of Technology gave a talk at the Discrete Math Seminar on defining orthogonal matroids (even delta-matroids) with coefficients in terms of Grassmann-Plücker functions. The title of his talk was “Grassmann-Plücker functions for orthogonal matroids“.
On December 16, 2025, Chi Hoi Yip from Georgia Institute of Technology gave a talk at the Discrete Math Seminar on the maximum size of a clique in Paley graphs and cyclotomic graphs. The title of his talk was “Cliques in Paley graphs and cyclotomic graphs“.
On December 9, 2025, Tuukka Korhonen from the University of Copenhagen gave a talk at the Discrete Math Seminar on a dynamic algorithm for maintaining a tree decomposition of a graph. The title of his talk was “Dynamic Treewidth in Logarithmic Time“.
On December 8, 2025, Matthew Kwan from ISTA, Austria, gave a talk at the Discrete Math Seminar on the permanent of a random ±1-matrix. The title of his talk was “Exponential anticoncentration of the permanent“.
On November 25, 2025, Péter Pál Pach from the Budapest University of Technology and Economics gave a talk at the Discrete Math Seminar on the maximum set of positive integers that avoids having any product of k elements equal to a d-th power. The title of his talk was “Product representation of perfect cubes“.
On November 18, 2025, Fedor Noskov from MIPT, Russia gave a talk at the Discrete Math Seminar on hypergraph Turán-type problems and their connection to extremal set theory problems. The title of his talk was “Polynomial dependencies in hypergraph Turan-type problems“.
On November 11, 2025, Simón Piga from the University of Hamburg gave a talk at the Discrete Math Seminar on variants of the Turán problem for k-uniform hypergraphs. The title of his talk was “Turán problem in hypergraphs with quasirandom links“.
On November 4, 2025, Tim Hartmann and Ahemed Ghazy from CISPA Helmholtz Center for Information Security in Germany gave a talk at the Discrete Math Seminar on continuous graphs—a model obtained by replacing each edge of a graph with a unit interval to form a metric space, enabling continuous analogues of classical graph problems. The title of their talk was “Continuous Graphs – An Overview and a Coloring Problem“.
On October 28, 2025, Jakob Greilhuber from the CISPA Helmholtz Center for Information Security gave a talk at the Discrete Math Seminar on the parameterized complexity of the problem of deleting k vertices to make every component small. The title of his talk was “A Dividing Line for Structural Kernelization of Component Order Connectivity via Distance to Bounded Pathwidth“.
On October 21, 2025, William Cook from University of Waterloo gave a talk at the Discrete Math Seminar on using branch-decompositions for discrete optimization problems, including the traveling salesman problem. The title of his talk was “Optimization via Branch Decomposition“.