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

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 601
  • Download : 0
The 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.
Advisors
Kim, Dong-Suresearcher김동수researcher
Description
한국과학기술원 : 수학과,
Publisher
한국과학기술원
Issue Date
1996
Identifier
105903/325007 / 000943588
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 수학과, 1996.2, [ 27 p. ; ]

Keywords

Plane Partition; 자연수의 평면 분할

URI
http://hdl.handle.net/10203/42438
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=105903&flag=dissertation
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