An upper bound for the determinant of a matrix with given entry sum and square sum.
Ortwin Gasper, Hugo Pfoertner, Markus Sigg
Abstract
Ortwin Gasper, Hugo Pfoertner, Markus Sigg
Abstract
ABSTRACT. By deducing characterisations of the matrices which have maximal determinant in the set of matrices with given entry sum and square sum, we prove the inequality | det M | ≤ |α|(β − δ) (n−1)/2 for real n × n-matrices M, where nα and nβ are the sum of the entries and the sum of the squared entries of M, respectively, and δ: = (α 2 − β)/(n − 1), provided that α 2 ≥ β. This result is applied to find an upper bound for the determinant of a matrix whose entries are a permutation of an arithmetic progression.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
ABSTRACT. By deducing characterisations of the matrices which have maximal determinant in the set of matrices with given entry sum and square sum, we prove the inequality | det M | ≤ |α|(β − δ) (n−1)/2 for real n × n-matrices M, where nα and nβ are the sum of the entries and the sum of the squared entries of M, respectively, and δ: = (α 2 − β)/(n − 1), provided that α 2 ≥ β. This result is applied to find an upper bound for the determinant of a matrix whose entries are a permutation of an arithmetic progression.
Key concepts: Mathematics, Square (algebra), Square matrix, Upper and lower bounds, Matrix (chemical analysis), Combinatorics, Mathematical analysis, Symmetric matrix