## 189 Reputation

18 years, 261 days

## Needing more help...

Dear Israel,
Thank you very much indeed. I tried hard to proceed according to your guidelines but I could not. Kindly help as to a dummy. Null set may also appear in the entries being a subset of the basic set from which matrix is being induced.

## Needing more help...

Dear Israel,
Thank you very much indeed. I tried hard to proceed according to your guidelines but I could not. Kindly help as to a dummy. Null set may also appear in the entries being a subset of the basic set from which matrix is being induced.

## What to program....

I want to program a procedure whixh can produce a random partition matrix for a given set A. Many Thanks.

## needed complete help...

Dear Israel,
Thanks for your kind help. You are right, I am looking for all such maps from subsets of B to power set of A. Your reply is still beyond my skill with Maple. Kindly complete the help.

>It would be better if you specified precisely what you meant, rather than having us  >guess.  My guess is that you're looking for all maps from subsets of B to the power  >set of A.  Suppose A has m elements and B has n.  The number of maps from a  >given k-element set to the power set of A (which has 2^m elements) is (2^m)^k = 2^ >(m*k).  The number of k-element subsets of B is binomial(n,k).
> So...

## Complete help required...

Dear Israel,
Thanks for your kind help. You are right, I am looking for all such maps from subsets of B to power set of A. Your reply is still beyond my skill with Maple. Kindly complete the help.

## My Maple does not have GraphTheory...

Dear thanks for reply. But I am using Maple9 and it says that GraphTheory is not a package. Instead it has one "networks" but it does not work as your reply sugests. Kindly help.

## Eigenvalues of Boolean Matrices...

Not only this, we are to find both left and right eigenvalues of a boolean matrix i.e. solving the equations: vM = v Mv = v where v is a vector and M the boolean matrix. In fact such values provide info about the graph-generated topology.

## Boolean matrices again...

The boolean matrices I referred in last message are basically adjacency matrices of graphs. I think the suggestion of Israel, of computing eigen values as ordinary matrices is not right; it gives answers in non-boolean entries. Any other suggestion please.
 Page 1 of 1
﻿