✦ LIBER ✦

On a class of lattices associated with n-cubes

✍ Scribed by Francesco Mazzocca

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 265 KB
Volume: 49
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(84)90110-9

No coin nor oath required. For personal study only.

✦ Synopsis

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 characterization of the lattices L(X) is given (Section 3).

📜 SIMILAR VOLUMES

Divisor class groups of affine semigroup

Divisor class groups of affine semigroup rings associated with distributive lattices

✍ Mitsuyasu Hashimoto; Takayuki Hibi; Atsushi Noma 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 276 KB

On a Class of Lattice Ordered Inverse Se

On a Class of Lattice Ordered Inverse Semigroups

✍ Gracinda M.S. Gomes; Emilia Giraldes; Donald B. McAlister 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 150 KB

It is well known that the free group on a non-empty set can be totally ordered and, further, that each compatible latttice ordering on a free group is a total ordering. On the other hand, Saitô has shown that no non-trivial free inverse semigroup can be totally ordered. In this note we show, however

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.

A Class of Hypergraph Arrangements with

A Class of Hypergraph Arrangements with Shellable Intersection Lattice

✍ Dmitry N. Kozlov 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 126 KB

For every hypergraph on n vertices there is an associated subspace arrangement in R n called a hypergraph arrangement. We prove shellability for the intersection lattices of a large class of hypergraph arrangements. This class incorporates all the hypergraph arrangements which were previously shown

On Hankel operators associated with a cl

On Hankel operators associated with a class of non-Toeplitz operators

✍ Avraham Feintuch 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 491 KB

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,