Conferences & Workshops

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

Organizers

KAIST 수리과학과 이창옥 교수

계산영상처리 미니워크숍
(Computational Imaging Processing Mini-Workshop)
 
일시: 2012년 8월 2일(목) 오후 3:00
 
장소 : 산업경영동 3층 세미나실 (3221호)
 
 
3:00-3:40 정미연 박사 (서울대 수학과), Nonlocal Active Contours
 
4:00-4:40 김선희 박사 (서울대 수학과), Unsupervised Multiple Region Segmentation by Adaptive Global Maximum Clustering
 
5:00-5:20 오승미 (서울대 수학과), Non-convex Hybrid Total Variation for Image Denoising
 
5:20-5:40 강명민 (서울대 수학과), Accelerated Bregman Method for Linearly Constrained l1-l2 Minimization
2012-07-26 17:24:50

Organizers

Organizer: 박경숙(아주대), 조용화(KAIST), 양승환(POSTECH)

주최: 대한수학회(The Korean Mathematical Society, http://www.kms.or.kr)

주관: 한국신진수학도 워크샵 준비위원회

후원: KAIST 수리과학과 BK21

홈페이지 : http://galois09.skku.ac.kr/wymk2012/

Contact: wymk_support_AT_live.com

2012-07-23 13:22:05

Organizers

Organizing committee Kihyoung Ko, Suhyoung Choi, Sang-hyun Kim

 

The 10th KAIST Geometric Topology Fair will focus on the recent developments in geometric group theory and three-manifold theory. The lecture series and talks will be aimed at graduate students and early career researchers.

(National Research Fund of Korean Government, 2011-0026138 & 2011-0027600)

 

August 13 - 17, 2012

KAIST, Daejeon, Korea.

http://mathsci.kaist.ac.kr/~shkim/gtfair

 

Lecture Series by

 

Michael Davis (Ohio State Univ.)

Graph products, RACGs and RAAGs

 

Koji Fujiwara (Tohoku Univ.)

Group actions on quasi-trees

 

Alan Reid (Univ. of Texas at Austin)

3-manifold groups, covering spaces and LERF

 

Research Talks by

 

Jinseok Cho (KIAS)

Kanghyun Choi (KAIST)

Stefan Friedl (Univ. of Cologne)

Thilo Kuessner (KIAS)

Sang-hyun Kim (KAIST)

Taehee Kim (Konkuk Univ.)

Sang-Jin Lee (Konkuk Univ.)

Gye-Seon Lee (Seoul National Univ.)

 

 

Organizing committee Kihyoung Ko, Suhyoung Choi, Sang-hyun Kim

Contact:

 

 

http://mathsci.kaist.ac.kr/~shkim/gtfair10/gtfair10/Main.html
2012-07-17 14:04:46
Speaker: Tomáš Kaiser, Paul Seymour, Maria Chudnovsky, Dani Language : 영어 

LIST OF SPEAKERS

11AM-12PM Tomáš Kaiser (University of West Bohemia, Czech Republic) Applications of the matroid-complex intersection theorem 1:30PM-2:30PM Paul Seymour (Princeton University, USA) Graphs, Tournaments, Colouring and Containment 2:45PM-3:45PM Maria Chudnovsky (Columbia University, USA) Excluding paths and antipaths 4:30PM-5:30PM Daniel Kráľ (University of Warwick, UK) Quasirandomness and property testing of permutations (This is a department colloquium at Room 1501)

ABSTRACTS

11AM Applications of the matroid-complex intersection theorems (Tomáš Kaiser)

The Matroid intersection theorem of Edmonds gives a formula for the maximum size of a common independent set in two matroids on the same ground set. Aharoni and Berger generalized this theorem to the `topological’ setting where one of the matroids is replaced by an arbitrary simplicial complex. I will present two applications of this result to graph-theoretical problems. The first application is related to the existence of spanning 2-walks in tough graphs, the other one is more recent and gives a bound on the fractional arboricity of a graph G ensuring that G can be covered by k forests and a matching. In both cases, slightly better results can be obtained by other methods, but there seems to be room for improvement on the topological side as well.

1:30PM Graphs, tournaments, colouring and containment (Paul Seymour)

Some tournaments H are heroes; they have the property that all tournaments not containing H as a subtournament have bounded chromatic number (colouring a tournament means partitioning its vertex-set into transitive subsets). In joint work with eight authors, we found all heroes explicitly. That was great fun, and it would be nice to find an analogue for graphs instead of tournaments. The problem is too trivial for graphs, if we only exclude one graph H; but it becomes fun again if we exclude a finite set of graphs. The Gyarfas-Sumner conjecture says that if we exclude a forest and a clique then chromatic number is bounded. So what other combinations of excluded subgraphs will give bounded chromatic (or cochromatic) number? It turns out (assuming the Gyarfas-Sumner conjecture) that for any finite set S of graphs, the graphs not containing any member of S all have bounded cochromatic number if and only if S contains a complete multipartite graph, the complement of a complete multipartite graph, a forest, and the complement of a forest. Proving this led us to the following: for every complete multipartite graph H, and every disjoint union of cliques J, there is a number n with the following property. For every graph G, if G contains neither of H,J as an induced subgraph, then V(G) can be partitioned into two sets such that the first contains no n-vertex clique and the second no n-vertex stable set. In turn, this led us (with Alex Scott) to the following stronger result. Let H be the disjoint union of H_1,H_2, and let J be obtained from the disjoint union of J_1,J_2 by making every vertex of J_1 adjacent to every vertex of J_2. Then there is a number n such that for every graph G containing neither of H,J as an induced subgraph, V(G) can be partitioned into n sets such that for each of them, say X, one of H_1,H_2,J_1,J_2 is not contained in G|X. How about a tournament analogue of this? It exists, and the same (short) proof works; and this leads to a short proof of the most difficult result of the heroes paper that we started with. There are a number of other related results and open questions. Joint work with Maria Chudnovsky.

2:45PM Excluding paths and antipaths (Maria Chudnovsky)

The Erdos-Hajnal conjecture states that for every graph H, there exists a constant delta(H)>0, such that every n-vertex graph with no induced subgraph isomorphic to H contains a clique or a stable set of size at least n^delta(H). This conjecture is still open. We consider a variant of the conjecture, where instead of excluding a single graph H as an induced subgraph, a family of graphs is excluded. We prove this modified conjecture for the case when the five-edge path and its complement are excluded. Our second result is an asymmetric version of this: we prove that for every graph G such that G contains no induced six-edge path, and the complement of G contains no induced four-edge path, G contains a polynomial-size clique or stable set. This is joint work with Paul Seymour.

4:30PM Quasirandomness and property testing of permutations (Daniel Kráľ) (This is a department colloquium at Room 1501)

A systematic study of large combinatorial objects has recently led to discovering many connections between discrete mathematics and analysis. In this talk, we explore the analytic view of large permutations. We associate every sequence of permutations with a measure on a unit square and show the following: if the density of every 4-element subpermutations in a permutation p is 1/4!+o(1), then the density of every k-element subpermutation is 1/k!+o(1). This solves a question of Graham whether quasirandomness of a permutation is captured by densities of its 4-element subpermutations. At the end of the talk, we present a result related to an area of computer science called property testing. A property tester is an algorithm which determines (with a small error probability) properties of a large input object based on a small sample of it. Specifically, we prove a conjecture of Hoppen, Kohayakawa, Moreira and Sampaio asserting that hereditary properties of permutations are testatble with respect to the so-called Kendal’s tau distance. The results in this talk were obtained jointly with Tereza Klimosova or Oleg Pikhurko.

http://mathsci.kaist.ac.kr/~sangil/seminar/entry/20121213/
2012-12-10 09:55:24

Organizers

Sijong Kwak(KAIST)

Yongnam Lee(KAIST)

Program
Banquet: January 23 (구르메한정식)
Lecture Room for the School: KAIST E6-1 #2411
Discussion and tea room for the School:KAIST E6-1 #2412
Seminars are planned.
11:00-12:00 in Jan 22. Maksym Fedorchuk
An introduction to the log minimal model program for the moduli space of curves
11:00-12:00 in Jan 26. Herbert Lange
Counter examples to Prym-Torelli with high Clifford index
Also seminars by Giorgio Ottaviani and Atsushi Noma in the week of Jan 28- Feb 1 are planned.

http://asarc.kaist.ac.kr/bbs/view.php?board_id=conference1&no=42
2013-01-16 09:19:08

Organizers

Organizing Committee

Prof. Wanmo Kang (KAIST) Prof. Kyoung-Kuk Kim (KAIST) Prof. In-Suk Wee (Korea University) Prof. Bara Kim (Korea University) Dr. Taeyoung Ha (NIMS) Dr. Myoungnyoun Kim (NIMS)

Schedule

 

March 18, 2013 (all-day event)
 
08:50-09:00 Welcome address by Prof. Dongsu Kim (President of NIMS)
09:00-09:40 Min Dai
    Optimal Trend Following Trading Rules
09:40-10:20 Kazutoshi Yamazaki
    On Optimal Dividends in the Dual Model
10:20-10:40 Coffee Break
10:40-11:20 Xianhua Peng
    The Econometrics of Asset Pricing with Spatial Interaction
11:20-12:00 Hyeng Keun Koo
    A Utility Model of Learning How to Consume Effectively
12:00-14:00 Lunch
14:00-14:40 Nan Chen
    Interconnected Balance Sheets, Market Liquidity, and the Amplification Effect in a Financial System
14:40-15:20 Ying Jiao
    Role of information in an optimization problem with counterparty default risks
15:20-15:40 Coffee Break
15:40-16:20 Arturo Kohatsu-Higa
    Multi level Monte Carlo (MLMC) for irregular functions and irregular diffusions
16:20-17:00 Kiseop Lee
    A Flocking Model for Multi-name Credit: A Mathematical Model for Multi-name Credit based on Community Flocking
17:20-17:40 Chulmin Kang
    Large Deviations for Affine Diffusion Processes on R+m x Rn
 
 
March 19, 2013 (all-day event)
 
09:00-09:40 Jiwook Jang
    A double shot noise process and its application in insurance
09:40-10:20 Garud Iyengar
    Large Scale Portfolio Selection with Spectral Risk Measures
10:20-10:40 Coffee Break
10:40-11:20 Xuedong He
    Loss-based Risk Measures
11:20-12:00 Bong-Gyu Jang
    Unemployment Risks and Optimal Retirement in an Incomplete Market
12:00-14:00 Lunch
14:00-14:40 Ning Cai
    International Reserve Management: a Drift Switching Reflected Jump-Diffusion Model
14:40-15:20 Tim Leung
    Implied Volatility of Leveraged ETF Options
15:20-15:40 Coffee Break
15:40-16:20 In-Suk Wee
    Pricing of geometric Asian options under Heston’s stochastic volatility model

16:20-17:00 Steven Kou
    First Passage Times of Two-Dimensional Brownian Motion

Contact Points

Dr. Taeyoung Ha (NIMS)   Dr. Myoungnyoun Kim (NIMS)  
http://csm.nims.re.kr/FM/conference/2013/
2013-03-15 13:26:13