A301371 -id:A301371 - cp's OEIS frontend

A327281 Numbers less than the maximum possible determinant A301371(8)=27296640 not occurring as determinant of an 8 X 8 matrix whose entries are a permutation of the multiset {1^8,..,8^8}.

27003797, 27011623, 27012187, 27012757, 27012835

Offset: 1

Hugo Pfoertner, Sep 20 2019

The sequence terms are based on numerical results. No proof for the non-existence of a matrix with given determinant value less than Gasper's upper bound (see Corollary 3 in Sigg) is known. The number of sequence terms is <= 205426. Candidates for a continuation of the sequence are provided as external file.

			The following matrices have determinants in the vicinity of a(1) = A322576(8) = 27003797, for which no corresponding matrix is known:
27003795 = det[2,5,1,4,8,7,3,6; 3,2,4,8,5,5,8,2; 7,1,7,3,4,8,2,4; 8,7,1,4,2,5,6,3; 1,6,7,3,1,6,6,6; 4,8,7,5,6,3,2,1; 5,3,5,1,7,1,7,6; 5,4,4,8,3,2,2,8],
27003796 = det[1,5,6,3,7,4,8,2; 6,4,8,2,2,8,3,3; 4,1,2,3,6,7,5,8; 5,5,2,8,6,7,3,1; 8,6,2,3,2,3,8,4; 1,6,5,7,1,4,4,7; 5,8,4,2,7,3,1,6; 6,1,7,7,5,1,4,5],
27003798 = det[7,4,2,8,7,3,1,5; 3,6,6,1,8,2,4,6; 2,1,3,5,6,8,6,5; 6,5,7,3,3,8,1,3; 5,2,8,6,4,2,7,2; 8,3,3,2,2,4,6,8; 1,7,5,7,1,4,4,7; 5,8,1,4,4,5,7,1],
27003799 = det[2,8,6,4,7,1,5,4; 5,7,1,8,1,4,6,4; 5,3,7,3,3,6,8,1; 2,3,8,6,2,5,2,7; 3,4,2,1,5,7,6,8; 8,7,5,2,4,6,1,4; 3,3,3,7,8,7,2,2; 8,1,4,5,6,1,5,6].

Table of n, a(n) for n = 1..5
Hugo Pfoertner, Plot of sequence.
Hugo Pfoertner, Conjectured continuation of A327281, (2019).
Markus Sigg, Gasper's determinant theorem, revisited, arXiv:1804.02897 [math.CO], 2018.

Cf. A301371, A322576, A325900.

A085000 Maximal determinant of an n X n matrix using the integers 1 to n^2.

Original entry on oeis.org

1, 10, 412, 40800, 6839492, 1865999570, 762150368499

Offset: 1

Robert G. Wilson v, Jun 16 2003

Bounds for the next terms and the corresponding matrices are given by O. Gasper, H. Pfoertner and M. Sigg: 440960274696935 <= a(8) < 441077015225642, 346254605664223620 <= a(9) < 346335386150480625, 356944784622927045792 <= a(10) < 357017114947987625629. a(n) < sqrt(3*((n^5+n^4+n^3+n^2)/12)^n*(n^2+1)/(n+1)). - Hugo Pfoertner, Aug 15 2010
Improved lower bounds (private communication from Benjamin R. Buhrow, Dec 09 2019): a(8) >= 440970981670289, a(9) >= 346260899916111296. - Hugo Pfoertner, Jan 25 2021
Improved lower bound (private communication from Richard Gosiorovsky, Aug 18 2021): a(10) >= 356948996371054862392. - Hugo Pfoertner, Aug 24 2021

			The following 3 X 3 matrix is one of 36 whose determinant is 412 (there are also 36 whose determinant is -412):
   9 3 5
   4 8 1
   2 6 7
Results from a specially adapted hill-climbing algorithm strongly suggest that a(5) = 6839492. a(6) is at least 1862125166. Heuristically, a(n) is approximately 0.44*n^(2.06*n), suggesting that a(7) is close to 6.8*10^11. - Tim Paulden (timmy(AT)cantab.net), Sep 21 2003
a(5) confirmed by _Robert Israel_ and _Hugo Pfoertner_. A corresponding matrix is ((25 15 9 11 4) (7 24 14 3 17) (6 12 23 20 5) (10 13 2 22 19) (16 1 18 8 21) ). - _Hugo Pfoertner_, Sep 23 2003
a(6) found with FORTRAN program given at Pfoertner link. A corresponding matrix is ((36 24 21 17 5 8) ( 3 35 25 15 23 11) (13 7 34 16 10 31) (14 22 2 33 12 28) (20 4 19 29 32 6) (26 18 9 1 30 27) ). - _Hugo Pfoertner_, Sep 23 2003
a(7) is the determinant of the matrix ((46 42 15 2 27 24 18) (9 48 36 30 7 14 31) (39 11 44 34 13 29 5) (26 22 17 41 47 1 21) (20 8 40 6 33 23 45) (4 28 19 25 38 49 12) (32 16 3 37 10 35 43)). Although no proof for the optimality of a(7) is available, the results of an extensive computational search make the existence of a better solution extremely unlikely. A total of approximately 15 CPU years on SGI Origin 3000 and of 3.8 CPU years on SGI Altix 3000 computers was used for this result.

Sela Fried and Toufik Mansour, On the maximal sum of the entries of a matrix power, arXiv:2308.00348 [math.CO], 2023.
Ortwin Gasper, Hugo Pfoertner and Markus Sigg, An Upper Bound for the Determinant of a Matrix with given Entry Sum and Square Sum, JIPAM, Journal of Inequalities in Pure and Applied Mathematics, Volume 10, Issue 3, Article 63, 2008.
Hugo Pfoertner, Maximal determinant of matrix with elements 1..n. FORTRAN program.
Markus Sigg, Gasper's determinant theorem, revisited, arXiv:1804.02897 [math.CO], 2018.
Eric Weisstein's World of Mathematics, Square Matrix
Index entries for sequences related to maximal determinants

Cf. A088214, A088215, A088216, A088217, A088237, A180087 [upper bounds for a(n)], A180128, A221976, A301371, A301532, A301533, A309985, A325900, A350566.

Needs["DiscreteMath`Combinatorica`"]; n=3; n2=n^2; dMax=0; mMax={}; p=Range[n2]; Do[m=Partition[p, n]; d=Det[m]; If[d>dMax, dMax=d; mMax=m]; p=NextPermutation[p], {k, n2!}]; {dMax, mMax} (* T. D. Noe *)

vectomat(v)=my(n=sqrtint(#v));matrix(n,n,i,j,v[n*(i-1)+j])
a(n)=my(m,t,M); n*=n; for(k=0,(n-1)!-1, t=matdet(M=vectomat(numtoperm(n,k))); if(abs(t)>m, m=abs(t); print(t" "M)));m \\ Charles R Greathouse IV, Sep 13 2013

a(4) from Marsac Laurent (jko(AT)rox0r.net), Sep 15 2003
a(6) from Hugo Pfoertner, Sep 23 2003
Entry edited by N. J. A. Sloane, Nov 22 2006, to remove some erroneous entries. Further edits Nov 25 2006.
a(7) from Hugo Pfoertner, Jan 22 2008

A308853 a(n) is the minimum absolute value of nonzero determinants of order n Latin squares.

Original entry on oeis.org

1, 3, 18, 80, 75, 126, 196, 144, 405

Offset: 1

Alvaro R. Belmonte, Eugene Fiorini, Peterson Lenard, Froylan Maldonado, Sabrina Traver, Wing Hong Tony Wong, Jun 28 2019

We apply every symbol permutation on the representatives of isotopic classes to generate Latin squares of order n and calculate the determinants.

These results are based upon work supported by the National Science Foundation under the grants numbered DMS-1852378 and DMS-1560019.

			For n=2, the only Latin squares of order 2 are [[1, 2], [2, 1]] and [[2, 1], [1, 2]].  Therefore, the minimum absolute value of the determinants of order 2 Latin squares is 3.

Brendan McKay, Latin squares
Hugo Pfoertner, Occurrence counts of determinant values for n=1..8, zipped (2019).
Eric Weisstein's World of Mathematics, Latin square
Wikipedia, Latin square
Index entries for sequences related to determinants

Cf. A040082, A301371 (upper bound for maximum determinant of Latin squares of order n), A309258, A309984, A309985.

# Takes a string and turns it into a square matrix of order n
def make_matrix(string,n):
    m = []
    row = []
    for i in range(0,n * n):
        if string[i] == '\n':
            continue
        if string[i] == ' ':
            continue
        row.append(Integer(string[i]) + 1)
        if len(row) == n:
            m.append(row)
            row = []
    return matrix(m)
# Reads a file and returns a list of the matrices in the file
def fetch_matrices(file_name,n):
    matrices = []
    with open(file_name) as f:
        L = f.readlines()
    for i in L:
        matrices.append(make_matrix(i,n))
    return matrices
# Takes a matrix and permutates each symbol in the matrix
# with the given permutation
def permute_matrix(matrix, permutation,n):
    copy = deepcopy(matrix)
    for i in range(0, n):
        for j in range(0 , n):
            copy[i,j] = permutation[copy[i][j] - 1]
    return copy
"""
Creates a determinant list with the following triples,
[Isotopy Class Representative, Permutation, Determinant]
The Isotopy class representatives come from a file that
contains all Isotopy classes.
"""
def create_determinant_list(file_name,n):
    the_list = []
    permu = (Permutations(n)).list()
    matrices = fetch_matrices(file_name,n)
    for i in range(0,len(matrices)):
        for j in permu:
            copy = permute_matrix(matrices[i],j,n)
            the_list.append([i,j,copy.determinant()])
            print(len(the_list))
    return the_list
# Froylan Maldonado, Jun 28 2019

a(8) from Hugo Pfoertner, Aug 24 2019

a(9) from Hugo Pfoertner, Aug 27 2019

A309985 Maximum determinant of an n X n Latin square.

Original entry on oeis.org

1, 1, 3, 18, 160, 2325, 41895, 961772, 26978400, 929587995

Offset: 0

Hugo Pfoertner, Aug 26 2019

a(n) = A301371(n) for n <= 7. a(8) < A301371(8) = 27296640, a(9) < A301371(9) = 933251220.
a(10) = 36843728625, conjectured. See Stack Exchange link. - Hugo Pfoertner, Sep 29 2019
A328030(n) <= a(n) <= A301371(n). - Hugo Pfoertner, Dec 02 2019
It is unknown, but very likely, that A301371(n) > a(n) also holds for all n > 9 - Hugo Pfoertner, Dec 12 2020

			An example of an 8 X 8 Latin square with maximum determinant is
  [7  1  3  4  8  2  5  6]
  [1  7  4  3  6  5  2  8]
  [3  4  1  7  2  6  8  5]
  [4  3  7  1  5  8  6  2]
  [8  6  2  5  4  7  1  3]
  [2  5  6  8  7  3  4  1]
  [5  2  8  6  1  4  3  7]
  [6  8  5  2  3  1  7  4].
An example of a 9 X 9 Latin square with maximum determinant is
  [9  4  3  8  1  5  2  6  7]
  [3  9  8  5  4  6  1  7  2]
  [4  1  9  3  2  8  7  5  6]
  [1  2  4  9  7  3  6  8  5]
  [8  3  5  6  9  7  4  2  1]
  [2  7  1  4  6  9  5  3  8]
  [5  8  6  7  3  2  9  1  4]
  [7  6  2  1  5  4  8  9  3]
  [6  5  7  2  8  1  3  4  9].
An example of a 10 X 10 Latin square with abs(determinant) = 36843728625 is a circulant matrix with first row [1, 3, 7, 9, 8, 6, 5, 4, 2, 10], but it is not known if this is the best possible. - _Kebbaj Mohamed Reda_, Nov 27 2019 (reworded by _Hugo Pfoertner_)

Brendan McKay, Latin squares.
Mathematics Stack Exchange, Maximum determinant of Latin squares, (2014), (2016).

Cf. A040082, A301371, A308853, A309258, A309984, A328029, A328030.

a(9) from Hugo Pfoertner, Aug 30 2019

a(0)=1 prepended by Alois P. Heinz, Oct 02 2019

A309258 a(n) is the number of distinct absolute values of determinants of order n Latin squares.

Original entry on oeis.org

1, 1, 1, 3, 6, 197, 3684, 159561

Offset: 1

Alvaro R. Belmonte, Eugene Fiorini, Peterson Lenard, Froylan Maldonado, Sabrina Traver, Wing Hong Tony Wong, Jul 19 2019

We apply every symbol permutation on the representatives of isotopic classes to generate Latin squares of order n and calculated the determinants. We then obtained the absolute values of the determinants and removed duplicates.
These results are based on work supported by the National Science Foundation under grants numbered DMS-1852378 and DMS-1560019.
a(9) >= 1747706. - Hugo Pfoertner, Nov 20 2019

			For n = 5, the set of absolute values of determinants is {75, 825, 1200, 1575, 1875, 2325}, so a(5) = 6.

Froylan Maldonado, Code
Brendan McKay, Latin squares
Hugo Pfoertner, 8X8 Latin squares: Illustration of occurrence counts of determinant values, 5.7 MB, zoom in to see details (2019).
Hugo Pfoertner, Occurrence counts of determinant values for n=1..8, zipped (2019).

Cf. A040082, A088021, A301371, A308853, A309984, A309985.

Sage
```
# See Maldonado link.
```

a(8) from Hugo Pfoertner, Aug 26 2019

A309088 a(n) is the number of isotopy classes of order n Latin squares that produce a unique determinant.

Original entry on oeis.org

1, 1, 1, 1, 2, 8, 25

Offset: 1

Alvaro R. Belmonte, Eugene Fiorini, Peterson Lenard, Froylan Maldonado, Sabrina Traver, Wing Hong Tony Wong, Jul 11 2019

We apply every symbol permutation on the representatives of isotopic classes to generate Latin squares of order n and calculate the determinants.

These results are based upon work supported by the National Science Foundation under the grants numbered DMS-1852378 and DMS-1560019.

			For n=5, the only isotopic class that produces determinants 825, 1875, and 2325 is the one with [[1, 2, 3, 4, 5] [2, 3, 5, 1, 4], [3, 5, 4, 2, 1], [4, 1, 2, 5, 3], [5, 4, 1, 3, 2]] as a representative, and the only isotopic class that produces determinants 1200 and 1575 is the one with [[1, 2, 3, 4, 5], [2, 4, 1, 5, 3], [3, 5, 4, 2, 1], [4, 1, 5, 3, 2], [5, 3, 2, 1, 4]] as a representative.
Therefore, a(5)=2 since there are two isotopic classes that produce determinants that are unique to that isotopic class.

Froylan Maldonado, Sage code
Brendan McKay, Latin squares
Brendan McKay, Order 4 isotopic classes
Brendan McKay, Order 5 isotopic classes
Brendan McKay, Order 6 isotopic classes
Brendan McKay, Order 7 isotopic classes
Index entries for sequences related to determinants

Cf. A301371, A308853.

Sage
```
See Maldonado link.
```

A309344 a(n) is the number of distinct numbers of transversals of order n Latin squares.

Original entry on oeis.org

1, 1, 1, 2, 2, 4, 36, 74

Offset: 1

Alvaro R. Belmonte, Eugene Fiorini, Peterson Lenard, Froylan Maldonado, Sabrina Traver, Wing Hong Tony Wong, Jul 24 2019

We found all transversals in the main class Latin square representatives of order n.
These results are based upon work supported by the National Science Foundation under the grants numbered DMS-1852378 and DMS-1560019.
For all spectra of even orders all known values included in them are divisible by 2. For all spectra of orders n=4k+2 all known values included in the corresponding spectra are divisible by 4. - Eduard I. Vatutin, Mar 01 2025
a(9)>=407, a(10)>=463, a(11)>=6437, a(12)>=23715. - Eduard I. Vatutin, added Mar 01 2025, updated Aug 14 2025

			For n=7, the number of transversals that an order 7 Latin square may have is 3, 7, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 36, 37, 41, 43, 45, 47, 55, 63, or 133. Hence there are 36 distinct numbers of transversals of order 7 Latin squares, so a(7)=36.

Brendan McKay, Combinatorial Data.
Eduard I. Vatutin, Graphical representation of the spectra.
Eduard I. Vatutin, Proving lists (1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12).
E. I. Vatutin, N. N. Nikitina, M. O. Manzuk, I. I. Kurochkin, A. M. Albertyan, On the number of transversals in diagonal Latin squares of even orders (in Russian), Cloud and distributed computing systems, within the National supercomputing forum (NSCF - 2023). Pereslavl-Zalessky, 2023. pp. 101-105.
Index entries for sequences related to Latin squares and rectangles.

Cf. A003090, A090741 (maximum number), A091323 (minimum number), A301371, A308853, A309088, A344105 (version for diagonal Latin squares).

%This extracts entries from each column.  For an example, if
%A=[1 2 3 4; 5 6 7 8; 9 10 11 12; 13 14 15 16], and if list = (2, 1, 4),
%this code extracts the second element in the first column, the first
%element in the second column, and the fourth element in the third column.
function [output] = extract(matrix,list)
for i=1:length(list)
    output(i) = matrix(list(i),i);
end
end
%Searches matrix to find transversal and outputs the transversal.
function [output] = findtransversal(matrix)
n=length(matrix);
for i=1:n
    partialtransversal(i,1)=i;
end
for i=2:n
    newpartialtransversal=[];
    for j=1:length(partialtransversal)
        for k=1:n
            if (~ismember(k,partialtransversal(j,:)))&(~ismember(matrix(k,i),extract(matrix,partialtransversal(j,:))))
                newpartialtransversal=[newpartialtransversal;[partialtransversal(j,:),k]];
            end
        end
    end
    partialtransversal=newpartialtransversal;
end
output=partialtransversal;
end
%Takes input of n^2 numbers with no spaces between them and converts it
%into an n by n matrix.
function [A] = tomatrix(input)
n=sqrt(floor(log10(input))+2);
for i=1:n^2
    temp(i)=mod(floor(input/(10^(i-1))),10);
end
for i=1:n
    for j=1:n
        A(i,j)=temp(n^2+1-(n*(i-1)+j));
    end
end
A=A+ones(n);
end

A322576 Least nonnegative integer that cannot be expressed as the determinant of an n X n matrix whose entries are a permutation of the multiset {1^n, ..., n^n}.

Original entry on oeis.org

0, 1, 9, 139, 2111, 40021, 942937, 27003797

Offset: 1

Hugo Pfoertner, Aug 29 2019

			a(1) = 0 because det[1] = 1.
a(2) = 1 because det[1,1; 2,2] = 0 and det[2,1; 1,2] = 3 are the only determinant values >= 0 that can be made by permuting the matrix entries {1,1, 2,2}.
a(3) = 9, because it is the first missing value in the list of A309799(3) = 13 determinant values corresponding to {1,1,1, 2,2,2, 3,3,3}: 0, 1, 2, 3, 4, 5, 6, 7, 8, 12, 13, 15, 18.

Cf. A088216, A301371, A309258, A309799, A327281.

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

Hugo Pfoertner, Oct 02 2019

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.

			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.

Hugo Pfoertner, Table of n, a(n) for n = 1..120, rows 1..15 of triangle, flattened
Mathematics Stack Exchange, Maximum determinant of Latin squares, (2014), (2016).
Wikipedia, Circulant matrix.

Cf. A301371, A309985, A328030, A328031, A328062.

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 *)

A301532 Maximum determinant of an n X n matrix with entries 1, 1/2, .., 1/n^2; numerator.

Original entry on oeis.org

1, 5, 2027, 12976897, 450724396028209, 13238878814817907394909, 280849389948155488261365087763753, 132758211671968916518163154756197108235468015014261

Offset: 1

Hugo Pfoertner, Mar 23 2018

The maximum determinant achievable by arranging the fractions 1/1, 1/2, 1/3, ..., 1/n^2 as matrix entries is provided as fraction a(n) / A301533(n).

			a(3) = 2027, because no matrix with a greater determinant can be found than
  (1/1 1/7 1/5)
  (1/4 1/2 1/9)
  (1/8 1/6 1/3),
which has the determinant 2027/15120. A301533(3) = 15120.

Hugo Pfoertner, Illustration of maximum determinant value A301532/A301533.

Cf. A085000, A301371, A301533 (corresponding denominators)

cp's OEIS Frontend

A327281 Numbers less than the maximum possible determinant A301371(8)=27296640 not occurring as determinant of an 8 X 8 matrix whose entries are a permutation of the multiset {1^8,..,8^8}.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A085000 Maximal determinant of an n X n matrix using the integers 1 to n^2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A308853 a(n) is the minimum absolute value of nonzero determinants of order n Latin squares.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Sage

Extensions

A309985 Maximum determinant of an n X n Latin square.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A309258 a(n) is the number of distinct absolute values of determinants of order n Latin squares.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Sage

Extensions

A309088 a(n) is the number of isotopy classes of order n Latin squares that produce a unique determinant.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Sage

A309344 a(n) is the number of distinct numbers of transversals of order n Latin squares.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

MATLAB

A322576 Least nonnegative integer that cannot be expressed as the determinant of an n X n matrix whose entries are a permutation of the multiset {1^n, ..., n^n}.

Views

Author

Keywords

Examples

Crossrefs

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.

Views