[119258] in Cypherpunks
Re: logarithms of nonsingular binary matrices (fwd)
daemon@ATHENA.MIT.EDU (Jonathan Stafford)
Wed Oct 20 14:17:13 1999
Date: Wed, 20 Oct 1999 13:53:54 -0400 (EDT)
From: Jonathan Stafford <jestaff2@unity.ncsu.edu>
To: cypherpunks@einstein.ssz.com
cc: billp@nmol.com
In-Reply-To: <199910201220.HAA14578@einstein.ssz.com>
Message-ID: <Pine.SOL.4.05.9910201352280.18703-100000@eos00du.eos.ncsu.edu>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Reply-To: Jonathan Stafford <jestaff2@unity.ncsu.edu>
oh god, here we go again.
don't worry Jim, i'll join in with my ideas on logs of binary matrices
soon enough...
Jonathan
On Wed, 20 Oct 1999, Jim Choate wrote:
> Hi Bill,
>
> ----- Forwarded message from bill payne -----
>
> Date: Tue, 19 Oct 1999 20:51:51 -0600
> >From: bill payne <billp@nmol.com>
> Subject: CDR: logarithms of nonsingular binary matrices
>
> Roots of nonsingular binary matrices can be computed.
>
> 011 011 010
> 111 111 = 001
> 101 101 110
>
> ----- End of forwarded message from bill payne -----
>
> Let's take element 1,1 of your resultant matrix. It is the 'sum of products'
> of the first row of the first matrix and the first colum of the second
> matrix. Since we're doing binary matrices we replace multiplication with AND
> and addition with OR. This gives,
>
> (0*0)+(1*1)+(1*1)=1
>
> Not 0 as you have stated.
