English

Bijections between t-Core Partitions and t-Tuples

Combinatorics 2019-11-20 v2

Abstract

This note introduces some bijections relating core partitions and tuples of integers. We apply these bijections to count the number of cores with various types of restriction, including fixed number of parts, limited size of parts, parts divisible by some integer, and distinct parts. For example, we prove that the number of 2t2t-core partitions into ll even parts equals the number of tt-core partitions into ll parts. We also generalize one expression for simultaneous cores, which was given by Baek, Nam and Yu, recently. Subsequently, we use this expression to obtain recurrence satisfied by numbers of (s,s+1,,s+r)(s,s+1,\cdots,s+r)-core partitions for s1s\geq1.

Keywords

Cite

@article{arxiv.1903.07772,
  title  = {Bijections between t-Core Partitions and t-Tuples},
  author = {Hao Zhong},
  journal= {arXiv preprint arXiv:1903.07772},
  year   = {2019}
}

Comments

24 pages, 3 figures

R2 v1 2026-06-23T08:12:17.536Z