The maximum hook length of $d$-distinct simultaneous core partitions
Ethan Pesikoff, Benjamin Przybocki, Janabel Xia

TL;DR
This paper precisely finds the maximum hook length in finitely many $d$-distinct $(s,t)$-core partitions and offers an algorithm to construct such partitions with this maximum hook length.
Contribution
It introduces an exact determination of the maximum hook length for $d$-distinct $(s,t)$-core partitions and provides a constructive algorithm.
Findings
Maximum hook length determined explicitly
Algorithm for constructing partitions with maximum hook length
Applicable to finitely many $d$-distinct $(s,t)$-core partitions
Abstract
We exactly determine the maximum possible hook length of -core partitions with -distinct parts when there are finitely many such partitions. Moreover, we provide an algorithm to construct a -distinct -core partition with this maximum possible hook length.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · graph theory and CDMA systems · Limits and Structures in Graph Theory
