login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A158800 A characteristic polynomial triangle of a Hadamard matrix self-similar lower triangular system: H(2^(n-1)) -> H(2^n). 3

%I #15 Jan 30 2023 07:40:53

%S 1,-1,0,1,1,0,-2,0,1,1,0,-4,0,6,0,-4,0,1,1,0,-8,0,28,0,-56,0,70,0,-56,

%T 0,28,0,-8,0,1,1,0,-16,0,120,0,-560,0,1820,0,-4368,0,8008,0,-11440,0,

%U 12870,0,-11440,0,8008,0,-4368,0,1820,0,-560,0,120,0,-16,0,1,1,0,-32,0,1

%N A characteristic polynomial triangle of a Hadamard matrix self-similar lower triangular system: H(2^(n-1)) -> H(2^n).

%C Row sums are zero except for n=0.

%C Example matrix:

%C H(8)={{1, 0, 0, 0, 0, 0, 0, 0},

%C {1, -1, 0, 0, 0, 0, 0, 0},

%C {1, 0, -1, 0, 0, 0, 0, 0},

%C {1, -1, -1, 1, 0, 0, 0, 0},

%C {1, 0, 0, 0, -1, 0, 0, 0},

%C {1, -1, 0, 0, -1, 1, 0, 0},

%C {1, 0, -1, 0, -1, 0, 1, 0},

%C {1, -1, -1, 1, -1, 1, 1, -1}}

%C H[2^n] * H[2^n] = IdentityMatrix[2^n]

%F Pattern Matrix:

%F H(2) = {{1, 0},

%F {1, -1}}

%F Iteration Matrix:

%F m = {{1, 0},

%F {1, -1}}

%F Matrix_Self_similar_Operator[H[2^(n-1)] = H(2^n).

%e {1},

%e {-1, 0, 1},

%e {1, 0, -2, 0, 1},

%e {1, 0, -4, 0, 6, 0, -4, 0, 1},

%e {1, 0, -8, 0, 28, 0, -56, 0, 70, 0, -56, 0, 28, 0, -8, 0, 1},

%e {1, 0, -16, 0, 120, 0, -560, 0, 1820, 0, -4368, 0, 8008, 0, -11440, 0, 12870, 0, -11440, 0, 8008, 0, -4368, 0, 1820, 0, -560, 0, 120, 0, -16, 0, 1},

%e {1, 0, -32, 0, 496, 0, -4960, 0, 35960, 0, -201376, 0, 906192, 0, -3365856, 0, 10518300, 0, -28048800, 0, 64512240, 0, -129024480, 0, 225792840, 0, -347373600, 0, 471435600, 0, -565722720, 0, 601080390, 0, -565722720, 0, 471435600, 0, -347373600, 0, 225792840, 0, -129024480, 0, 64512240, 0, -28048800, 0, 10518300, 0, -3365856, 0, 906192, 0, -201376, 0, 35960, 0, -4960, 0, 496, 0, -32, 0, 1}

%t Clear[HadamardMatrix];

%t MatrixJoinH[A_, B_] := Transpose[Join[Transpose[A], Transpose[B]]];

%t KroneckerProduct[M_, N_] := Module[{M1, N1, LM, LN, N2},

%t M1 = M;

%t N1 = N;

%t LM = Length[M1];

%t LN = Length[N1];

%t Do[M1[[i, j]] = M1[[i, j]]N1, {i, 1, LM}, {j, 1, LM}];

%t Do[M1[[i, 1]] = MatrixJoinH[M1[[i, 1]], M1[[i, j]]], {j, 2, LM}, {i, 1, LM}];

%t N2 = {};

%t Do[AppendTo[N2, M1[[i, 1]]], {i, 1, LM}];

%t N2 = Flatten[N2];

%t Partition[N2, LM*LN, LM*LN]]

%t HadamardMatrix[2] := {{1, 0}, {1, -1}};

%t HadamardMatrix[n_] := Module[{m}, m = {{1, 0}, {1, -1}}; KroneckerProduct[m, HadamardMatrix[n/2]]];

%t Table[HadamardMatrix[2^n], {n, 1, 4}];

%t Join[{{1}}, Table[CoefficientList[CharacteristicPolynomial[ HadamardMatrix[2^n], x], x], {n, 1, 6}]];

%t Flatten[%]

%K sign,tabf,uned

%O 0,7

%A _Roger L. Bagula_ and _Gary W. Adamson_, Mar 27 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)