We study the question which bipartite ordered sets are order-preserving embeddable into two consecutive levels of a Boolean lattice. This is related to investigations on parallel computer architectures, where bipartite networks are embedded into hypercube networks. In our main Theorem we characteriz
โฆ LIBER โฆ
Embedding Boolean Structures into Atomic Boolean Structures
โ Scribed by Wojciech Buszkowski
- Publisher
- John Wiley and Sons
- Year
- 1986
- Tongue
- English
- Weight
- 151 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Cover-preserving embeddings of bipartite
โ
Jutta Mitas; Klaus Reuter
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 662 KB
Dynamic graphs and continuous Boolean ne
โ
A.I. Zeฤeviฤ; D.D. ล iljak
๐
Article
๐
2010
๐
Elsevier
๐
English
โ 865 KB
Embedding sheaf models for set theory in
โ
Andre Scedrov
๐
Article
๐
1986
๐
Elsevier Science
๐
English
โ 469 KB
Embedment of a fuzzy logic system into a
โ
Hisashi Suzuki; Suguru Arimoto
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 619 KB
Embedding Organic Light-Emitting Diodes
โ
Malte C. Gather; Fabian Ventsch; Klaus Meerholz
๐
Article
๐
2008
๐
John Wiley and Sons
๐
English
โ 264 KB
๐ 2 views
Effective embeddings into strong degree
โ
Timothy H. McNicholl
๐
Article
๐
2003
๐
John Wiley and Sons
๐
English
โ 215 KB
## Abstract We show that any partial order with a ฮฃ~3~ enumeration can be effectively embedded into any partial order obtained by imposing a strong reducibility such as โค~tt~ on the c. e. sets. As a consequence, we obtain that the partial orders that result from imposing a strong reducibility on th