Dimitrios M. Thilikos, Bounding Obstructions sets: the cases of apices of minor closed classes

Zoom ID: 934 3222 0374 (ibsdimag)

Given a minor-closed graph class ${\cal G}$, the (minor) obstruction of ${\cal G}$ is the set of all minor-minimal graphs not in ${\cal G}$. Given a non-negative integer $k$, we define the $k$-apex of ${\cal A}$ as the class containing every graph $G$ with a set $S$ of vertices whose removal from $G$ gives a graph

Doowon Koh (고두원), Mattila-Sjölin type functions: A finite field model

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

Let $\mathbb{F}_q$ be a finite field of order $q$ which is a prime power. In the finite field setting, we say that a function $\phi\colon \mathbb{F}_q^d\times \mathbb{F}_q^d\to \mathbb{F}_q$ is a Mattila-Sjölin type function in $\mathbb{F}_q^d$ if for any $E\subset \mathbb{F}_q^d$ with $|E|\gg q^{\frac{d}{2}}$, we have $\phi(E, E)=\mathbb{F}_q$. The main purpose of this talk is to present

Adam Zsolt Wagner, Constructions in combinatorics via neural networks

Zoom ID: 934 3222 0374 (ibsdimag)

Recently, significant progress has been made in the area of machine learning algorithms, and they have quickly become some of the most exciting tools in a scientist’s toolbox. In particular, recent advances in the field of reinforcement learning have led computers to reach superhuman level play in Atari games and Go, purely through self-play. In

O-joung Kwon (권오정), Classes of intersection digraphs with good algorithmic properties

Zoom ID: 875 9395 3555 (relay)

An intersection digraph is a digraph where every vertex $v$ is represented by an ordered pair $(S_v, T_v)$ of sets such that there is an edge from $v$ to $w$ if and only if $S_v$ and $T_w$ intersect. An intersection digraph is reflexive if $S_v\cap T_v\neq \emptyset$ for every vertex $v$. Compared to well-known undirected

Alan Lew, Representability and boxicity of simplicial complexes

Zoom ID: 934 3222 0374 (ibsdimag)

An interval graph is the intersection graph of a family of intervals in the real line. Motivated by problems in ecology, Roberts defined the boxicity of a graph G to be the minimal k such that G can be written as the intersection of k interval graphs. A natural higher-dimensional generalization of interval graphs is

Hongseok Yang (양홍석), DAG-symmetries and Symmetry-Preserving Neural Networks

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

The preservation of symmetry is one of the key tools for designing data-efficient neural networks. A representative example is convolutional neural networks (CNNs); they preserve translation symmetries, and this symmetry preservation is often attributed to their success in real-world applications. In the machine-learning community, there is a growing body of work that explores a new

Jeong Ok Choi (최정옥), Invertibility of circulant matrices of arbitrary size

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

In this talk, we present sufficient conditions to guarantee the invertibility of rational circulant matrices with any given size. These sufficient conditions consist of linear combinations in terms of the entries in the first row with integer coefficients. Using these conditions we show the invertibility of some family of circulant matrices with particular forms of

Suil O (오수일), Eigenvalues and [a, b]-factors in regular graphs

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

For positive integers, $r \ge 3, h \ge 1,$ and $k \ge 1$, Bollobás, Saito, and Wormald proved some sufficient conditions for an $h$-edge-connected $r$-regular graph to have a k-factor in 1985. Lu gave an upper bound for the third-largest eigenvalue in a connected $r$-regular graph to have a $k$-factor in 2010. Gu found an upper bound

Jaehoon Kim (김재훈), $K_{r+1}$-saturated graphs with small spectral radius

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

For a graph $H$, a graph $G$ is $H$-saturated if $G$ does not contain $H$ as a subgraph but for any $e\in E(\overline G)$, $G+e$ contains $H$. In this note, we prove a sharp lower bound for the number of paths and walks on length 2 in $n$-vertex $K_{r+1}$-saturated graphs. We then use this bound to give a

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.