Several natural partial orders on integral partitions, such as the
embeddability, the stable embeddability, the bulk embeddability and the
supermajorization, raise in the quantum computation, bin-packing and matrix
analysis. We find the implications between these partial orders. For integral
partitions whose entries are all powers of a fixed number p, we show that the
embeddability is completely determined by the supermajorization order and we
find an algorithm to determine the stable embeddability.Comment: 10 page
