Arithmetical properties of the number of t-core partitions

Abstract

Let Λ={λ1≥⋅⋅⋅≥λs≥1} be a partition of an integer n. Then the Ferrers-Young diagram of Λ is an array of nodes with λi nodes in the ith row. Let λj′ denote the number of nodes in column j in the Ferrers-Young diagram of Λ. The hook number of the (i,j) node in the Ferrers-Young diagram of Λ is denoted by H(i,j):=λi+λj′−i−j+1. A partition of n is called a t-core partition of n if none of the hook numbers is a multiple of t. The number of t-core partitions of n is denoted by a(t;n). In the present paper, some congruences and distribution properties of the number of 2t-core partitions of n are obtained. A simple convolution identity for t-cores is also given.