2020
DOI: 10.48550/arxiv.2003.13671
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Sizes of Simultaneous Core Partitions

Chaim Even-Zohar

Abstract: There is a well-studied correspondence by Jaclyn Anderson between partitions that avoid hooks of length s or t and certain binary strings of length s + t. Using this map, we prove that the total size of a random partition of this kind converges in law to Watson's U 2 distribution, as conjectured by Doron Zeilberger.

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 11 publications
(12 reference statements)
0
1
0
Order By: Relevance
“…The perspective of word statistics is particularly useful for understanding its properties. It has been shown in [Eve20b] that 1 24 (s 2 −1)(t 2 −1)− 1 2 (#stst+#tsts) gives the number of boxes in the random partition. This has proven a curious relation between the size distribution of (s, t)-core partitions and the null distribution of Watson's U 2 , due by Zeilberger [EZ15], and has simplified other results on this problem.…”
Section: Example 6 Simultaneous Core Partitionsmentioning
confidence: 99%
“…The perspective of word statistics is particularly useful for understanding its properties. It has been shown in [Eve20b] that 1 24 (s 2 −1)(t 2 −1)− 1 2 (#stst+#tsts) gives the number of boxes in the random partition. This has proven a curious relation between the size distribution of (s, t)-core partitions and the null distribution of Watson's U 2 , due by Zeilberger [EZ15], and has simplified other results on this problem.…”
Section: Example 6 Simultaneous Core Partitionsmentioning
confidence: 99%