How Tight is Hadamard's Bound?
Abbott, John ; Mulders, Thom
Experiment. Math., Tome 10 (2001) no. 3, p. 331-336 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
For a real square matrix $M$, Hadamard's inequality gives an upper bound $H$ for the determinant of $M$; the bound is sharp if and only if the rows of $M$ are orthogonal. We study how much we can expect that $H$ overshoots the determinant of $M$, when the rows of $M$ are chosen randomly on the surface of the sphere. This gives an indication of the "wasted effort'' in some modular algorithms.
Publié le : 2001-05-14
Classification:  15A15 
@article{1069786341,
     author = {Abbott, John and Mulders, Thom},
     title = {How Tight is Hadamard's Bound?},
     journal = {Experiment. Math.},
     volume = {10},
     number = {3},
     year = {2001},
     pages = { 331-336},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1069786341}
}

Abbott, John; Mulders, Thom. How Tight is Hadamard's Bound?. Experiment. Math., Tome 10 (2001) no. 3, pp.  331-336. http://gdmltest.u-ga.fr/item/1069786341/