On Stable embeddability of partitions

Simple item page
dc.creatorKim, Dongseok
dc.creatorLee, Jaeun
dc.date2005-05-27
dc.date.accessioned2026-07-07T06:34:23Z
dc.date.available2026-07-07T06:34:23Z
dc.descriptionSeveral 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.
dc.description10 pages
dc.identifierhttps://arxiv.org/abs/math/0505611
dc.identifierhttp://arxiv.org/abs/math/0505611
dc.identifierEuropean Journal of Combinatorics 28 (2007) 848--857
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/99511
dc.subjectCombinatorics
dc.subject05A17
dc.titleOn Stable embeddability of partitions
dc.typetext

Files

Collections

arXiv