# 학과 세미나 및 콜로퀴엄

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

In this talk, we study the behaviour of rational points on the expanding horospheres in the space of unimodular lattices. The equidistribution of these rational points is proved by Einsiedler, Mozes, Shah and Shapira (2016). Their proof uses techniques from homogeneous dynamics and relies particularly on measure-classification theorems due to Ratner. We pursue an alternative strategy based on Fourier analysis, Weil's bound for Kloosterman sums, recently proved bounds (by M. Erdélyi and Á. Tóth) for matrix Kloosterman sums, Roger's formula, and the spectral theory of automorphic functions. Our methods yield an effective estimate on the rate of convergence for a specific horospherical subgroup in any dimension.
This is a joint work with D. El-Baz, B. Huang, J. Marklof and A. Strömbergsson.

For the last decade, there have been a number of studies reporting that certain surface singularities give rise to vector bundle on their smoothing. The first result is by Hacking, who studies this correspondence for Wahl singularities. I am going to introduce a generalization of Hacking's result to singularities of class T, which is a natural extension of Wahl singularities. Also, if time permits, I will introduce a recent result of Tevelev-Urzua which generalizes this to arbitrary cyclic quotient surface singularities.

Given a space, one can study its singularities. The converse direction is called reconstruction problem: How to reconstruct spaces from given singularity information? In this talk, by introducing a notion called a semicascade we derive a bound of Picard number for toric log del Pezzo surfaces in terms of the singular points generalizing some results of Dais and Suyama, which solves the reconstruction problem with the help of computer. We also discuss Kähler-Einstein toric log del Pezzo surfaces as an application of semicascades.

A monotone symplectic manifold is a symplectic analogue of a smooth Fano variety and it provides an important classes of objects, called monotone Lagrangian tori, in view of mirror symmetry. In this talk, I will explain a way of producing monotone Lagrangian tori in a given smooth Fano variety using toric degeneration. Using this technique, we prove that there exist infinitely many monotone Lagrangian tori not Hamiltonian isotopic to each other in a full flag variety. This is based on joint work with Myungho Kim, Yoosik Kim, Jaehoon Kwon, and Euiyong Park at Center for Quantum Structures in Modules and Spaces (QSMS).

In this talk, we introduce a various methods of representations of graphs which are mathematical objects expressing a variety of non-Euclidean data such as Molecules, social networks, genes, transportation networks, citation networks of papers and so on. Graph representation as a Euclidean vector is inevitable in machine learning for classifications for graphs which is closely related to graph neural network in computer science. We would like to introduce a few literatures, Weisfeiler-lehman algortihm, random walks, graph convolution whci are commonly used techniques and explain the result of combining them with topological invarints of graphs

https://sites.google.com/view/mwagaag

https://sites.google.com/view/mwagaag

The introduction for the framework of geometric deep learning will be explained in the perspective of new methodology of A.I. and data analysis. Various applications can be discussed by utilizing geometry, algebra, topology.

https://sites.google.com/view/mwagaag

https://sites.google.com/view/mwagaag

Abstract: We discuss a new application of (a part of) the Iwasawa main conjecture to the non-triviality of Kato's Kolyvagin systems and a structural refinement of Birch and Swinnerton-Dyer conjecture. In particular, the structure of Selmer groups is completely determined by certain modular symbols for a large class of elliptic curves.
(Please contact Wansu Kim at for Zoom meeting info or any inquiry.)

(Please contact Wansu Kim at for Zoom meeting info or any inquiry.)

(Please contact Wansu Kim at for Zoom meeting info or any inquiry.)

One of the important work in graph theory is the graph minor theory developed by Robertson and Seymour in 1980-2010. This provides a complete description of the class of graphs that do not contain a fixed graph H as a minor. Later on, several generalizations of H-minor free graphs, which are sparse, have been defined and studied. Also, similar topics on dense graph classes have been deeply studied. In this talk, I will survey topics in graph minor theory, and discuss related topics in structural graph theory.

ZOOM Meeting ID: 873 7478 2790 Direct link: https://kaist.zoom.us/j/87374782790

ZOOM Meeting ID: 873 7478 2790 Direct link: https://kaist.zoom.us/j/87374782790

The law of iterated logarithm (LIL) is a crowning achievement in classical probability theory that gives the sharp upper bound for the magnitude of fluctuations of a random walk. If each step has mean zero and variance one, then the upper bound (in certain sense) is given by \sqrt{2n\log\log n}, hence the name “iterated logarithm.” Despite being considered the “third fundamental limit theorem in probability” by some probabilists after the law of large numbers and the central limit theorem, its proof is not so accessible to non-experts. For instance, most textbooks either only consider special cases or use sophisticated machineries in their proofs. The purpose of this talk is to provide a relatively simple and elementary proof of the so-called Hartman—Wintner LIL. The idea is to generalize a proof of the central limit theorem (CLT), which will be also presented, to obtain a result on the rate of convergence in the CLT. First principles in probability (e.g. the second Borel—Cantelli lemma) are the only technical prerequisites.

Inside living cells, chemical reactions form a large web of networks
and they are responsible for physiological functions. Understanding
the behavior of complex reaction networks is a challenging and
interesting task. In this talk, I would like to illustrate how the
methods of algebraic topology can shed light on the properties of
chemical reaction systems. In particular, we discuss the following two
problems: (1) response of reaction systems to external perturbations
and (2) simplification of complex reaction networks without altering
the behavior of the system.

ZOOM Meeting ID: 868 7549 9085 Direct link: https://kaist.zoom.us/j/86875499085

ZOOM Meeting ID: 868 7549 9085 Direct link: https://kaist.zoom.us/j/86875499085

This talk is concerned with the bifurcation and stability of the
compresible Taylor vortex. Consider the compressible Navier-Stokes
equations in a domain between two concentric infinite cylinders. If the
outer cylinder is at rest and the inner one rotates with sufficiently
small angular velocity, a laminar flow, called the Couette flow, is
stable. When the angular velocity of the inner cylinder increases,
beyond a certain value of the angular velocity, the Couette flow becomes
unstable and a vortex pattern, called the Taylor vortex, bifurcates and
is observed stably. This phenomena is mathematically formulated as a
bifurcation and stability problem. In this talk, the compressible Taylor
vortex is shown to bifurcate near the criticality for the incompressible
problem when the Mach number is sufficiently small. The localized
stability of the compressible Taylor vortex is considered under
sufficiently small axisymmetric perturbations; and it is shown that the
large time behavior of solutions around the Taylor vortex is described
by solutions of a system of diffusion equations.

Despite of great progress over the last decades in simulating complex problems with the numerical discretization of (stochastic) partial differential equations
(PDEs), solving high-dimensional problems governed by parameterized PDEs remains challenging. Machine learning has emerged as a promising alternative in scientific computing community by enforcing the physical laws. We review some of machine learning approaches and present a novel algorithm based on variational inference to solve (stochastic) systems. Numerical examples are provided to illustrate the proposed algorithm.

####
Online(Zoom)
콜로퀴엄
Gil Kalai (Hebrew University)
The Cascade Conjecture and other Helly-type problems

Online(Zoom)

콜로퀴엄

Helly-type theorems and problems form a nice area of discrete geometry. I will start with the notable theorems of Radon and Tverberg and mention the following conjectural extension.

For a set *X* of points *x(1), x(2),...,x(n)* in some real vector space *V* we denote by *T(X,r)* the set of points in *X* that belong to the convex hulls of r pairwise disjoint subsets of *X*.

We let
*t(X,r)* = 1 + dim(*T(X,r)*).

Radon's theorem asserts that

If *t(X,1)* < |*X*| then *t(X, 2)* > 0.

If

*t(X,1)*+

*t(X,2)*< |

*X*| then

*t(X,3)*>0.

In the lecture I will discuss connections with topology and with various problems in graph theory.

I will also mention questions regarding dimensions of intersection of convex sets.

1) A lecture (from 1999): An invitation to Tverberg Theorem: https://youtu.be/Wjg1_QwjUos

2) A paper on Helly type problems by Barany and me https://arxiv.org/abs/2108.08804

3) A link to Barany's book: Combinatorial convexity https://www.amazon.com/Combinatorial-Convexity-University-Lecture-77/dp/1470467097

ZOOM Meeting ID: 868 7549 9085 Direct link: https://kaist.zoom.us/j/86875499085

Counting the number of points on a variety is a historical method for investigating the variety, for example, in the Weil conjecture. Nowadays, it is known that the point count helps us determine the E-polynomial. This E-polynomial, in turn, gives arithmetic-geometric information on the variety such as the dimension, the number of irreducible components and Euler characteristic.
In this talk, we will consider a specific type of variety, the character variety associated to the fundamental group of a surface. In short, we will discuss this variety for a punctured surface, with regular semisimple or regular unipotent monodromy at the punctures. This variety plays a crucial role in diverse areas of mathematics, including non-abelian Hodge theory, geometric Langlands program and mathematical physics. The complex representation theory of finite groups will be used to compute the number of points on such a variety.

9:30-10:30am
Title: Equations in Simple Groups
Abstract: Given a word w in a free group on variables x_1,...,x_n, a finite group G, and an element g in G, we consider the question of whether the equation w = g has solutions where the x_i take values in G, and if so, how many. I am particularly interested in what happens when the word is fixed and G is a large finite simple groups. I will say something about the ideas which have led to progress for certain families of words, with emphasis on open problems.
10:50-11:50
Title: Elliptic curves and field arithmetic
Abstract: Let E be an elliptic curve over a field K. When K is a number field, Mordell's theorem says that the points of E over K form a finitely generated group. We say a field is "anti-Mordellic" if the opposite is true for all E/K. I will discuss what is known about anti-Mordellic fields, with emphasis on a longterm joint project with Bo-Hae Im to understand the relation between the anti-Mordellic property and the absolute Galois group of K.

Ellipsoidal BGK model (ES-BGK) is a generalized version of the Boltzmann-BGK model.
In this model, the local Maxwellian in the relaxation operator is extended to an ellipsoidal Gaussian
with a Prandtl parameter ν, so that the correct Prandtl number can be computed in the Navier-Stokes
limit. In this talk, we review some of the recent results on ES-BGK model, such as the existence
(stationary or non-stationary) theory and the entropy-entropy production estimates. A dichotomy
is observed between −1/2 < v < 1 and ν=−1/2. In the former case, an equivalence relation between
the local temperature and the temperature tensor enables one to apply theories developed
for the original BGK model in a modified form. In the critical case (ν=−1/2), where the correct
Prandtl number is achieved, such equivalence breaks down, and the structure of the flow has
to be incorporated to estimate the temperature tensor from below. This is from joint works with
Stephane Brull, Doheon Kim, and Son Sung Jun.