학과 세미나 및 콜로퀴엄




2011-05
Sun Mon Tue Wed Thu Fri Sat
1 2 3 1 4 1 5 6 1 7
8 9 1 10 4 11 1 12 2 13 1 14
15 16 1 17 1 18 19 1 20 1 21
22 23 24 25 26 1 27 1 28
29 30 31        
2011-06
Sun Mon Tue Wed Thu Fri Sat
      1 1 2 3 2 4
5 6 7 8 9 1 10 11
12 13 14 15 1 16 17 18
19 20 21 22 23 24 25
26 27 1 28 29 30 1    

로그인 시, 세미나를 이메일로 구독할 수 있습니다.

Lascoux-Leclerc-Thibon conjectured the simple modules over Hecke akgebras
are controled by the fundamental representation of affine quantum groups.
This is proved by Ariki in a more generalized form.
Recently, Kovanov-Lauda and Rouquier introduced a new algebra
which is generalization of Hecke algebras,
and they conjectured that this algebra categorifies highest modules
of quantum groups. This conjecture is solved by myself and
Seok-Jin Kang (arXiv:1102.4677). In this talk, I will explain them.

Host: 최서현     미정     2011-06-17 13:41:36

There are three ways to define an orbifold: orbifolds
charts, groupoids, stacks. I will explain these notions in smooth
category by working out a few basic examples. It will be one of the
goals of the talk to give some understanding of the notion of stacks,
which is an important language to study moduli problems and also an
orbifold as a presentation-free intrinsic object. If time allows, I
will get to the definitions of group actions on orbifolds and the
(equivariant) cohomology over integer coefficients.

Host: 쿠로키     미정     2011-06-15 13:23:52

We consider the problem  : div(pu) = f (u),  u > 0 in Ω, u = 0 on Ω.  where

is a bounded  domain  in IRn , n 3, p : ¯ IR is a given positive  weight such

              

that p      H 1 (Ω)      C (¯ ), and f satisfying  q-growth assumptions with q =   2n n2is the

0

critical  exponent for the Sobolev embedding  of H 1 (Ω) into Lq (Ω).  We discuss some

existence  results  for the problem  above.

 

Host: Prof. 권순식     미정     2011-06-13 15:16:46

A set A of integers is a Sidon set if all the sums a1+a2, with a1≤a2and a1, a2∈A, are distinct. In the 1940s, Chowla, Erdős and Turán showed that the maximum possible size of a Sidon set contained in [n]={0,1,…,n-1} is √n (1+o(1)). We study Sidon sets contained in sparse random sets of integers, replacing the ‘dense environment’ [n] by a sparse, random subset R of [n].

Let R=[n]m be a uniformly chosen, random m-element subset of [n]. Let F([n]m)=max {|S| : S⊆[n]m Sidon}. An abridged version of our results states as follows. Fix a constant 0≤a≤1 and suppose m=m(n)=(1+o(1))na. Then there is a constant b=b(a) for which F([n]m)=nb+o(1) almost surely. The function b=b(a) is a continuous, piecewise linear function of a, not differentiable at two points: a=1/3 and a=2/3; between those two points, the function b=b(a) is constant. This is joint work with Yoshiharu Kohayakawa and Vojtech Rödl.

Host: Sang-il Oum     영어     2011-04-24 12:40:49

We show that an n-vertex hypergraph with no r-regular subgraph has at most 2n-1+r-2 edges. We conjecture that if n>r, then every n-vertex hypergraph with no r-regular subgraph having the maximum number of edges contains a full star, meaning 2n-1 distinct edges containing a single vertex. We prove this conjecture for n≥425. This is joint work with Alexandr V. Kostochka.

 

Host: Sang-il Oum     영어     2011-05-23 10:37:44
abstract : We classify equivariant topological complex vector bundles over two-sphere under a compact Lie group (not necessarily effective) action. It is shown that nonequivariant Chern classes and isotropy representations at (at most) three points are sufficient to classify equivariant vector bundles except a few cases.
Host: 서동엽     미정     2011-05-30 17:27:20

 In analytic number theory it is an interesting problem to find sharp  asymptotic bound for partial sum of Moebius function, due to its  intimate connection with Riemann zeta function. After we sketch Nathan  Ng's heuristic approach (2004) to this problem, we will consider its  function field analogue, in the context of a function field of algebraic  curves over finite fields. 

Host: 배성한     미정     2011-05-23 16:04:51

Petersen proved that every cubic graph without cut-edges has a perfect matching, but some graphs with cut-edges have no perfect matching. The smallest cubic graph with no perfect matching belongs to a general family applicable to many problems on connected d-regular graphs with n vertices. These include the smallest matching number for such graphs and a relationship between the eigenvalues and the matching number. In addition to these results, we present new results involving this family and the Chinese Postman Problem and a relationship between eigenvalues and edge-connectivity in regular graphs.
This is partly joint work with Sebastian M. Cioaba and Doulgas B. West.

Host: Sang-il Oum     영어     2011-05-05 15:30:05

The lack of national studies of the health effects of long-term exposure to ambient PM and its chemical components determining the PM toxicity represents a major evidence gap for the implementation of more effective air quality interventions. The US Environmental Protection Agency (EPA) is calling for research to explain heterogeneity in health responses to air pollutants that might be explained by the compositional differences in the pollution mixtures or sources or other factors.

 

We have developed Bayesian spatially varying coefficient regression models to estimate long-term effects of PM2.5 on mortality while identifying the chemical composition that modifies the health effects. We will use spatio-temporal variation in health outcomes and exposure to estimate: 1) spatially varying health risks associated with long-term exposure to PM2.5; and; 2) effect modification by PM2.5 constituents. Our models will account for spatial misalignment of the data and uncertainty in the estimation of PM2.5 chemical components.

 

We will apply our model to the Medicare Cohort Air Pollution Study (MCAPS) which includes 7.9 million Medicare enrollees followed for the period of 2000-2006 in the Eastern part of the US. We will use PM2.5 data from 518 monitoring stations and PM2.5 chemical components data from 241 monitors located in the Eastern region of the US. 

 

 


 

Yeonseung Chung, Brent Coull and Francesca Dominici

Host: Prof. 구자경     미정     2011-01-14 17:50:02

Hilbert scheme of points에 대한 정리들과 예들을 소개하고, Hilbert scheme의 scheme structre를 국소적으로는 어떻게 결정하는지에 대한, 즉 Deformation과 관련된 구체적인 계산을 보여줍니다.

Host: 박진현     한국어 (필요한 경우 영어 가능) ( )     2011-04-26 21:47:09

In 1970's Vinberg proved the criterion for a Zariski dense subgroup generated by reflections to be definable over A where A is an integrally closed Noetherian ring in a algebraically closed field F. In this talk we state the criterion for a Zariski dense subgroup generated by reflections to be definable over A. By Borel and Benoist, Zariski density is not needed in the criterion for a reflection group which divides an irreducible properly convex set of the real projective sphere Sn. In this talk, we are not planning to give any proof. We will rather focus on explaining the definitions and results. Finally we will apply the criterion to compute all the integral representations of some hyperbolic n-simplex reflection groups which comes from the deformation space of convex real projective strucures. If time permits, we will also expalin how integral representations of some other hyperbolic polyhedral reflection groups such as triangular prismatic and cubical groups can be computed.

Host: Prof. 김동수     한국어     2011-03-09 14:56:33

The aim of this talk is to give a first definition of "affine scheme" to people interested in algebraic geometry and its applications but who, have never tried to understand this language. We will briefly recall the definitions of category, functor and representable functor and...surprisingly this will be enough! Hopefully at the end of the talk we will define (affine) group schemes. In this talk we will assume that the audience is familiar with some very basic notions of commutative algebra.

Host: Prof. Wei-Dong Ruan     영어     2011-04-29 11:55:05

Hilbert scheme of points에 대한 정리들과 예들을 소개하고, Hilbert scheme의 scheme structre를 국소적으로는 어떻게 결정하는지에 대한, 즉 Deformation과 관련된 구체적인 계산을 보여줍니다.

Host: 박진현     한국어 (필요한 경우 영어 가능) ( )     2011-04-26 21:44:53

A graph G is called perfect if for every induced subgraph H of G, the chromatic number and the clique number of H are equal. After the recent proof of the Strong Perfect Graph Theorem, and the discovery of a polynomial-time recognition algorithm, the central remaining open question about perfect graphs is finding a combinatorial polynomial-time coloring algorithm. (There is a polynomial-time algorithm known, using the ellipsoid method). Recently, we were able to find such an algorithm for a certain class of perfect graphs, that includes all perfect graphs admitting no balanced skew-partition. The algorithm is based on finding special “extremal” decompositions in such graphs; we also use the idea of “trigraphs”.
This is joint work with Nicolas Trotignon, Theophile Trunck and Kristina Vuskovic.


[Graph Theory Day] http://mathsci.kaist.ac.kr/~sangil/seminar/entry/kaist-graph-theory-day-2011/

Host: Sang-il Oum     영어     2011-05-03 02:39:01

It is shown that for each t, there is a separator of size $O(t\sqrt{n})$ in any n-vertex graph G with no Kt-minor.

This settles a conjecture of Alon, Seymour and Thomas (J. Amer. Math. Soc., 1990 and STOC’90), and generalizes a result of Djidjev (1981), and Gilbert, Hutchinson and Tarjan (J. Algorithm, 1984), independently, who proved that every graph with n vertices and genus g has a separator of order $O(\sqrt{gn})$, because Kt has genus Ω(t2).
Joint work with Bruce Reed.


[Graph Theory Day] http://mathsci.kaist.ac.kr/~sangil/seminar/entry/kaist-graph-theory-day-2011/

Host: Sang-il Oum     영어     2011-05-03 02:44:44

 

Several reasons will be presented why the natural extension of the notion of undirected graph colorings is to partition the vertex set of a digraph into acyclic sets. Additionally, some recent results in this area, the proofs of which use probabilistic techniques, will be outlined.

 


[Graph Theory Day] http://mathsci.kaist.ac.kr/~sangil/seminar/entry/kaist-graph-theory-day-2011/

Host: Sang-il Oum     영어     2011-05-03 02:46:41

tournament is a digraph obtained from a complete graph by directing its edges, and colouring a tournament means partitioning its vertex set into acyclic subsets (acyclic means the subdigraph induced on the subset has no directed cycles). This concept is quite like that for graph-colouring, but different. For instance, there are some tournaments H such that every tournament not containing H as a subdigraph has bounded chromatic number. We call them heroes; for example, all tournaments with at most four vertices are heroes.
It turns out to be a fun problem to figure out exactly which tournaments are heroes. We have recently managed to do this, in joint work with Berger, Choromanski, Chudnovsky, Fox, Loebl, Scott and Thomassé, and this talk is about the solution.


[Graph Theory Day] http://mathsci.kaist.ac.kr/~sangil/seminar/entry/kaist-graph-theory-day-2011/

Host: Sang-il Oum     영어     2011-05-03 02:50:31

One of the main interest in algebraic number theory is to study Galois groups over number fields (and local fields) and their representations. In this talk, I will give an introduction to Galois representations obtained from elliptic curves or modular forms, and their relations. 

 

Host: Prof. Wei-Dong Ruan     영어     2011-04-29 17:39:05

Modular curves as moduli spaces of elliptic curves with some additional structures provide an important tool for studying arithmetic of elliptic curves. In this talk we will explain how rational points of modular curves can be applied to the problem of determining the torsion subgroups and ranks of elliptic curves over number fields.

Host: Prof. 구자경     미정     2011-01-04 10:07:53
The Reissner-Mindlin plate theory models a thin plate with the thickness t.
The condition number of nite element approximations of this model deteriorates
badly as the thickness t of the plate approaches to 0. In this talk, we develop an
overlapping domain decomposition method for the Reissner-Mindlin plate model
discretized with the Falk-Tu elements We use modern overlapping methods which
use the Schur complements to de ne coarse basis functions and show that the
condition number of this overlapping method is bounded by C(1+ H
 )3(1+logH
h )2.
Here H is the maximum diameter of the subdomains,  the size of overlap between
subdomains, and h the element size. Numerical examples are provided to con rm
the theory. We also modify the overlapping method to develop a BDDC method
for the Reissner-Mindlin model. We establish numerically an extension lemma to
obtain a constant bound and an edge lemma to obtain a C(1 + logH
h )2 bound.
Given such bounds, the condition number of this BDDC method is shown to be
bounded by C(1 + logH
h )2.
Host: Prof. 권순식     미정     2011-02-11 14:58:09

Hilbert scheme of points에 대한 정리들과 예들을 소개하고, Hilbert scheme의 scheme structre를 국소적으로는 어떻게 결정하는지에 대한, 즉 Deformation과 관련된 구체적인 계산을 보여줍니다.

Host: 박진현     한국어 (필요한 경우 영어 가능) ( )     2011-04-26 21:25:39