Covering in the set of principal ideals in the semigroup of binary relations (Q1322587): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A maximal chain of principal ideals in the semigroup of binary relations on a finite set / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Principal ideals in the semigroup of binary relations on a finite set: What happens when one element is added to the set / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3958592 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On cardinalities of row spaces of Boolean matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ordering \(D\)-classes and computing Schein rank is hard / rank | |||
Normal rank |
Latest revision as of 15:38, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Covering in the set of principal ideals in the semigroup of binary relations |
scientific article |
Statements
Covering in the set of principal ideals in the semigroup of binary relations (English)
0 references
1 December 1994
0 references
This paper deals with coverings in the poset of \(D\)-classes of the semigroup \(B_ n\) of \(n\times n\) Boolean matrices. A cover of the class of a matrix \(B\) by a matrix \(A\) is said to be permanent if we still have a covering after adjoining any number of zero rows and columns to \(A\), \(B\), in the final places. The author previously showed a cover is permanent if and only if \(r(A) = r(B) + 1\). Here he shows that if \(A\) covers \(B\) and \(B\) comes from \(B_ k\), \(k\) less than the size of \(B\) by adjoining zero rows and columns, that \(A\) permanently covers \(B\), and derives inequalities on row and column rank. Base is the transpose of the relation cover, and the author characterizes permanence of bases and gives a sharp inequality on the size of permanent bases.
0 references
semigroup of Boolean matrices
0 references
permanent cover
0 references
\(D\)-classes
0 references
row and column rank
0 references
relation cover
0 references
permanent bases
0 references
0 references