2007³â 8¿ù 6(¿ù)-8ÀÏ(¼ö), KAIST ¼ö¸®°úÇаú
°³¿ä / ÀÏÁ¤ / ¼¼ºÎ ³»¿ë / Âü°¡ ½Åû / ÇÐȸ Á¤º¸ / ¹ßÇ¥³í¹® ÃÊ·ÏÁý / ÇÐȸ »çÁø |
Á¦¸ñ / 2007 Á¶ÇÕ·Ð Çмú´ëȸ (2007 Combinatorics Workshop)
³¯Â¥ / 2007³â 8¿ù 6ÀÏ(¿ù) - 8ÀÏ(¼ö)
Àå¼Ò / KAIST ÀÚ¿¬°úÇе¿ °øµ¿°ÀǽÇ
Áß¿äÇÑ ³¯Â¥
2007³â 7¿ù 15ÀÏ(ÀÏ) 20ÀÏ(±Ý) / ¹ßÇ¥ ½Åû ¸¶°¨ (Long
Abstract Á¦Ãâ ¸¶°¨)
2007³â 7¿ù 17ÀÏ(È) 20ÀÏ(±Ý) / Âü°¡ ½Åû ¸¶°¨
2007³â 7¿ù 20ÀÏ(±Ý) 23ÀÏ(¿ù) / ¼÷¹Ú ´Üü ¿¹¾à ¹× °øÁö
2007³â 7¿ù 30ÀÏ(¿ù) / ÀÏÁ¤ È®Á¤ ¹× °øÁö
2007³â 8¿ù 6ÀÏ(¿ù) / Á¶ÇÕ·Ð Çмú´ëȸ ½ÃÀÛ
µî·Ïºñ / ¾øÀ½ (±³Åëºñ, ¼÷¹Úºñ ¹× ½Äºñ Áö¿ø ¾øÀ½)
¿¬¶ôó / kaist2007@gmail.com, 042-869-2769 (KAIST Á¶ÇÕ¼öÇÐ ¿¬±¸½Ç)
ÁøÇà (Staffs)
ÀÏÁ¤
½Ã°£ 8¿ù 6ÀÏ(¿ù) 8¿ù 7ÀÏ(È) 8¿ù 8ÀÏ(¼ö) ÁÂÀå ¿¬»ç ÁÂÀå ¿¬»ç ÁÂÀå ¿¬»ç 09:30 - 10:20 ¡¡ 7A ¼¼¼Ç
(±Ç¿µ¼ö)7A-1 ÃÊû °¿¬
(±ÇÀçÈÆ)8A ¼¼¼Ç
(³ëÀ¯¹Ì)8A-1 ÃÊû °¿¬
(³²´ö¿ì)10:20 - 10:40 ±ä ÈÞ½Ä ±ä ÈÞ½Ä 10:40 - 11:10 7A-2 °¿¬
(ÁÖÇü°ü)8A-2 °¿¬
(¼ÛÀÍÈ£)11:10 - 11:20 ÈÞ½Ä ÈÞ½Ä 11:20 - 11:50 7A-3 °¿¬
(Jack Koolen)8A-3 °¿¬
(½ÅÈñ¼º)11:50 - 12:30 Á¡½É 12:30 - 13:00 µî·Ï ÀÚÀ¯ Åä·Ð ¹× ÅäÀÇ 13:00 - 13:30 °³È¸ 13:30 - 14:20 6A ¼¼¼Ç
(¼½ÂÇö)6A-1 ÃÊû °¿¬
(¾ö»óÀÏ)7B ¼¼¼Ç
(Jack Koolen)7B-1 ÃÊû °¿¬
(¾ö»óÀÏ)8B ¼¼¼Ç
(±Ç¿µ¼ö)8B-1 ÃÊû °¿¬
(¾ö»óÀÏ)14:20 - 14:40 ±ä ÈÞ½Ä ±ä ÈÞ½Ä ±ä ÈÞ½Ä 14:40 - 15:30 6A-2 ÃÊû °¿¬
(°ûÁøÈ£)7B-2 ÃÊû °¿¬
(°¼øÀÌ)8B-2 °¿¬
(¼½ÂÇö)15:30 - 15:50 ±ä ÈÞ½Ä ±ä ÈÞ½Ä ±ä ÈÞ½Ä 15:50 - 16:20 6A-3 °¿¬
(±Ç¿µ¼ö)7B-3 °¿¬
(¾ÈÁöÇö)8B-3 °¿¬
(»ç³ë ¿ä½Ã¿À)16:20 - 16:30 ÈÞ½Ä ÈÞ½Ä ÈÞ½Ä 16:30 - 17:00 6A-4 °¿¬
(±èÀå¼ö)7B-4 °¿¬
(½ÅÈñ¼º)8B-4 °¿¬
(±èÀå¼ö)17:00 - 17:30 ±¤°í ±¤°í Æóȸ 17:30 - 20:00 ¼÷¼Ò ¹èÁ¤ ¿¬È¸ ¡¡
»ó¼¼ ÀÏÁ¤
8¿ù 6ÀÏ(¿ù)
µî·Ï / 12:30 - 13:00
°³È¸ / 13:00 - 13:30
6A ¼¼¼Ç / 13:30 - 17:00
6A-1 ÃÊû °¿¬ / 13:30 - 14:20 / ¾ö»óÀÏ / Circle Graphs Obstructions under Pivoting
6A-2 ÃÊû °¿¬ / 14:40 - 15:30 / °ûÁøÈ£ / Counting side-pairings of a polygon and Harer-Zagier Theorem
6A-3 °¿¬ / 15:50 - 16:20 / ±Ç¿µ¼ö / Reflexibility of regular Cayley maps for abelian groups
6A-4 °¿¬ / 16:30 - 17:00 / ±èÀå¼ö / The largest power of 2 in the number of involutions
±¤°í / 17:00 - 17:30
8¿ù 7ÀÏ(È)
7A ¼¼¼Ç / 09:30 - 11:50
7A-1 ÃÊû °¿¬ / 09:30 - 10:20 / ±ÇÀçÈÆ / Howe duality and Young tableaux
7A-2 °¿¬ / 10:40 - 11:10 / ÁÖÇü°ü / On the enumeration of certain weighted graphs
7A-3 °¿¬ / 11:20 - 11:50 / Jack Koolen / On a spectral characterization of the Hamming graphs
Á¡½É / 11:50 - 12:30
ÀÚÀ¯ Åä·Ð ¹× ÅäÀÇ / 12:30 - 13:30
7B ¼¼¼Ç / 13:30 - 17:00
7B-1 ÃÊû °¿¬ / 13:30 - 14:20 / ¾ö»óÀÏ / Excluding a Bipartite Circle Graph from Line Graphs
7B-2 ÃÊû °¿¬ / 14:40 - 15:30 / °¼øÀÌ / On refinements of Ramanujan's partition congruence modulo 5
7B-3 °¿¬ / 15:50 - 16:20 / ¾ÈÁöÇö / Certain Ranked Posets of Length One and Continued Fraction
7B-4 °¿¬ / 16:30 - 17:00 / ½ÅÈñ¼º / On a decomposition of simple polytopes
±¤°í / 17:00 - 17:30
¿¬È¸ / 17:30 - 20:00
8¿ù 8ÀÏ(¼ö)
8A ¼¼¼Ç / 09:30 - 11:50
8A-1 ÃÊû °¿¬ / 09:30 - 10:20 / ³²´ö¿ì / Modeling and analyses for biological networks
8A-2 °¿¬ / 10:40 - 11:10 / ¼ÛÀÍÈ£ / Polynomial representation for the number of partitions with length fixed
8A-3 °¿¬ / 11:20 - 11:50 / ½ÅÈñ¼º / Maple ¼Ò°³ ¹× ±âÃÊ
Á¡½É / 11:50 - 12:30
ÀÚÀ¯ Åä·Ð ¹× ÅäÀÇ / 12:30 - 13:30
8B ¼¼¼Ç / 13:30 - 17:00
8B-1 ÃÊû °¿¬ / 13:30 - 14:20 / ¾ö»óÀÏ / Rank-width and Well-quasi-ordering
8B-2 °¿¬ / 14:40 - 15:30 / ¼½ÂÇö / Threshold Arrangements
8B-3 °¿¬ / 15:50 - 16:20 / »ç³ë ¿ä½Ã¿À / The greedy algorithm for strict cg-matroids
8B-4 °¿¬ / 16:30 - 17:00 / ±èÀå¼ö / Á¶Çշп¡¼ÀÇ Maple È°¿ë
Æóȸ / 17:00 - 17:30
¹ßÇ¥ ½Ã°£
ÃÑ 5°³ÀÇ ¼¼¼Ç(session)À» °èȹÇÏ°í ÀÖÀ¸¸ç, ¸ðµç ¼¼¼Ç(session)¿¡´Â ÁÂÀå(chairman)ÀÌ ¹èÁ¤µÇ¸ç, ÁÂÀåÀÌ ½Ã°£À» ÅëÁ¦ÇÑ´Ù.
ÇϳªÀÇ ¼¼¼ÇÀº ÇÑ °³ÀÇ ÃÊû °¿¬(invited talk) ¿Í ¼¼ °³ÀÇ °¿¬(talk)À¸·Î ±¸¼ºµÇ¾î ÀÖ´Ù.
ÃÊû °¿¬Àº 50ºÐ¾¿ÀÌ°í, ±× ¿ÜÀÇ °¿¬Àº 30ºÐ¾¿ÀÌ´Ù.
¸Å °¿¬ »çÀ̸¶´Ù ÈÞ½Ä ½Ã°£ÀÌ ÀÖ°í, ÀÌ ½Ã°£¿¡ ¹ßÇ¥ÀÚ°¡ ½Ã°£ ³»¿¡ ÇÏÁö ¸øÇÑ °ÍÀ» ´Ù·ç°Å³ª, ÁúÀÇÀÀ´ä ½Ã°£À¸·Î È°¿ëÇÒ ¼ö ÀÖ´Ù.
¹ßÇ¥ ½ÅûÀÚ°¡ ¸¹À» °æ¿ì ¼¼¼ÇÀ» ´Ã¸®°Å³ª, ÃÊ·ÏÀ» °ËÅäÇÏ¿© ¹ßÇ¥ÀÚ¸¦ ¼±º°ÇÒ °ÍÀÌ´Ù.
½Ã°£ÀÌ ´õ ÇÊ¿äÇÑ ¹ßÇ¥ÀÚ´Â ±âŸÀÇ°ß¿¡ Ãß°¡ ½Ã°£À» ¿äûÇϸé, ÀÏÁ¤À» È®Á¤ÇÒ ¶§ ¹Ý¿µÇÑ´Ù.
Á¦°ø
´Ù°ú
¿¬È¸ (Banquet) / ¹ÙÀÌÅ· ºßÆä (8¿ù 7ÀÏ Àú³á 6½Ã, ´ë´ö ÄÁº¥¼Ç Ÿ¿î 2Ãþ)
¹ßÇ¥³í¹® ÃÊ·ÏÁý (abstracts) Á¦°ø <Çмú´ëȸ ȸº¸(proceedings)´Â µû·Î Á¦ÀÛÇÏÁö ¾ÊÀ½>
ÇÐȸ °Ô½ÃÆÇ / ¹ßÇ¥ÀÚ´Â °Ô½ÃÆÇ¿¡ ¹Ì¸® ¹ßÇ¥ÀÚ·á(³í¹®, ½½¶óÀÌµå µî)¸¦ ¿Ã·Á Âü¼®ÀÚµé°ú °øÀ¯
¼÷¹Ú ¿¹¾à / À¯ÁøÈ£ÅÚ (042-822-0131, À¯¼º¿Âõ°ü±¤´ÜÁö),
2ÀÎ½Ç 1¹Ú ±âÁØ Á¤»ó°¡ 47000¿ø ÇÒÀΰ¡ 42000¿ø
ÇÐȸ Âü°¡ ½Åû¼¿¡ ¼÷¹Ú ¿¹¾àÀ» ½ÅûÇϽøé, ÇÐȸ¿¡¼ ´Üü·Î ¿¹¾à
¼÷¹ÚÀ» ÀÌ¿ëÇÏ´Â ¸ðµç ºÐÀº ¿øÄ¢ÀûÀ¸·Î º»ÀÎÀÌ ¼÷¹Úºñ¸¦ ºÎ´ã
¹æÀ» È¥ÀÚ »ç¿ëÇϽô °æ¿ì¿¡µµ 2ÀÎ½Ç ¹æÀ» ¿¹¾àÇÔ
¹æÀ» µÎ ¸íÀÌ °°ÀÌ »ç¿ëÇÏ·Á´Â °æ¿ì¿¡´Â ´ëÇ¥·Î 1¸í¸¸ ¿¹¾àÇÏ¸é µÊ
Çмú´ëȸ ÇöÀå »çÁø ¿Â¶óÀÎ Á¦°ø
KAIST °Ç¹° ³» ¹«¼± ÀÎÅÍ³Ý ¼ºñ½º Á¦°ø
°úÇеµ¼°ü(E9) Book Cafe Àü»ê½Ç ÀÌ¿ë °¡´É
KAIST Ä·ÆÛ½º ³» ÁÖÂ÷Àå Á¦°ø
ÃÊû °¿¬ÀÚ¿¡°Ô´Â ¼ÒÁ¤ÀÇ °¿¬·á Áö±Þ
¹ßÇ¥ ¹× Âü°¡ ½Åû / ¾Æ·¡ÀÇ Âü°¡ ½Åû¼¸¦ ±âÇѱîÁö kaist2007@gmail.com À¸·Î Á¦Ãâ
Á¦¸ñ / 2007 Á¶ÇÕ·Ð Çмú´ëȸ Âü°¡ ½Åû¼
À̸§ / È«±æµ¿
¼Ò¼Ó / KAIST
Á÷ÇÔ / <±³¼ö, ¹Ú»ç, Çлý> Áß ÅÃÀÏ
ÇÚµåÆù / 01X-XXX-XXXX
À̸ÞÀÏ / kaist2007@gmail.com
¼÷¹Ú¿¹¾à / <¾øÀ½, 6-7ÀÏ(1¹Ú), 7-8ÀÏ(1¹Ú), 6-8ÀÏ(2¹Ú)> Áß ÅÃÀÏ
Âü°¡ÇüÅ / <¿î¿µ À§¿ø, ÃÊû ¿¬»ç, ¹ßÇ¥ÀÚ, Âü¼®ÀÚ> Áß ÅÃÀÏ
-------- (ÃÊû ¿¬»ç¿Í ¹ßÇ¥ÀÚ´Â ¾Æ·¡ÀÇ ³»¿ë Ãß°¡ ÀÛ¼º) --------
¹ßÇ¥¹æ¹ý / <projector, OHP ¹× white board> Áß ÅÃÀÏ
°øµ¿ÀúÀÚ / ±èÀ»µ¿(XX´ëÇб³), ¹Úö¼ö(XX¿¬±¸¼Ò), È«±æµ¿(KAIST)
¹ßÇ¥Á¦¸ñ / \title{ ......... (LaTeX source) .......... }
Long Abstract / \begin{abstract} ......... (LaTeX source) .......... \end{abstract}
(ÃÊ·ÏÀº A4 ÇÑ Àå ºÐ·® Á¤µµ·Î ÃæºÐÈ÷ ÀÛ¼º)
±âŸÀÇ°ß / ¹ßÇ¥¸¦ ¼±È£ÇÏ´Â ³¯Â¥¸¦ Àû°Å³ª, Ãß°¡ ½Ã°£À» ¿äû.
¸ñÀû / Á¶ÇÕ·Ð °ü·ÃºÐ¾ß ¿¬±¸ÀÚµéÀÌ ÇÑ ÀÚ¸®¿¡ ¸ð¿© ¿¬±¸°á°ú¸¦ ¹ßÇ¥ÇÏ°í °ü½É ÀÖ´Â ¹®Á¦µé¿¡ ´ëÇØ ÅäÀÇÇÏ¸é¼ ¼·Î ¿¬±¸È°µ¿À» µµ¿Í¼ ±¹³» Á¶ÇÕ·Ð ºÐ¾ß ¿¬±¸ÀÇ È°¼ºÈ¿¡ ±â¿©ÇÑ´Ù.
ºÐ¾ß / Á¶ÇÕ·Ð ¹× ±× ÀÀ¿ë°ú °ü·ÃµÈ ¸ðµç ºÐ¾ß. Á¶Çշаú ÀÌ»ê¼öÇÐÀÇ ±³À°°ú °ü·ÃµÈ ºÐ¾ß.
¿î¿µ À§¿ø (Organizing Committee)
±èµ¿¼ö (KAIST ¼ö¸®°úÇаú) / dongsu.kim@kaist.ac.kr, 042-869-2729
¹Ú½Â°æ (¿¬¼¼´ëÇб³ ¼öÇаú) / sparky@yonsei.ac.kr, 02-2123-2597
¼½ÂÇö (ûÁÖ´ëÇб³ ¼öÇб³À°°ú)
ÀÌÀç¿î (¿µ³²´ëÇб³ ¼öÇаú) / julee@yu.ac.kr, 053-810-2311
ÃÊû ¿¬»ç (Invited Speaker)
°¼øÀÌ (°íµî°úÇпø) / On refinements of Ramanujan's partition congruence modulo 5
°ûÁøÈ£ (POSTECH) / Counting side-pairings of a polygon and Harer-Zagier Theorem
±ÇÀçÈÆ (¼¿ï½Ã¸³´ëÇб³) / Howe duality and Young tableaux
³²´ö¿ì (±¹°¡¼ö¸®°úÇבּ¸¼Ò) / Modeling and analyses for biological networks
¾ö»óÀÏ (University of Waterloo)
/ 1. Circle Graphs Obstructions under Pivoting
¾ö»óÀÏ (University of Waterloo) / 2. Excluding a
Bipartite Circle Graph from Line Graphs
¾ö»óÀÏ (University of Waterloo) / 3. Rank-width
and Well-quasi-ordering
¿¬Çõ / Á¶ÇÕ·Ð Çмú´ëȸ´Â 2004³âºÎÅÍ ¸Å³â °³ÃÖÇØ ¿Ô´Ù. 2004³â°ú 2005³â¿¡´Â ¿¬¼¼´ëÇб³¿¡¼, 2006³â¿¡´Â ¿µ³²´ëÇб³¿¡¼ °³ÃֵǾú´Ù. 2007³â¿¡´Â KAIST¿¡¼ °³ÃÖµÉ ¿¹Á¤ÀÌ´Ù.
2004 Á¶ÇÕ·Ð
Çмú´ëȸ (2004 Combinatorics Workshop) / ¿¬¼¼´ëÇб³ BK ¿¬±¸ÆÀ
2004³â 8¿ù 16ÀÏ(¿ù)-17ÀÏ(È) / ¿¬¼¼´ëÇб³ ÀÌ°ú´ëÇÐ ¼öÇаú °úÇаü 225È£
2005 Á¶ÇÕ¼öÇÐ
Çмú´ëȸ (2005 Combinatorial Mathematics Conference) / ¿¬¼¼´ëÇб³ BK ¿¬±¸ÆÀ
2005³â 8¿ù 8ÀÏ(¿ù)-10ÀÏ(¼ö) / ¿¬¼¼´ëÇб³ ÀÌ°ú´ëÇÐ ¼öÇаú °úÇаü 225È£
2006 Á¶ÇÕ·Ð Çмú´ëȸ
(2006 Combinatorics Workshop) / ¿µ³²´ëÇб³ ÀÌ°ú´ëÇÐ ¼öÇаú
2006³â 8¿ù 9ÀÏ(¼ö)-10ÀÏ(¸ñ) / ¿µ³²´ëÇб³ Á¦1°úÇаü 319È£
2007 Á¶ÇÕ·Ð Çмú´ëȸ
(2007 Combinatorics Workshop) / KAIST ¼ö¸®°úÇаú Á¶ÇÕ¼öÇÐ ¿¬±¸½Ç
2007³â 8¿ù 6ÀÏ(¿ù)-8ÀÏ(¼ö) / KAIST ÀÚ¿¬°úÇе¿ °øµ¿°ÀǽÇ
ÇÐȸ »çÁø (´Ù¿î ¹Þ±â)
ÀÌ ¹®¼´Â global $PHP_SELF; $php_self=basename(__FILE__); $file = filemtime($php_self); $file_time = date("Y³â m¿ù dÀÏ", $file); echo $file_time; ?>¿¡ ¸¶Áö¸·À¸·Î ¾÷µ¥ÀÌÆ® µÇ¾ú½À´Ï´Ù. |
Combinatorics Lab, Department of
Mathematical Sciences, KAIST, 335 Gwahangno, Yuseong-gu, Daejeon, 305-701,
Republic of Korea (South)
Copyright © 2007, Combinatorics Lab. All right reserved.