Gil Kalai, The Cascade Conjecture and other Helly-type Problems

Zoom ID: 868 7549 9085

For a set $X$ of points $x(1)$, $x(2)$, $\ldots$, $x(n)$ in some real vector space $V$ we denote by $T(X,r)$ the set of points in $X$ that belong to the convex hulls of r pairwise disjoint subsets of $X$. We let $t(X,r)=1+\dim(T(X,r))$. Radon's theorem asserts that If $t(X,1)< |X|$, then $t(X, 2) >0$. The first

Stijn Cambie, The precise diameter of reconfiguration graphs

Room B332 IBS (기초과학연구원)

Reconfiguration is about changing instances in small steps. For example, one can perform certain moves on a Rubik's cube, each of them changing its configuration a bit. In this case, in at most 20 steps, one can end up with the preferred result. One could construct a graph with as nodes the possible configurations of

Sebastian Siebertz, Transducing paths in graph classes with unbounded shrubdepth

Zoom ID: 869 4632 6610 (ibsdimag)

Transductions are a general formalism for expressing transformations of graphs (and more generally, of relational structures) in logic. We prove that a graph class C can be FO-transduced from a class of bounded-height trees (that is, has bounded shrubdepth) if, and only if, from C one cannot FO-transduce the class of all paths. This establishes

KSIAM 2022 Spring Meeting

IBS Science Culture Center

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 invited talk by Joonkyung Lee at the Hanyang University, a special session "Graph Theory" organized by Sang-il Oum and the IBS DIMAG, a special session "Enumerative Combinatorics"

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 learning and logical reasoning. In fact, SATNet has been successfully applied to learn, among others, the rules of a complex logical puzzle, such as Sudoku,

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 and confirms the two-summand case of a conjecture of Bukh and is best possible up to the lower-order term for many choices of $L_1$ and

O-joung Kwon (권오정), Graph minor theory and beyond

Room 1501, Bldg. E6-1, KAIST

One 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 that do not contain a fixed graph H as a minor. Later on, several generalizations of H-minor free graphs, which are sparse, have been defined

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 with a sequence witnessing the bound. Classes of bounded twin-width are very diverse, notably including bounded rank-width, $\Omega ( \log (n) )$-subdivisions of graphs of

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 give a new proof for the result that for $ 1<p<2 $, the translative packing density of superballs (a generalization of $\ell^p$ balls) in $\mathbb{R}^n$

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 through $y$ and points of $E$. Clearly, $|\pi_y(E)|$ is at most the minimum of the number of lines through $y$ and $|E|$. I will discuss

IBS 이산수학그룹 Discrete Mathematics Group
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Discrete Mathematics Group (DIMAG)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: dimag@ibs.re.kr, Fax: +82-42-878-9209
Copyright © IBS 2018. All rights reserved.