Combinatorial Structure of the Faces of then-Cube

DOI10.1137/0135057zbMath0402.05010OpenAlexW2052420534MaRDI QIDQ4186327

Publication date: 1978

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0135057

zbMATH Keywords

Lattice Partition Chains Boolean Functions Bracketing Algorithm Combinatorial Structure Faces of the N-Cube

Mathematics Subject Classification ID

Partial orders, general (06A06) Enumerative combinatorics (05A99) Chain conditions, complete algebras (06E10)

Related Items (21)

Generalizations of Baxter's theorem and cubical homology ⋮ On the Stanley ring of a cubical complex ⋮ Representation of cubic lattices by symmetric implication algebras ⋮ An unpredictability approach to finite-state randomness ⋮ Cohomology of the rational ``electric tetrahedron relation ⋮ Maximum antichains of rectangular arrays ⋮ Cohomologies ofn-simplex relations ⋮ On the lattice of order ideals of an up-down poset ⋮ The face lattice of an \(n\)-dimensional cube ⋮ A geometric connection to threshold logic via cubical lattices ⋮ The \(r\)-signed Birkhoff transform ⋮ Matchings and the sum function ⋮ Parenthesizations of finite distributive lattices ⋮ Derangements on the \(n\)-cube ⋮ On the \(cd\)-variation polynomials of André and Simsun permutations ⋮ Cubical species and nonassociative algebras ⋮ Dyck Algebras, Interval Temporal Logic, and Posets of Intervals ⋮ An Erdős-Ko-Rado theorem for the subcubes of a cube ⋮ Kinematic formulas for finite lattices ⋮ On a class of lattices associated with n-cubes ⋮ Decompositions of \({\mathcal B}_ n\) and \({\varPi}_ n\) using symmetric chains

This page was built for publication: Combinatorial Structure of the Faces of then-Cube