The optimal number of faces in cubical complexes

DOI10.1007/BF02589576zbMath0221.05021MaRDI QIDQ2547206

Bernt Lindström

Publication date: 1971

Published in: Arkiv för Matematik (Search for Journal in Brave)

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items

Another generalization of the Kruskal-Katona theorem, The cubical poset is additive, Polytopes, graphs, and complexes, A Kruskal-Katona type theorem for integer partitions, The edge-isoperimetric problem on the 600-vertex regular solid, On the orthogonal product of simplices and direct products of truncated Boolean lattices, On edge numberings of the \(n\)-cube graph, Another generalization of Lindström's theorem on subcubes of a cube, Über einen Satz von Kruskal, Über einen Satz von Kruskal, On posets whose products are Macaulay, More on the generalized Macaulay theorem, Yet another generalization of the Kruskal-Katona theorem, On the orthogonal product of simplices and products of truncated Boolean lattices, The filling problem in the cube

Cites Work

• Unnamed Item
• Möbius inversion in lattices
• Assignment of Numbers to Vertices
• A Combinatorial Problem in the k-Adic Number System
• Maximally Connected Arrays on the n-Cube
• Determinants on Semilattices
• The number of s-dimensional faces in a complex: An analogy between the simplex and the cube
• A generalization of a combinatorial theorem of macaulay
• Optimal Assignments of Numbers to Vertices
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]