On plane partition자연수의 평면 분할에 관하여

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 612
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorKim, Dong-Su-
dc.contributor.advisor김동수-
dc.contributor.authorHong, Ick-Chang-
dc.contributor.author홍익창-
dc.date.accessioned2011-12-14T05:00:16Z-
dc.date.available2011-12-14T05:00:16Z-
dc.date.issued1996-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=105903&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/42438-
dc.description학위논문(석사) - 한국과학기술원 : 수학과, 1996.2, [ 27 p. ; ]-
dc.description.abstractThe problem of determining the number of plane partitions invariant under various symmetry groups is among the most difficult problems in enumerative combinatorics. A tremendous amount of work has been devoted to these problems. This is a survey of the results on plane partitions which are invariant under various actions.eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectPlane Partition-
dc.subject자연수의 평면 분할-
dc.titleOn plane partition-
dc.title.alternative자연수의 평면 분할에 관하여-
dc.typeThesis(Master)-
dc.identifier.CNRN105903/325007-
dc.description.department한국과학기술원 : 수학과, -
dc.identifier.uid000943588-
dc.contributor.localauthorKim, Dong-Su-
dc.contributor.localauthor김동수-
Appears in Collection
MA-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0