Tuesday, October 24, 2023

2023-10-30 / 16:00 ~ 17:00

by ()

: For a translation surface, the associated saddle connection graph has saddle connections as vertices, and edges connecting pairs of non-crossing saddle connections. This can be viewed as an induced subgraph of the arc graph of the surface. In this talk, I will discuss both the fine and coarse geometry of the saddle connection graph. We show that the isometry type is rigid: any isomorphism between two such graphs is induced by an affine diffeomorphism between the underlying translation surfaces. However, the situation is completely different when one considers the quasi-isometry type: all saddle connection graphs form a single quasi-isometry class. We will also discuss the Gromov boundary in terms of foliations. This is based on joint work with Valentina Disarlo, Huiping Pan, and Anja Randecker.

2023-10-27 / 16:00 ~ 17:00

SAARC 세미나 - SAARC 세미나:

by ()

The talk will focus on a part of the frontier of our current understanding of nonlinear stability of traveling waves of partial differential equations, especially on how spectral stability implies nonlinear stability and which kind of dynamics may be expected. We shall highlight main expected difficulties related to the stability of discontinuous waves of hyperbolic systems, and show a few significant steps obtained by the speaker with respectively Vincent Duchêne (Rennes), Gregory Faye (Toulouse) and Louis Garénaux (Karslruhe).

2023-10-31 / 16:30 ~ 17:30

IBS-KAIST 세미나 - 이산수학: Odd distances in colourings of the plane

by James Davies(University of Cambridge)

We prove that every finite colouring of the plane contains a monochromatic pair of points at an odd integral distance from each other.

2023-10-24 / 16:30 ~ 17:30

IBS-KAIST 세미나 - 이산수학: Powers of planar graphs, product structure, and blocking partitions

by Robert Hickingbotham(Monash University)

Graph product structure theory describes complex graphs in terms of products of simpler graphs. In this talk, I will introduce this subject and talk about some of my recent results in this area. The focus of my talk will be on a new tool in graph product structure theory called `blocking partitions.’ I’ll show how this tool can be used to prove stronger product structure theorems for powers of planar graphs as well as k-planar graphs, resolving open problems of Dujmović, Morin and Wood, and Ossona de Mendez.

2023-10-30 / 16:30 ~ 17:30

학과 세미나/콜로퀴엄 - 박사논문심사: 다각형 격자 위에서 탄성 문제 및 스톡스 문제를 풀기 위한 새로운 부접합 가상요소법

by ()

2023-10-30 / 16:30 ~ 17:30

학과 세미나/콜로퀴엄 - 박사논문심사: 다각형 격자 위에서 탄성 문제 및 스톡스 문제를 풀기 위한 새로운 부접합 가상요소법

by ()

2023-10-26 / 14:30 ~ 15:45

학과 세미나/콜로퀴엄 - 기타:

by ()

2023-10-25 / 15:00 ~ 16:00

학과 세미나/콜로퀴엄 - 미분기하 세미나:

by (포항공대)

The Gauss-Bonnet theorem implies that the two dimensional torus does not have nonnegative Gauss curvature unless it is flat, and that the two dimensional sphere does not a metric which has Gaussian curvature bounded below by one and metric bounded below by the standard round metric. Gromov proposed a series of conjectures on generalizing the Gauss-Bonnet theorem in his four lectures. I will report my work with Gaoming Wang (now Tsinghua) on Gromov dihedral rigidity conjecture in hyperbolic 3-space and scalar curvature comparison of rotationally symmetric convex bodies with some simple singularities.

2023-10-31 / 16:00 ~ 17:00

SAARC 세미나 - SAARC 세미나: Colloquium: Efficient Algorithms for Exact Graph Matching on Correlated Stochastic Block Models with Constant Correlation

by 정혜원(KAIST 전기및전자공학부)

We consider the problem of graph matching, or learning vertex correspondence, between two correlated stochastic block models (SBMs). The graph matching problem arises in various fields, including computer vision, natural language processing and bioinformatics, and in particular, matching graphs with inherent community structure has significance related to de-anonymization of correlated social networks. Compared to the correlated Erdos-Renyi (ER) model, where various efficient algorithms have been developed, among which a few algorithms have been proven to achieve the exact matching with constant edge correlation, no low-order polynomial algorithm has been known to achieve exact matching for the correlated SBMs with constant correlation. In this work, we propose an efficient algorithm for matching graphs with community structure, based on the comparison between partition trees rooted from each vertex, by extending the idea of Mao et al. (2021) to graphs with communities. The partition tree divides the large neighborhoods of each vertex into disjoint subsets using their edge statistics to different communities. Our algorithm is the first low-order polynomial-time algorithm achieving exact matching between two correlated SBMs with high probability in dense graphs.

2023-10-24 / 16:00 ~ 17:00

SAARC 세미나 - SAARC 세미나: Colloquium: On The Power of Foundation Models and Mathematics in the New Era

by 유재준(UNIST AI대학원)

In this lecture, we aim to delve deep into the emerging landscape of 'Foundation Models'. Distinct from traditional deep learning models, Foundation Models have ushered in a new paradigm, characterized by their vast scale, versatility, and transformative potential. We will uncover the key differences between these models and their predecessors, delving into the intricate mechanisms through which they are trained and the profound impact they are manifesting across various sectors. Furthermore, the talk will shed light on the invaluable role of mathematics in understanding, optimizing, and innovating upon these models. We will explore the symbiotic relationship between Foundation Models and mathematical principles, elucidating how the latter not only underpins their functioning but also paves the way for future advancements.

Events for the 취소된 행사 포함