Question: Unusual Matrices Programming

I am in a class of combinatorics following two definitions are to be coded in Maple. I have done my best but could not. Kindly help.

Def 1:    Let M=[mij] be a matrix of type m×n, whose entries are subsets of a set A.
Def 2:    A set matrix M is said to be a partition matrix of set A if:

    1. mir∩mis=φ, for every i,r,s, such that r≠s;
    2. mrj∩msj=φ, for every j,r,s, such that r≠s;
    3.⋃r=1mir=A=⋃s=1mmsj, for every i and j.

Thanking in anticipation.


Please Wait...