On cardinalities of row spaces of Boolean matrices (Q1186848): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / reviewed by
 
Property / reviewed by: Kim Hang Kim / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Kim Hang Kim / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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: Q4126563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3958592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Topologies on A Finite Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the semigroup of binary relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cardinality of finite topologies / rank
 
Normal rank

Latest revision as of 16:13, 15 May 2024

scientific article
Language Label Description Also known as
English
On cardinalities of row spaces of Boolean matrices
scientific article

    Statements

    On cardinalities of row spaces of Boolean matrices (English)
    0 references
    0 references
    28 June 1992
    0 references
    The author shows that if the row space of an \(n\times n\) matrix exceeds in cardinality \(2^{n-1}\) then it is \(2^{n-1}\) plus a power of 2 which is not greater. He applies this to finite topologies and the height of the poset of \(\mathcal D\) classes in the semigroup of \(n\times n\) Boolean matrices.
    0 references
    semigroup of Boolean matrices
    0 references
    row space
    0 references
    finite topologies
    0 references
    height of the poset of \(\mathcal D\) classes
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references