We first present the notions of abacus, core and regularisation of partitions. We then present an algorithm (the “caterpillar” algorithm) that provides a bijection between a set of regular partitions and a set of multipartitions. We will also mention some results about cores and regularisation for large partitions under the Plancherel measure.