On Stable embeddability of partitions

Details On Stable embeddability of partitions On Stable embeddability of partitions

2005-05-27

arxiv.org/abs/math/0505611v1

European Journal of Combinatorics 28 (2007) 848--857

Mathematics

Combinatorics

10 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On Stable embeddability of partitions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Stable embeddability of partitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Stable embeddability of partitions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-522995