login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A034917
Minimal determinant (negated) of n X n persymmetric matrix with entries {-1,0,+1}.
4
1, 2, 4, 16, 48, 160, 576, 2304, 12288, 73728, 327680, 2097152
OFFSET
1,2
COMMENTS
A persymmetric (or Hankel) matrix has M[ i,j ] = M[ i-k,j+k ] for all i and j (matrix is constant along antidiagonals).
Conjectures: These minimal determinant matrices have no zero entries; a(10) is 73728, a(11) = 327680 and a(12) = 2097152. - Jean-François Alcover, Dec 15 2017
EXAMPLE
For n = 1, 2, 3 use the matrices:
[ -1] [ -1 +1] [ +1 -1 +1]
..... [ +1 +1] [ -1 +1 +1]
.............. [ +1 +1 +1]
MATHEMATICA
base = 3; (* base 3 is for matrix entries {-1, 0, 1}, base 2 is for {-1, 1} *)
decode = Which[base == 2, 0 -> -1, base == 3, {0 -> -1, 1 -> 0, 2 -> 1}];
M[n_, k_] := Module[{row0, row}, row0 = PadLeft[IntegerDigits[k , base], 2 n-1] /. decode; row[i_] := RotateLeft[row0, i][[1 ;; n]]; Array[row, n]];
a[n_] := Module[{m0, d0, m, d, kmax}, {m0, d0} = {{}, Infinity}; kmax = base^(2 n - 1); Print["n = ", n, " kmax = ", kmax]; Do[m = M[n, k]; d = Det[m]; If[d < d0, Print[" k = ", k, " det = ", d]; {m0, d0} = {m, d}], {k, 0, kmax}]; Print["m0 = ", m0 // MatrixForm, " a(", n, ") = ", d0]; d0];
Array[a, 9] (* Jean-François Alcover, Dec 16 2017 *)
CROSSREFS
KEYWORD
nonn,nice,more
AUTHOR
Fred Lunnon, Dec 11 1999
EXTENSIONS
More terms from Sam Handler (sam_5_5_5_0(AT)yahoo.com), Aug 08 2006
Previously conjectured a(10)-a(12) confirmed by Bert Dobbelaere, Jan 26 2019
STATUS
approved