How to determine a partition up to conjugation using multisets of hook lengths

Hayan Nam, Myungjun Yu

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

If two partitions are conjugate, their multisets of hook lengths are the same. Then one may wonder whether the multiset of hook lengths of a partition determines a partition up to conjugation. The answer turns out to be no. However, we may add an extra condition under which a given multiset of hook lengths determines a partition uniquely up to conjugation. Herman-Chung, and later Morotti found such a condition. We give an alternative proof of Morotti's theorem and generalize it.

Original languageEnglish
Article number111969
JournalDiscrete Mathematics
Volume343
Issue number9
DOIs
Publication statusPublished - 2020 Sep

Bibliographical note

Publisher Copyright:
© 2020 Elsevier B.V.

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'How to determine a partition up to conjugation using multisets of hook lengths'. Together they form a unique fingerprint.

Cite this