cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A301371 Maximum determinant of an n X n matrix with n copies of the numbers 1 .. n.

Original entry on oeis.org

1, 1, 3, 18, 160, 2325, 41895, 961772, 27296640, 933251220
Offset: 0

Views

Author

Hugo Pfoertner, Mar 21 2018

Keywords

Comments

929587995 <= a(9) <= 934173632 (upper bound from Gasper's determinant theorem). The lower bound corresponds to a Latin square provided in A309985, but it is unknown whether a larger determinant value can be achieved by an unconstrained arrangement of the matrix entries. - Hugo Pfoertner, Aug 27 2019
Oleg Vlasii found a 9 X 9 matrix significantly exceeding the determinant value achievable by a Latin square. See example and links. - Hugo Pfoertner, Nov 04 2020

Examples

			Matrices with maximum determinants:
a(2) = 3:
  (2  1)
  (1  2)
a(3) = 18:
  (3  1  2)
  (2  3  1)
  (1  2  3)
a(4) = 160:
  (4  3  2  1)
  (1  4  3  2)
  (3  1  4  3)
  (2  2  1  4)
a(5) = 2325:
  (5  3  1  2  4)
  (2  5  4  1  3)
  (4  1  5  3  2)
  (3  4  2  5  1)
  (1  2  3  4  5)
a(6) = 41895:
  (6  1  4  2  3  5)
  (3  6  2  1  5  4)
  (4  5  6  3  2  1)
  (5  3  1  6  4  2)
  (1  2  5  4  6  3)
  (2  4  3  5  1  6)
a(7) = 961772:
  (7  2  3  5  1  4  6)
  (3  7  6  4  2  1  5)
  (2  1  7  6  4  5  3)
  (4  5  1  7  6  3  2)
  (6  3  5  1  7  2  4)
  (5  6  4  2  3  7  1)
  (1  4  2  3  5  6  7)
a(8) = 27296640:
  (8  8  3  5  4  3  4  1)
  (1  8  6  3  1  6  6  5)
  (5  3  8  1  7  6  4  2)
  (5  1  6  8  2  4  7  3)
  (1  5  2  7  8  6  4  3)
  (7  3  2  4  3  8  2  7)
  (5  4  2  2  6  2  8  7)
  (4  5  7  6  5  1  1  7)
a(n) is an upper bound for the determinant of an n X n Latin square. a(n) = A309985(n) for n <= 7. a(8) > A309985(8). - _Hugo Pfoertner_, Aug 26 2019
From _Hugo Pfoertner_, Nov 04 2020: (Start)
a(9) = 933251220, achieved by a Non-Latin square:
  (9  5  5  3  3  2  2  8  8)
  (4  9  2  6  7  5  3  1  8)
  (4  7  9  2  1  8  6  3  5)
  (6  3  7  9  4  1  8  2  5)
  (6  2  8  5  9  7  1  4  3)
  (7  4  1  8  2  9  5  6  3)
  (7  6  3  1  8  4  9  5  2)
  (1  8  6  7  5  3  4  9  2)
  (1  1  4  4  6  6  7  7  9)
found by Oleg Vlasii as an answer to the IBM Ponder This Challenge November 2019. See links. (End)
		

Crossrefs

Formula

A328030(n) <= a(n) <= A328031(n). - Hugo Pfoertner, Nov 04 2019

Extensions

a(8) from Hugo Pfoertner, Aug 26 2019
a(9) from Hugo Pfoertner, Nov 04 2020

A328030 Maximum determinant of a circulant n X n matrix whose rows are permutations of [1,2,..,n].

Original entry on oeis.org

1, 1, 3, 18, 160, 2325, 41895, 961772, 26978400, 929587995, 36843728625, 1705290814194, 89802671542272, 5336424046419557, 354379732734283200, 26173529641406219400
Offset: 0

Views

Author

Hugo Pfoertner, Oct 02 2019

Keywords

Comments

It is conjectured that A309985 is identical to this sequence. See Mathematics Stack Exchange link. The first rows of the corresponding circulant matrices are provided in A328029.

Crossrefs

Formula

a(n) = A309985(n) for n <= 9.
a(n) <= A328031(n).

Extensions

a(15) from Hugo Pfoertner, Oct 14 2019

A328029 Lexicographically earliest permutation of [1,2,...,n] maximizing the determinant of an n X n circulant matrix that uses this permutation as first row, written as triangle T(n,k), k <= n.

Original entry on oeis.org

1, 2, 1, 1, 2, 3, 2, 1, 4, 3, 1, 2, 4, 3, 5, 2, 1, 6, 3, 5, 4, 1, 2, 4, 6, 5, 3, 7, 2, 1, 5, 4, 8, 3, 6, 7, 1, 2, 4, 8, 6, 7, 5, 3, 9, 1, 2, 10, 7, 8, 3, 9, 5, 4, 6, 1, 2, 6, 11, 7, 9, 4, 8, 5, 3, 10, 2, 1, 7, 3, 12, 5, 9, 10, 4, 6, 11, 8, 1, 2, 12, 13, 5, 10, 6, 11, 3, 9, 8, 4, 7
Offset: 1

Views

Author

Hugo Pfoertner, Oct 02 2019

Keywords

Comments

For n <= 9 the corresponding circulant matrices are n X n Latin squares with maximum determinant A309985(n). It is conjectured that this also holds for n > 9. See Mathematics Stack Exchange link.

Examples

			The triangle starts
  1;
  2,  1;
  1,  2,  3;
  2,  1,  4,  3;
  1,  2,  4,  3,  5;
  2,  1,  6,  3,  5,  4;
  1,  2,  4,  6,  5,  3,  7;
  2,  1,  5,  4,  8,  3,  6,  7;
  1,  2,  4,  8,  6,  7,  5,  3,  9;
  1,  2, 10,  7,  8,  3,  9,  5,  4,  6;
.
The 4th row of the triangle T(4,1)..T(4,4) = a(7)..a(10) is [2,1,4,3] because this is the lexicographically earliest permutation of [1,2,3,4] producing a circulant 4 X 4 matrix with maximum determinant A328030(4) = 160.
  [2, 1, 4, 3;
   3, 2, 1, 4;
   4, 3, 2, 1;
   1, 4, 3, 2].
All lexicographically earlier permutations lead to smaller determinants, with [1,2,3,4] and [1,4,3,2] producing determinants = -160.
		

Crossrefs

Programs

  • Mathematica
    f[n_] := (p = Permutations[Table[i, {i, n}]]; L = Length[p]; det = Max[Table[Det[Reverse /@ Partition[p[[i]], n, 1, {1, 1}]], {i, 1, L}]]; mat = Table[Reverse /@ Partition[p[[i]], n, 1, {1, 1}], {i, 1, L}]);
    n = 1; While[n <= 10, ClearSystemCache[[]]; f[n]; triangle = Parallelize[Select[mat, Max[Det[#]] == det &]]; Print[SortBy[triangle, Less][[1]][[1]]]; n++]; (* Kebbaj Mohamed Reda, Dec 03 2019; edited by Michel Marcus, Dec 24 2023 *)
Showing 1-3 of 3 results.