✦ LIBER ✦

On minimum matrix representation of closure operations

✍ Scribed by F.E. Bennett; Lisheng Wu

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 1023 KB
Volume: 26
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(90)90018-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum matrix representation of closure

Minimum matrix representation of closure operations

✍ J. Demetrovics; Z. Füredi; G.O.H. Katona 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 702 KB

matrix M and A a set of its columns. We say that A implies a iff M contains no two rows equal i n A but different i n a. It is easy IO see that if Y,~,(A) denotes . the columns implied by A, than :/,,,(A) is a closure operation. We say that M represents this closure operation.

Minimum matrix representation of Sperner

Minimum matrix representation of Sperner systems

✍ F.E. Bennett; L. Wu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 483 KB

Let X be an n-element set and 2' be the family of subsets of X. If&C c 2' such that for any K. K\_ F .%'" K. f K\_ it-dim K. ct K. then Wr is ca!!pd a Sn~rtwr wstem Let \_M be 8~ ,+\_ x g \_\_l'\_\_L-~" '\_\_I , \_\_' \_\_\_\_=\_\_ \_\_ \_\_I i \_\_' \_ .

Matrix representations of propagation an

Matrix representations of propagation and scattering operations

✍ John A. Tague; Leon H. Sibul; Adam N. Mirkin 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 570 KB

Closure of Boolean operations on geometr

Closure of Boolean operations on geometric entities

✍ R.B. Tilove; A.A.G. Requicha 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 811 KB

Boolean operations akin to set intersection, union, and difference play an important role in CAD/CAM. Geometric entities of practical interest (e.g. polygons or polyhedra) are not algebraically closed under the conventional set operators, and therefore algorithms cannot implement conventional set op

On representation and approximation of o

On representation and approximation of operations in Boolean algebras

✍ I. R. Goodman; Vladik Kreinovich 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 78 KB 👁 1 views

Several universal approximation and universal representation results are known for non-Boolean multivalued logics such as fuzzy logics. In this paper, we show that similar results can be proven for multivalued Boolean logics as well.

Phylogenetic inference based on matrix r

Phylogenetic inference based on matrix representation of trees

✍ Mark A. Ragan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 778 KB

Rooted phylogenetic trees can be represented as matrices in which the rows correspond to termini, and columns correspond to internal nodes (elements of the n-tree). Parsimony analysis of such a matrix will fully recover the topology of the original tree. The maximum size of the represented matrix de