Mathematica 9 is now available
Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2006
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2006

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Hadamard -Sylvester Matrix Self-Similarity by substitution and reparatitioning

  • To: mathgroup at smc.vnet.net
  • Subject: [mg69060] Re: Hadamard -Sylvester Matrix Self-Similarity by substitution and reparatitioning
  • From: Roger Bagula <rlbagula at sbcglobal.net>
  • Date: Tue, 29 Aug 2006 03:25:45 -0400 (EDT)
  • References: <ebpkp7$p0l$1@smc.vnet.net>
  • Sender: owner-wri-mathgroup at wolfram.com

Here is a Gray code fractal using Hadamard Sylvester self-similar matrices:

c[i_, k_] := Floor[Mod[i/2^k, 2]]
b[i_, k_] := If[c[i, k] == 0 && c[
i, k + 1] == 0, 0, If[c[i, k] == 1 && c[i, k + 1] == 1, 0, 1]]
n = 64 - 1;
a0 = Table[If[Sum[b[i, k]*b[j,
    k], {k, 0, n}] == 0, 1, 0], {j, 0, n}, {i, 0, n}];
ListDensityPlot[a0, Mesh -> False]

>  
>


  • Prev by Date: CatchMachineUnderflow
  • Next by Date: generalized foldlist problem
  • Previous by thread: Re: Hadamard -Sylvester Matrix Self-Similarity by substitution and reparatitioning
  • Next by thread: position lists