On stable embeddability of partitions

Several natural partial orders on integral partitions, such as the embeddability, the stable embeddability, the bulk embeddability and the supermajorization, arise in quantum computation, bin-packing and matrix analysis. We find the implications of 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 for determining the stable embeddability.

• Publication year

  2005

• Venue

  European journal of combinatorics (Print)

• Publication date

  2005-05-27

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.ejc.2005.11.001arXiv math/0505611
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The Stable Embeddability on Modules over Complex Simple Lie Algebras

  2007cited by this paper
• The capacity of hybrid quantum memory

  2002influential reference
• Economic inequality and burden-sharing in the provision of local environmental quality

  2002cited by this paper
• Majorization and the interconversion of bipartite states

  2001cited by this paper
• Majorization and the interconversion of bipartite states

  2001cited by this paper
• Average-Case Analysis of First Fit and Random Fit Bin Packing

  1997cited by this paper
• Bounded Space On-Line Bin Packing: Best Is Better than First

  1991cited by this paper
• Enumerative Combinatorics

  1986cited by this paper
• Graduate Texts in Mathematics

  1982cited by this paper

• No citing papers are available for this paper.