Group relationships and homomorphisms of Boolean matrix semigroups (Q1061234)

From MaRDI portal
Revision as of 09:28, 12 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Group relationships and homomorphisms of Boolean matrix semigroups
scientific article

    Statements

    Group relationships and homomorphisms of Boolean matrix semigroups (English)
    0 references
    0 references
    0 references
    1984
    0 references
    Let A be a Boolean n-square matrix. Taking a partition of the set \(\{\) 1,...,n\(\}\) and dividing the matrix into blocks leads to the so called image matrix by replacing each zero block by a single zero and each nonzero block by a single one. Taking the image matrix is always a homomorphism under Boolean addition. The question is when it is a multiplicative homomorphism. Some sufficient condition for this is given. This condition leads to the consideration of nonzero antichains of Boolean vectors. It is obtained as corollary that the maximal nonzero n- square Boolean matrix semigroups are precisely the following: \(S_ C=\{n\)-square Boolean matrix A: (\(\forall v\in C)\) (\(\exists w\in C)\) vA\(\geq w\}\), where C is a nonzero antichain of n-vectors. The maximal invariant under conjugations by a permutation matrix nonzero semigroups of Boolean matrices have the form: \(G_ i=\{A:\) the sum of any i rows (or all rows if \(i\geq n)\) of A has at least i ones (or all ones)\(\}\). The authors believe that their results cover all known conditions for the image to be a homomorphism. All the subject appears by analyzing small group structures in Sociology.
    0 references
    Boolean n-square matrix
    0 references
    image matrix
    0 references
    homomorphism
    0 references
    Boolean addition
    0 references
    antichains of Boolean vectors
    0 references
    Boolean matrix semigroups
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references