KSIAM 2022 Spring Meeting
KSIAM (Korean Society for Industrial and Applied Mathematics) will have the KSIAM 2022 Spring Conference at the Institute for Basic Science (IBS). Its academic session for Combinatorics decided to have an …
10 events found.
Events
-
-
IBS Science Culture Center -
Hongseok Yang (양홍석), Learning Symmetric Rules with SATNet
Room B332 IBS (기초과학연구원)SATNet is a differentiable constraint solver with a custom backpropagation algorithm, which can be used as a layer in a deep-learning system. It is a promising proposal for bridging deep …
-
-
Jeck Lim, Sums of linear transformations
Zoom ID: 870 0312 9412 (ibsecopro) [CLOSED]We show that if $L_1$ and $L_2$ are linear transformations from $\mathbb{Z}^d$ to $\mathbb{Z}^d$ satisfying certain mild conditions, then, for any finite subset $A$ of $\mathbb{Z}^d$, \ This result corrects …
-
O-joung Kwon (권오정), Graph minor theory and beyond
Room 1501, Bldg. E6-1, KAISTOne of the important work in graph theory is the graph minor theory developed by Robertson and Seymour in 1980-2010. This provides a complete description of the class of graphs …
-
Amadeus Reinald, Twin-width and forbidden subdivisions
Room B332 IBS (기초과학연구원)Twin-width is a recently introduced graph parameter based on vertex contraction sequences. On classes of bounded twin-width, problems expressible in FO logic can be solved in FPT time when provided …
-
Chengfei Xie, On the packing densities of superballs in high dimensions
Zoom ID: 870 0312 9412 (ibsecopro) [CLOSED]The sphere packing problem asks for the densest packing of nonoverlapping equal-sized balls in the space. This is an old and difficult problem in discrete geometry. In this talk, we …
-
Ben Lund, Radial projections in finite space
Room B332 IBS (기초과학연구원)Given a set $E$ and a point $y$ in a vector space over a finite field, the radial projection $\pi_y(E)$ of $E$ from $y$ is the set of lines that …
-
Xizhi Liu, Hypergraph Turán problem: from 1 to ∞
Zoom ID: 870 0312 9412 (ibsecopro) [CLOSED]One interesting difference between (nondegenerate) Graph Turán problem and Hypergraph Turán problem is that the hypergraph families can have at least two very different extremal constructions. In this talk, we …
-
-
Eric Vigoda, Computational phase transition and MCMC algorithms
Room B332 IBS (기초과학연구원)This talk will highlight recent results establishing a beautiful computational phase transition for approximate counting/sampling in (binary) undirected graphical models (such as the Ising model or on weighted independent sets). The computational problem is to …
-
Sepehr Hajebi, Holes, hubs and bounded treewidth
Zoom ID: 869 4632 6610 (ibsdimag)A hole in a graph $G$ is an induced cycle of length at least four, and for every hole $H$ in $G$, a vertex $h\in G\setminus H$ is called a …