A maximal chain of principal ideals in the semigroup of binary relations on a finite set (Q803288): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
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 semigroup of binary relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661888 / rank
 
Normal rank

Latest revision as of 16:02, 21 June 2024

scientific article
Language Label Description Also known as
English
A maximal chain of principal ideals in the semigroup of binary relations on a finite set
scientific article

    Statements

    A maximal chain of principal ideals in the semigroup of binary relations on a finite set (English)
    0 references
    0 references
    1991
    0 references
    Let \(B_ n\) denote the semigroup of all binary relations on a set of n elements and let \(F_ n\) denote the nth Fibonacci number. The author constructs a maximal chain of \(F_{n+3}-1\) principal ideals in \(B_ n\). He notes that for \(n\geq 4\), this is the longest chain possible and poses the problem of determining whether this is true for all n. Some other related problems are posed as well.
    0 references
    semigroups of binary relations
    0 references
    maximal chains of principal ideals
    0 references
    Boolean matrices
    0 references
    Fibonacci number
    0 references
    0 references
    0 references
    0 references

    Identifiers