This HTML5 document contains 68 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n5https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:1000_(number)
dbo:wikiPageWikiLink
dbr:Hadamard's_maximal_determinant_problem
Subject Item
dbr:144_(number)
dbo:wikiPageWikiLink
dbr:Hadamard's_maximal_determinant_problem
Subject Item
dbr:1458_(number)
dbo:wikiPageWikiLink
dbr:Hadamard's_maximal_determinant_problem
Subject Item
dbr:Optimal_design
dbo:wikiPageWikiLink
dbr:Hadamard's_maximal_determinant_problem
Subject Item
dbr:56_(number)
dbo:wikiPageWikiLink
dbr:Hadamard's_maximal_determinant_problem
Subject Item
dbr:Hadamard's_maximal_determinant_problem
rdf:type
yago:Matrix108267640 yago:Difficulty114408086 yago:Condition113920835 yago:Abstraction100002137 yago:WikicatUnsolvedProblemsInMathematics yago:Attribute100024264 yago:Group100031264 yago:Arrangement107938773 yago:Array107939382 yago:Problem114410605 yago:WikicatMatrices yago:State100024720
rdfs:label
Hadamard's maximal determinant problem
rdfs:comment
Hadamard's maximal determinant problem, named after Jacques Hadamard, asks for the largest determinant of a matrix with elements equal to 1 or −1. The analogous question for matrices with elements equal to 0 or 1 is equivalent since, as will be shown below, the maximal determinant of a {1,−1} matrix of size n is 2n−1 times the maximal determinant of a {0,1} matrix of size n−1. The problem was posed by Hadamard in the 1893 paper in which he presented his famous determinant bound and remains unsolved for matrices of general size. Hadamard's bound implies that {1, −1}-matrices of size n have determinant at most nn/2. Hadamard observed that a construction of Sylvesterproduces examples of matrices that attain the bound when n is a power of 2, and produced examples of his own of sizes 12 and 20.
dcterms:subject
dbc:Matrices dbc:Combinatorial_design dbc:Unsolved_problems_in_mathematics
dbo:wikiPageID
30556829
dbo:wikiPageRevisionID
1034258364
dbo:wikiPageWikiLink
dbr:Matrix_(mathematics) dbr:Transpose dbr:Statistics dbr:Orthogonal dbr:Jacques_Hadamard dbr:Hadamard_matrices dbr:Projective_plane dbc:Matrices dbr:Square_matrix dbr:Identity_matrix dbr:Symmetric_matrix dbr:Odd_number dbr:Determinant dbr:Cofactor_expansion dbr:Information_matrix dbr:Hasse–Minkowski_theorem dbr:Design_of_experiments dbc:Combinatorial_design dbc:Unsolved_problems_in_mathematics dbr:James_Joseph_Sylvester dbr:Gram_matrix dbr:Block-diagonal_matrix dbr:Optimal_design dbr:Hadamard's_inequality dbr:Normal_matrix dbr:Positive-definite_matrix
owl:sameAs
n5:4khiQ wikidata:Q5637579 yago-res:Hadamard's_maximal_determinant_problem freebase:m.0g9wdns
dbp:wikiPageUsesTemplate
dbt:Reflist
dbo:abstract
Hadamard's maximal determinant problem, named after Jacques Hadamard, asks for the largest determinant of a matrix with elements equal to 1 or −1. The analogous question for matrices with elements equal to 0 or 1 is equivalent since, as will be shown below, the maximal determinant of a {1,−1} matrix of size n is 2n−1 times the maximal determinant of a {0,1} matrix of size n−1. The problem was posed by Hadamard in the 1893 paper in which he presented his famous determinant bound and remains unsolved for matrices of general size. Hadamard's bound implies that {1, −1}-matrices of size n have determinant at most nn/2. Hadamard observed that a construction of Sylvesterproduces examples of matrices that attain the bound when n is a power of 2, and produced examples of his own of sizes 12 and 20. He also showed that the bound is only attainable when n is equal to 1, 2, or a multiple of 4. Additional examples were later constructed by Scarpis and Paley and subsequently by many other authors. Such matrices are now known as Hadamard matrices. They have received intensive study. Matrix sizes n for which n ≡ 1, 2, or 3 (mod 4) have received less attention. The earliest results are due to Barba, who tightened Hadamard's bound for n odd, and Williamson, who found the largest determinants for n=3, 5, 6, and 7. Some important results include * tighter bounds, due to Barba, Ehlich, and Wojtas, for n ≡ 1, 2, or 3 (mod 4), which, however, are known not to be always attainable, * a few infinite sequences of matrices attaining the bounds for n ≡ 1 or 2 (mod 4), * a number of matrices attaining the bounds for specific n ≡ 1 or 2 (mod 4), * a number of matrices not attaining the bounds for specific n ≡ 1 or 3 (mod 4), but that have been proved by exhaustive computation to have maximal determinant. The design of experiments in statistics makes use of {1, −1} matrices X (not necessarily square) for which the information matrix XTX has maximal determinant. (The notation XT denotes the transpose of X.) Such matrices are known as D-optimal designs. If X is a square matrix, it is known as a saturated D-optimal design.
prov:wasDerivedFrom
wikipedia-en:Hadamard's_maximal_determinant_problem?oldid=1034258364&ns=0
dbo:wikiPageLength
17328
foaf:isPrimaryTopicOf
wikipedia-en:Hadamard's_maximal_determinant_problem
Subject Item
dbr:Hadamard_matrix
dbo:wikiPageWikiLink
dbr:Hadamard's_maximal_determinant_problem
Subject Item
dbr:300_(number)
dbo:wikiPageWikiLink
dbr:Hadamard's_maximal_determinant_problem
Subject Item
dbr:List_of_things_named_after_Jacques_Hadamard
dbo:wikiPageWikiLink
dbr:Hadamard's_maximal_determinant_problem
Subject Item
dbr:List_of_unsolved_problems_in_mathematics
dbo:wikiPageWikiLink
dbr:Hadamard's_maximal_determinant_problem
Subject Item
dbr:Hadamard's_determinant_problem
dbo:wikiPageWikiLink
dbr:Hadamard's_maximal_determinant_problem
dbo:wikiPageRedirects
dbr:Hadamard's_maximal_determinant_problem
Subject Item
dbr:Hadamard's_maximum_determinant_problem
dbo:wikiPageWikiLink
dbr:Hadamard's_maximal_determinant_problem
dbo:wikiPageRedirects
dbr:Hadamard's_maximal_determinant_problem
Subject Item
wikipedia-en:Hadamard's_maximal_determinant_problem
foaf:primaryTopic
dbr:Hadamard's_maximal_determinant_problem