𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on minimal triangulations of an n-cube

✍ Scribed by John F. Sallee

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
219 KB
Volume
4
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on triangulating the 5-cube
A note on triangulating the 5-cube
✍ Mark N. Broadie; Richard W. Cottle πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 888 KB
A note on the edges of the n-cube
A note on the edges of the n-cube
✍ Sergiu Hart πŸ“‚ Article πŸ“… 1976 πŸ› Elsevier Science 🌐 English βš– 671 KB

The following combinatorial problem, which arose in game theory, is solved here: To tind a selt of vertices of ;P given size (in t.k nxube) which has a maximal number sf interconnecting edges,

On a problem of Yuzvinsky on separating
On a problem of Yuzvinsky on separating the n-cube
✍ D.J. Kleitman πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 474 KB

The following problem of Yuzvinsky is solved here: how many vertices of the n-cube must be removed from it in order that no connected component of the rest contains an antipodal pair of vertices? Some further results and problems are described as well.

On a class of lattices associated with n
On a class of lattices associated with n-cubes
✍ Francesco Mazzocca πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 265 KB

A Lattice L(X) is defined starting from a cubical lattice L and an increasing diagonally closed subset X of L (Section 1). The lattice L(X) are proved to be--up to isomorphism--precisely those of signed simplexes of a simplical complex (Section 2); furthermore, an algebraic combinatorial characteriz