On stable embeddability of partitions
From MaRDI portal
Publication:872043
DOI10.1016/J.EJC.2005.11.001zbMATH Open1113.05013arXivmath/0505611OpenAlexW1973680221MaRDI QIDQ872043FDOQ872043
Publication date: 27 March 2007
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Abstract: 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 , we show that the embeddability is completely determined by the supermajorization order and we find an algorithm to determine the stable embeddability.
Full work available at URL: https://arxiv.org/abs/math/0505611
Recommendations
- Simultaneous embeddability of two partitions
- Stable-\(\Pi\) partitions of graphs
- On random stable partitions
- scientific article; zbMATH DE number 4195959
- Partitioning of invariant imbedding systems
- On strongly stable graphs and some consequences for partitionable graphs
- Stability analysis for \(L\)-partitions in a finite-dimensional space
- Stable partitions with \(\mathcal W\)-preferences
- Embedding the dual complex of hyper-rectangular partitions
- Embedding coproducts of partition lattices
Cites Work
Cited In (2)
This page was built for publication: On stable embeddability of partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q872043)