2004 Á¶ÇÕ·Ð Çмú´ëȸ


 


2004³â 8¿ù 16 (¿ù) ~ 8¿ù 17ÀÏ(È­)

¿¬¼¼´ëÇб³ À̰ú´ëÇÐ ¼öÇаú °úÇаü 225È£

 


ÁÖ°ü : ¿¬¼¼´ë BK ¿¬±¸ÆÀ,

ÈÄ¿ø : ´ëÇѼöÇÐȸ Àü»ê¼öÇкаú


Organizing committee

¹Ú½Â°æ(¿¬¼¼´ëÇб³)

ÀÌ»ó±¸(¼º±Õ°ü´ëÇб³)

ÀÌ»ó¿í(¼ö¿ø´ëÇб³)

Combinatorics Workshop, 2004 

Aug. 16- Aug 17, 2004

Yonsei University, Seoul, Korea


2004³â 8¿ù, Combinatorics¿Í °ü·ÃµÈ ±¹³» ¿¬±¸ÀÇ È°¼ºÈ­¸¦ À§ÇÏ¿© ¿¬¼¼´ëÇб³ ¼öÇаú¿Í ´ëÇѼöÇÐȸ Àü»ê¼öÇÐ ºÐ°úÀÇ ÈÄ¿øÀ¸·Î Combinatorics Workshop  2004 À» °³ÃÖÇÒ ¿¹Á¤ÀÔ´Ï´Ù. °ü½ÉÀÌ ÀÖÀ¸½Å ºÐµéÀÇ ¸¹Àº Âü°¡¿Í ÇùÁ¶¸¦ ºÎʵ右´Ï´Ù.


¢Ä ¸ñ Ç¥
Á¶ÇÕ·Ð ÀÌ·ÐÀÇ ¼Ò°³¿Í ±×¿Í °ü·ÃµÈ ¹®Á¦ÀÇ ¼Ò°³.
Á¶ÇÕ·Ð ºÐ¾ß ±¹³» ¿¬±¸ ÀηÂÀÇ ¾ç¼ºÀ» À§ÇÑ working groupÀÇ ±¸¼º.
Á¶Çշаú °ü·ÃµÈ ¿¬±¸ÀÇ °øµ¿¿¬±¸ Ȱµ¿ ¸ð»ö.
±¹Á¦ Çй® ±³·ù µµ¸ð ¹× °æÀï·Â È®º¸.

¢Ä ÁÖ Á¦ 
Á¶ÇÕ·Ð ¹× ±×¿Í °ü·ÃµÈ ¹®Á¦¿¡ ´ëÇÑ ¿¬±¸.

¢Ä Àå ¼Ò
¿¬¼¼´ëÇб³ À̰ú´ëÇÐ ¼öÇаú °úÇаü 225È£

¢Ä µî·Ïºñ
¾øÀ½


¢Ä ³» ¿ë

1. Proceeding  Á¦°ø.
2. ³í¹® ¹ßÇ¥

3. ÀÚÀ¯Åä·Ð
4. °ü·Ã ¹®Á¦ÀÇ ÇнÀ°ú °³¹ßÀ» À§ÇÑ ÅäÀÇ ¹× Åä·Ð, ¿¬±¸ ¹®Á¦ÀÇ °³¹ß°ú °øµ¿¿¬±¸ ¸ð»ö.


¢Ä Tentative Schedule: ´ëÇѼöÇÐȸ ȨÆäÀÌÁö
http://www.kms.or.kr/   °Ô½ÃÆÇ -> ÇмúȰµ¿ -> # 39¹ø Á¶ÇÕ·Ð ÇмúȸÀÇ ÂüÁ¶  

  ¶Ç´Â   http://matrix.skku.ac.kr/conference/2004Combnatorics2.htm

     ---  ÀÏ Á¤ -----

9:00 -- 9:30  µî·Ï   

9:30 -- 10:00 °³È¸½Ä

     

´ëÇѼöÇÐȸÀå´ÔÃà»ç   ´ëÇѼöÇÐȸ ºÎȸÀå°â ¿¬´ë °è¿­ÇкÎÀå´Ô Ãà»ç   ¿¬´ë BK 21 ÆÀÀå´Ô Ãà»ç

 


8¿ù16ÀÏ(¿ù) 

 

¿ÀÀüÀÏÁ¤ (ÁÂÀå : ÀÌ»ó¿í±³¼ö)


10:00 -- 10:40 (invited speaker) ±è¼­·É±³¼ö(¼­¿ï´ë)

Competition Graphs of Semiorders and the Conditions and


10:40 -- 11:00 ¹Î¼÷±³¼ö(¿¬¼¼´ë)

                Maximal inversions and forbidden permutations

         

11:00 -- 11:20 ±è»ó¸ñ¹Ú»ç(¼­°­´ë)

                Sets of Type-(1,n) in Symmetric Designs


11:20 -- 11:40 ¹ÎÇý¼º(¿¬¼¼´ë)

                Noncommutative t-Schur functions

 

11:40 -- 1:40 Á¡½É



8¿ù16ÀÏ(¿ù)  ¿ÀÈÄÀÏÁ¤ I (ÁÂÀå ±è¼­·É±³¼ö)



1:40 -- 2:20 (invited speaker) °í¿µ¹Ì±³¼ö(¼ö¿ø´ë)

              Random graphs and real world networks


2:20 -- 3:00 (invited speaker) ±èÇö±¤±³¼ö(Æ÷Ç×°ø´ë)

              Codes over poset metrics

       

3:00 -- 3:20 ÇöÁ¾À±(Æ÷Ç×°ø´ë)

MacWilliams duality and association schemes arising from poset metrics

 

3:20 -- 3:40 ÈÞ½Ä


8¿ù16ÀÏ(¿ù)  ¿ÀÈÄÀÏÁ¤ II (ÁÂÀå ±èÇö±¤±³¼ö)


3:40 -- 4:20 (invited speaker) ÀÌÀç¿î±³¼ö(¿µ³²´ë)

              Some zeta functions of graph bundles


4:20 -- 5:00 (invited speaker) ±èµ¿¼ö±³¼ö(°ú±â´ë)

              Combinatorics of orthogonal polynomials


5:00 -- 5:20 ¿Àµ¿·Ä¹Ú»ç(Æ÷Ç×°ø´ë)

              The uniqueness of some optimal superimposed codes


5:30 -- 6:10 (invited speaker) ±è´ë»ê±³¼ö(¼­°­´ë)

Poset codes, association schemes and MacWilliams identities


6:10 -- 6:30 ½Å¿µÈñ(¿µ³²´ë)

              Edge colorability of strong graph bundles    


6:30          Àú³á

---------------------------------------------------------

8¿ù 17ÀÏ (È­)


¿ÀÀüÀÏÁ¤ (ÁÂÀå Á¶ÇÑÇõ±³¼ö)


10:00 -- 10:40 (invited speaker) ¼ÕÀç¹ü±³¼ö(¿¬¼¼´ë)

                q-continued fractions and related q-series


10:40 -- 11:00 Á¶¸¸¿ø(°ú±â´ë)

                Colored Prüfer Codes for k-Edge Colored Trees

         

11:00 -- 11:20 ÀÌÈ£±Ô¹Ú»ç(¿¬¼¼´ë)

                Generalizations of Zeckendorf theorem


11:20 -- 11:40 ¼³Çѱ¹¹Ú»ç(¼º±Õ°ü´ë)

                Bound on exponents of r-regular primitive digraphs 


11:40 -- 1:40 Á¡½É


8¿ù 17ÀÏ (È­) ¿ÀÈÄÀÏÁ¤ I (ÁÂÀå  ±èµ¿¼ö±³¼ö)



1:40 -- 2:20 (invited speaker) Á¶ÇÑÇõ±³¼ö(¼­¿ï´ë)

             ¸¶ÀÌÅ©·Î¿ùµå¿Í ÀÌ»ê¼öÇÐ ±³À°


2:20 -- 3:00 (invited speaker) À̻󱸱³¼ö(¼º±Õ°ü´ë)

              Blackout puzzle ÀÇ ´ë¼öÀû ÇØ¹ý°ú ¾Ë°í¸®Áò ¹× ¼ÒÇÁÆ®¿þ¾î


3:00 -- 3:20 °­¼ººÀ(¿¬¼¼´ë)

              Fibonacci polynomials and Fibonacci permutations


3:20 -- 3:40 Break




8¿ù 17ÀÏ (È­) ¿ÀÈÄÀÏÁ¤ II (ÁÂÀå À̻󱸱³¼ö)



3:40 -- 4:20 (invited speaker) ÀÌâ¿ì±³¼ö(¼­¿ï½Ã¸³´ë)

             Domination in cubic graphs


¿¬±¸ ¹ßÇ¥

 

 

4:20 -- 5:00 (invited speaker) ÀÌ»ó¿í±³¼ö(¼ö¿ø´ë)

              Quasisymmetric functions


5:00 -- 5:20 ±èÈ­¼º¹Ú»ç(¿¬¼¼´ë)

              Shuffle posets and P-partitions


5:20 -- 5:40 ±èÈ­°æ(¼­¿ï´ë)

              Competition indices of digraphs


5:40 -- 6:00 À̰ü±Ô(¼­°­´ë)

Distance-Preserving Maps from Binary Vectors to Permutations


6:00         Æóȸ

             

 


Áö¹æ¿¡¼­ ¿À½Ã´Â ºÐµéÀ» À§ÇÏ¿© ¾Æ·¡¿Í °°ÀÌ ¼÷¼Ò¸¦ ¿¹¾àÇÏ¿´½À´Ï´Ù.
Àå¼Ò´Â ¿¬¼¼´ë ³»¿¡ ÀÖ´Â »ó³²°æ¿µ°üÀÔ´Ï´Ù. ¿¬¼¼´ëÇб³ ȨÆäÀÌÁöhttp://www.yonsei.ac.kr/yu/intro/campus/index.html#
·Î °¡¼Å¼­ Ä·ÆÛ½º Áöµµ¸¦ Ŭ¸¯ÇÏ½Ã¸é »ó³² °æ¿µ°ü(±×¸®°í °úÇаüµµ) ãÀ» ¼ö ÀÖ½À´Ï´Ù.

 

* ¼ö°íÇÑ ÆÀ¿øµé Àλç