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-7 of 7 results.

A007299 Number of Hadamard matrices of order 4n.

Original entry on oeis.org

1, 1, 1, 1, 5, 3, 60, 487, 13710027
Offset: 0

Views

Author

Keywords

Comments

More precisely, number of inequivalent Hadamard matrices of order n if two matrices are considered equivalent if one can be obtained from the other by permuting rows, permuting columns and multiplying rows or columns by -1.
The Hadamard conjecture is that a(n) > 0 for all n >= 0. - Charles R Greathouse IV, Oct 08 2012
From Bernard Schott, Apr 24 2022: (Start)
A brief historical overview based on the article "La conjecture de Hadamard" (see link):
1893 - J. Hadamard proposes his conjecture: a Hadamard matrix of order 4k exists for every positive integer k (see link).
As of 2000, there were five multiples of 4 less than or equal to 1000 for which no Hadamard matrix of that order was known: 428, 668, 716, 764 and 892.
2005 - Hadi Kharaghani and Behruz Tayfeh-Rezaie publish their construction of a Hadamard matrix of order 428 (see link).
2007 - D. Z. Djoković publishes "Hadamard matrices of order 764 exist" and constructs 2 such matrices (see link).
As of today, there remain 12 multiples of 4 less than or equal to 2000 for which no Hadamard matrix of that order is known: 668, 716, 892, 1132, 1244, 1388, 1436, 1676, 1772, 1916, 1948, and 1964. (End)
By private email, Felix A. Pahl informs that a Hadamard matrix of order 1004 was constructed in 2013 (see link Djoković, Golubitsky, Kotsireas); so 1004 is deleted from the last comment. - Bernard Schott, Jan 29 2023

References

  • J. Hadamard, Résolution d'une question relative aux déterminants, Bull. des Sciences Math. 2 (1893), 240-246.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
  • S. Wolfram, A New Kind of Science. Champaign, IL: Wolfram Media, p. 1073, 2002.

Crossrefs

Extensions

a(8) from the H. Kharaghani and B. Tayfeh-Rezaie paper. - N. J. A. Sloane, Feb 11 2012

A096204 Maximum permanent of a Hadamard matrix of order 4n.

Original entry on oeis.org

1, 8, 384, 46080, 50692096, 219414528, 4413544464384, 668622959673344
Offset: 0

Views

Author

Ian Wanless, Jul 29 2004

Keywords

Crossrefs

A096205 Minimum (absolute value of) permanent of a Hadamard matrix of order 4n.

Original entry on oeis.org

1, 8, 384, 46080, 360448, 219414528, 2755657728, 115595018240
Offset: 0

Views

Author

Ian Wanless, Jul 29 2004

Keywords

Crossrefs

A096206 Number of different values taken by the absolute value of the permanent of a Hadamard matrix of order 4n.

Original entry on oeis.org

1, 1, 1, 1, 4, 1, 27, 288
Offset: 0

Views

Author

Ian Wanless, Jul 29 2004

Keywords

Crossrefs

A353052 Number of inequivalent {-1,1} matrices of order n, up to permutation of rows and/or columns, multiplication of rows and/or columns by -1, and transposition.

Original entry on oeis.org

1, 2, 3, 10, 30, 242, 4386
Offset: 1

Views

Author

Nathaniel Johnston, Apr 20 2022

Keywords

Comments

The equivalence operations described in the title are commonly used when discussing Hadamard matrices, for example (see A096201). They are natural when considering norms of these matrices or properties that can be inferred from their singular values, since they do not change singular values. See A352099 for the version of this sequence that does not consider transposition as part of the equivalence relation.
Since the row and column multiplication operations can be used to force the first row and column to consist only of ones, 2^[(n-1)^2] is an upper bound on this sequence. A lower bound is 2^[n*(n-2)] / (n!)^2.

Examples

			When n = 3, there are 3 inequivalent matrices, so a(3) = 3:
  1 1 1       1  1  1       1  1  1
  1 1 1       1  1 -1       1 -1 -1
  1 1 1  and  1 -1 -1  and  1 -1 -1
All other 3-by-3 matrices with entries in {-1,1} can be converted into one of these three matrices by permutating rows and/or columns, multiplying some rows and/or columns by -1, and potentially transposing the matrix.
		

Crossrefs

Extensions

a(7) from Nathaniel Johnston, May 05 2022

A206704 Number of Hadamard matrices of order 4n that are equivalent to their transpose.

Original entry on oeis.org

1, 1, 1, 3, 3, 12, 101, 3993
Offset: 1

Views

Author

Brendan McKay, Feb 11 2012

Keywords

Comments

Number of equivalence classes under row/column permutation and negation that contain the transpose.

Crossrefs

Formula

a(n) = 2*A096201(n) - A007299(n).

A206705 Number of Hadamard matrices of order n that are equivalent to their transpose.

Original entry on oeis.org

1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 3, 0, 0, 0, 3, 0, 0, 0, 12, 0, 0, 0, 101, 0, 0, 0, 3993, 0, 0, 0
Offset: 1

Views

Author

Brendan McKay, Feb 11 2012

Keywords

Comments

Number of equivalence classes under row/column permutation and negation that contain the transpose.

Crossrefs

Showing 1-7 of 7 results.