Thursday, October 9, 2025

<< >>  
2025. 9
Sun Mon Tue Wed Thu Fri Sat
1 2 3 4 5 6
7 8 9 10 11 12 13
14 15 16 17 18 19 20
21 22 23 24 25 26 27
28 29 30
2025. 10
Sun Mon Tue Wed Thu Fri Sat
1 2 3 4
5 6 7 8 9 10 11
12 13 14 15 16 17 18
19 20 21 22 23 24 25
26 27 28 29 30 31
2025. 11
Sun Mon Tue Wed Thu Fri Sat
1
2 3 4 5 6 7 8
9 10 11 12 13 14 15
16 17 18 19 20 21 22
23 24 25 26 27 28 29
30
2025-10-16 / 14:00 ~ 15:00
학과 세미나/콜로퀴엄 - 미분기하 세미나: 인쇄
by 이지현(기초과학원 기하학수리물리연구단)
We investigate compact minimal surfaces in the Einstein-Maxwell theory with both electric and magnetic charges and a negative cosmological constant. A two-sided, embedded and strictly stable minimal surface that maximizes the magnetically charged Hawking mass naturally corresponds to the event horizon of a black hole. Our main theorem shows that the geometry near such a surface is rigid: a neighborhood is isometric to the dyonic Reissner-Nordstrom-Anti-de Sitter space, the canonical model of a charged black hole in Anti-de Sitter spacetime. In addition, we provide an area estimate for the surface that depends only on its topology and the relevant physical parameters.
2025-10-13 / 16:00 ~ 17:30
편미분방정식 통합연구실 세미나 - 편미분방정식: 인쇄
by (아주대학교)
In this talk, we prove that the inviscid surface quasi-geostrophic (SQG) equation is strongly ill-posed in critical Sobolev spaces: there exists an initial data $H^2(\mathbb{R}^2)$ without any solutions in $L^{\infty}_tH^2$. Then, we introduce similar ill-posedness results for $\alpha$-SQG and two-dimensional incompressible Euler equations. This talk is based on joint works with In-Jee Jeong(SNU), Young-Pil Choi(Yonsei Univ.), Jinwook Jung(Hanyang Univ.), and Min Jun Jo(Duke Univ.).
2025-10-14 / 16:30 ~ 17:30
IBS-KAIST 세미나 - 이산수학: An improved lower bound on the number of edges in list critical graphs via DP coloring 인쇄
by Ilkyoo Choi(Department of Mathematics, Hankuk University of Fo)
A graph $G$ is (list, DP) $k$-critical if the (list, DP) chromatic number is $k$ but for every proper subgraph $G’$ of $G$, the (list, DP) chromatic number of $G’$ is less than $k$. For $k\geq 4$, we show a bound on the minimum number of edges in a DP $k$-critical graph, and our bound is the first bound that is asymptotically better than the corresponding bound for proper $k$-critical graphs by Gallai from 1963. Our result also improves the best bound on the list chromatic number. This is joint work with Bradshaw, Kostochka, and Xu.
2025-10-15 / 16:00 ~ 17:00
IBS-KAIST 세미나 - IBS-KAIST 세미나: 인쇄
by ()

Events for the 취소된 행사 포함 모두인쇄
export to Google calendar  .ics download