Minimum matrix representation of closure operations

J. Demetrovics, Z. Füredi, G. O H Katona

Research output: Contribution to journalArticle

54 Citations (Scopus)

Abstract

Let a be a column of the m × n matrix M and A a set of its columns. We say that A implies a iff M contains no two rows equal in A but different in a. It is easy to see that if ℳM(A) denotes the columns implied by A, than ℳM(A) is a closure operation. We say that M represents this closure operation. s() is the minimum number of the rows of the matrices representing a given closure operation. s(ℳ) is determined for some particular closure operations.

Original languageEnglish
Pages (from-to)115-128
Number of pages14
JournalDiscrete Applied Mathematics
Volume11
Issue number2
DOIs
Publication statusPublished - 1985

Fingerprint

Matrix Representation
Closure
M-matrix
Denote
Imply

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Applied Mathematics
  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Minimum matrix representation of closure operations. / Demetrovics, J.; Füredi, Z.; Katona, G. O H.

In: Discrete Applied Mathematics, Vol. 11, No. 2, 1985, p. 115-128.

Research output: Contribution to journalArticle

Demetrovics, J. ; Füredi, Z. ; Katona, G. O H. / Minimum matrix representation of closure operations. In: Discrete Applied Mathematics. 1985 ; Vol. 11, No. 2. pp. 115-128.
@article{0122bbcbc3f84652a996ec2b557ab65a,
title = "Minimum matrix representation of closure operations",
abstract = "Let a be a column of the m × n matrix M and A a set of its columns. We say that A implies a iff M contains no two rows equal in A but different in a. It is easy to see that if ℳM(A) denotes the columns implied by A, than ℳM(A) is a closure operation. We say that M represents this closure operation. s() is the minimum number of the rows of the matrices representing a given closure operation. s(ℳ) is determined for some particular closure operations.",
author = "J. Demetrovics and Z. F{\"u}redi and Katona, {G. O H}",
year = "1985",
doi = "10.1016/S0166-218X(85)80003-2",
language = "English",
volume = "11",
pages = "115--128",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Minimum matrix representation of closure operations

AU - Demetrovics, J.

AU - Füredi, Z.

AU - Katona, G. O H

PY - 1985

Y1 - 1985

N2 - Let a be a column of the m × n matrix M and A a set of its columns. We say that A implies a iff M contains no two rows equal in A but different in a. It is easy to see that if ℳM(A) denotes the columns implied by A, than ℳM(A) is a closure operation. We say that M represents this closure operation. s() is the minimum number of the rows of the matrices representing a given closure operation. s(ℳ) is determined for some particular closure operations.

AB - Let a be a column of the m × n matrix M and A a set of its columns. We say that A implies a iff M contains no two rows equal in A but different in a. It is easy to see that if ℳM(A) denotes the columns implied by A, than ℳM(A) is a closure operation. We say that M represents this closure operation. s() is the minimum number of the rows of the matrices representing a given closure operation. s(ℳ) is determined for some particular closure operations.

UR - http://www.scopus.com/inward/record.url?scp=0022076473&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022076473&partnerID=8YFLogxK

U2 - 10.1016/S0166-218X(85)80003-2

DO - 10.1016/S0166-218X(85)80003-2

M3 - Article

AN - SCOPUS:0022076473

VL - 11

SP - 115

EP - 128

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 2

ER -