Ben Lund, Limit shape of lattice Zonotopes
Room B232 IBS (기초과학연구원)A convex lattice polytope is the convex hull of a set of integral points. Vershik conjectured the existence of a limit shape for random convex lattice polygons, and three proofs …
Loading view.
Dimitrios M. Thilikos, Bounding Obstructions sets: the cases of apices of minor closed classes
Zoom ID: 869 4632 6610 (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 …
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 …
Adam Zsolt Wagner, Constructions in combinatorics via neural networks
Zoom ID: 869 4632 6610 (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, …
O-joung Kwon (권오정), Classes of intersection digraphs with good algorithmic properties
Zoom ID: 875 9395 3555 (relay) [CLOSED]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$ …
Alan Lew, Representability and boxicity of simplicial complexes
Zoom ID: 869 4632 6610 (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 …
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 …
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 …
Florian Gut and Attila Joó, Large vertex-flames in uncountable digraphs
Zoom ID: 869 4632 6610 (ibsdimag)The local connectivity $ \kappa_D(r,v) $ from $ r $ to $ v $ is defined to be the maximal number of internally disjoint $r\rightarrow v $ paths in $ …
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 …