Mark Siggers, The list switch homomorphism problem for signed graphs
Room B232 IBS (기초과학연구원)A signed graph is a graph in which each edge has a positive or negative sign. Calling two graphs switch equivalent if one can get from one to the other …
10 events found.
Discrete Math Seminar
-
-
-
Pascal Gollin, Enlarging vertex-flames in countable digraphs
Room B232 IBS (기초과학연구원)A rooted digraph is a vertex-flame if for every vertex v there is a set of internally disjoint directed paths from the root to v whose set of terminal edges covers all …
-
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 …
-
-
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 …
-
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$ …
-
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 …
-
-
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 …
-
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 …
-
Semin Yoo (유세민), Combinatorics of Euclidean spaces over finite fields
Room B232 IBS (기초과학연구원)$q$-analogues of quantities in mathematics involve perturbations of classical quantities using the parameter $q$, and revert to the original quantities when $q$ goes $1$. An important example is the $q$-analogues …