Boolean layer cakes

DOI10.1016/S0304-3975(98)00274-6MaRDI QIDQ1285779zbMATH OpenFDO

Authors Jürg Schmid

Publication date 28 April 1999

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

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)

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

Cites work

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

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)