Boolean layer cakes

DOI10.1016/S0304-3975(98)00274-6zbMath0914.06001MaRDI QIDQ1285779

Juerg Schmid

Publication date: 28 April 1999

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

zbMATH Keywords

generating setsBoolean latticelatticesorder dimensioncomputational 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)

Related Items

On generalized middle-level problem ⋮ On maximal sublattices of finite lattices

Cites Work

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