Boolean layer cakes

DOI10.1016/S0304-3975(98)00274-6zbMATH Open0914.06001MaRDI QIDQ1285779FDOQ1285779

Authors: Jürg Schmid 

Publication date: 28 April 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Recommendations

• The dimension of suborders of the Boolean lattice
• The order dimension of two levels of the Boolean lattices
• The dimension of neighboring levels of the Boolean lattice

zbMATH Keywords

latticesgenerating setsorder dimensionBoolean latticecomputational aspectsorder automorphismsjump numbers\(n\)-dimensional ordered setBoolean layer cakeisotone self-mapslarge sublatticesmaximal sublatticesublattice spectrumsuborder

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorics of partially ordered sets (06A07) Structure theory of lattices (06B05)

Cites Work

• Asymptotic Enumeration of Partial Orders on a Finite Set
• Title not available (Why is that?)
• Title not available (Why is that?)
• A survey of the theory of hypercube graphs
• Distance-preserving subgraphs of hypercubes
• Title not available (Why is that?)
• Partially Ordered Sets
• An explicit 1-factorization in the middle of the Boolean lattice
• On the order dimension of 1-sets versus \(k\)-sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimal scrambling sets of simple orders
• Concerning a Certain Set of Arrangements
• The average number of linear extensions of a partial order
• On the dimensions of ordered sets of bounded degree
• Lexicographic matching in Boolean algebras
• Two Hamilton cycles in bipartite reflective Kneser graphs
• $B$-valuations of graphs
• Cover-preserving order embeddings into Boolean lattices
• The dimension of suborders of the Boolean lattice
• Lexicographic matchings cannot form Hamiltonian cycles
• Explicit matchings in the middle levels of the Boolean lattice
• The jump number of suborders of the power set order
• Cover-preserving embeddings of bipartite orders into Boolean lattices
• A note on Frucht diagrams, Boolean graphs and Hamilton cycles
• Maximal Chains and Antichains in Boolean Lattices
• Automorphisms, isotone self-maps and cycle-free orders
• Title not available (Why is that?)
• The bandwidth problem for distributive lattices of breadth 3
• The number of order-preserving maps between fences and crowns
• Lattices with sublattices of a given order
• Partitions of large Boolean lattices
• Enumeration of order preserving maps
• Title not available (Why is that?)
• Maximal sublattices of finite distributive lattices
• Automorphisms and isotone self-maps of ordered sets with top and bottom
• Level sets in finite distributive lattices of breadth 3
• The order dimension of two levels of the Boolean lattices
• The dimension of interior levels of the Boolean lattice
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• On generalized middle-level problem
• On maximal sublattices of finite lattices
• The dimension of suborders of the Boolean lattice

This page was built for publication: Boolean layer cakes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1285779)