Thursday, August 29, 2024

2024-09-04 / 16:00 ~ 17:00

by ()

The realization that microbiomes, associated with virtually all multicellular organisms, have tremendous impact on their host health is considered as one of the most important scientific discoveries in the last decade. The host associated microbiomes, composed of tens to hundreds of co-existing microbial species, are highly heterogenous at multiple scales (e.g. between different hosts and within a host). In this talk, I will share our recent works on understanding the heterogeneity of complex microbial communities, and how these conceptual and technological advances in microbial ecology pave the way for precision microbiome engineering to prevent and treat diseases.

2024-09-05 / 10:30 ~ 11:30

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

by ()

The lecture series gives a view on computational methods and their some applications to existence and classfication problems. In the first lectures I will introduce Groebner basis and their basic applications in commutative algebra such as computing kernel and images of morphism between finitely presented modules over polynomial rings. As a theoretical application of Groebner basis I will give Petri's analysis of the equations of a canonical curve. The second topic will be Computer aided existence and unirationality proofs of algebraic varieties and their moduli spaces. In case of curves liaison theory is needed, which will be developed. For existence proofs random searches over finite fields is a technique that has not been exploited very much. I will illustrate this technique in a number of examples, in particular for the construction of certain surfaces. Classification of non-minimal surfaces uses adjunction theory. We will discuss this from a computational point of view.

2024-09-03 / 16:30 ~ 17:30

IBS-KAIST 세미나 - 이산수학: Oriented trees in $O(k \sqrt{k})$-chromatic digraphs, a subquadratic bound for Burr’s conjecture

by Amadeus Reinald(LIRMM, Université de Montpellier, CNRS)

In 1980, Burr conjectured that every directed graph with chromatic number $2k-2$ contains any oriented tree of order $k$ as a subdigraph. Burr showed that chromatic number $(k-1)^2$ suffices, which was improved in 2013 to $\frac{k^2}{2} – \frac{k}{2} + 1$ by Addario-Berry et al. In this talk, we give the first subquadratic bound for Burr’s conjecture, by showing that every directed graph with chromatic number $8\sqrt{\frac{2}{15}} k \sqrt{k} + O(k)$ contains any oriented tree of order $k$. Moreover, we provide improved bounds of $\sqrt{\frac{4}{3}} k \sqrt{k}+O(k)$ for arborescences, and $(b-1)(k-3)+3$ for paths on $b$ blocks, with $b\ge 2$.

Events for the 취소된 행사 포함