Monday, December 18, 2023

<< >>  
2023. 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
2023. 12
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
2024. 1
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
2023-12-22 / 14:00 ~ 15:00
편미분방정식 통합연구실 세미나 - PDE 세미나: 인쇄
by 오성진()
In this talk, I will describe a new approach to general relativistic initial data gluing based on explicit solution operators for the linearized constraint equation with prescribed support properties. In particular, we retrieve and optimize -- in terms of positivity, regularity, size and/or spatial decay requirements -- obstruction-free gluing originally put forth by Czimek-Rodnianski. Notably, our proof of the strengthened obstruction-free gluing theorem relies on purely spacelike techniques, rather than null gluing as in the original approach.
2023-12-19 / 16:30 ~ 17:30
IBS-KAIST 세미나 - 이산수학: Triangle Ramsey numbers of complete graphs 인쇄
by Shengtong Zhang(Stanford University)
A graph is $H$-Ramsey if every two-coloring of its edges contains a monochromatic copy of $H$. Define the $F$-Ramsey number of $H$, denoted by $r_F(H)$, to be the minimum number of copies of $F$ in a graph which is $H$-Ramsey. This generalizes the Ramsey number and size Ramsey number of a graph. Addressing a question of Spiro, we prove that \[r_{K_3}(K_t)=\binom{r(K_t)}3\] for all sufficiently large $t$.  Our proof involves a combination of results on the chromatic number of triangle-sparse graphs. Joint work with Jacob Fox and Jonathan Tidor.
Events for the 취소된 행사 포함 모두인쇄
export to Google calendar  .ics download