# 세미나 및 콜로퀴엄

2020-12
Sun Mon Tue Wed Thu Fri Sat
1 2 1 3 4 1 5
6 7 8 9 10 11 12
13 14 15 16 17 1 18 19
20 21 22 23 24 25 26
27 28 29 30 31
2021-01
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

구글 Calendar나 iPhone 등에서 구독하면 세미나 시작 전에 알림을 받을 수 있습니다.

A graph $H$ is \emph{common} if the number of monochromatic copies of $H$ in a 2-edge-colouring of the complete graph $K_n$ is minimised by the random colouring. Burr and Rosta, extending a famous conjecture by Erd\H{o}s, conjectured that every graph is common. The conjectures by Erd\H{o}s and by Burr and Rosta were disproved by Thomason and by Sidorenko, respectively, in the late 1980s. Despite its importance, the full classification of common graphs is still a wide open problem and has not seen much progress since the early 1990s. In this lecture, I will present some old and new techniques to prove whether a graph is common or not.
Zoom ID: 862 839 8170 Password: 123450
Host: 김재훈     영어     2020-11-19 11:36:39
In the theory of turbulence, a famous conjecture of Onsager asserts that the threshold Hölder regularity for the total kinetic energy conservation of (spatially periodic) Euler flows is 1/3. In particular, there are Hölder continuous Euler flows with Hölder exponent less than 1/3 exhibiting strict energy dissipation, as proved recently by Isett. In light of these developments, I'll discuss Hölder continuous Euler flows which not only have energy dissipation but also satisfy a local energy inequality.
Zoom seminar: https://kaist.zoom.us/j/3098650340
Host: 강문진     미정     2020-11-12 17:13:09
Abstract: In combinatorics, Hopf algebras appear naturally when studying various classes of combinatorial objects, such as graphs, matroids, posets or symmetric functions. Given such a class of combinatorial objects, basic information on these objects regarding assembly and disassembly operations are encoded in the algebraic structure of a Hopf algebra. One then hopes to use algebraic identities of a Hopf algebra to return to combinatorial identities of combinatorial objects of interest. In this talk, I introduce a general class of combinatorial objects, which we call multi-complexes, which simultaneously generalizes graphs, hypergraphs and simplicial and delta complexes. I also introduce a combinatorial Hopf algebra obtained from multi-complexes. Then, I describe the structure of the Hopf algebra of multi-complexes by finding an explicit basis of the space of primitives, which is of combinatorial relevance. If time permits, I will illustrate some potential applications. This is joint work with Miodrag Iovanov.
Zoom ID: 934 3222 0374 (ibsdimag)
Host: 김재훈     영어     2020-11-11 13:40:51