John Randall schreef:
> Aai wrote:
>
>> The second idea is based on analyzing the pattern of the conn. matrix.
>> Starting with dimension 3, the c.m. can be constructed with the two sub
>> matrices M and I:
>>
>> 0 1 0 1 1 0 0 0
>> 1 0 1 0 0 1 0 0
>> 0 1 0 1 0 0 1 0
>> M= 1 0 1 0 0 0 0 1
>> 1 0 0 0 0 1 0 1
>> 0 1 0 0 1 0 1 0
>> 0 0 1 0 0 1 0 1
>> 0 0 0 1 1 0 1 0
>>
>
> Is this the connection matrix on the edge graph?
I work with vertices. And I see now that my idea of a hypercube is
wrong. The number of vertices for a hypercube with dimension D is:
2^D
and not as I wrongly used (for 3 <= D)
8*(D-2)
So forget about my conn. matrix constructions (they only work for dim 3
and 4). Using your idea (and my adjusted view on hypercubes) gives:
fcm=:1=+/@: | @: -
lohc2=: 3 : 0
np=.2^y
(0(np-1)}np$y) %. (y*=i.np) + 0(np-1)} _1*fcm"1/~ #: i.np
)
x:@{...@lohc2"0 [ 1+i.7
1 4 10 64r3 128r3 416r5 2416r15
Am I right with this?
Thanks,
=@@i
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
