Let be a matrix, such that and all matrix entries are distinct (no repetitions).
I need to find such A with a maximum determinant.
I can really use some guidance here.
thanks in advanced!
Hi ILikeSerena! loved your profile pic...
thanks for the help.
did you managed to find any constancy?
I mean, what's so special about these matrices (with the maximum determinant)?
I was thinking more like, if:
then I want the expression in the brackets to be as small as possible.
in other words, I want to find the arrangment that'll produce the the smallest sum for:
but I'm just thinking out loud here, i don't see how can it be solved,
so if you have any more ideas i'd love to hear...
Yes. The problem is that all those number are used in a positive sense but also in a negative sense.
My first idea was to consider the eigenvalues.
The determinant is the product of the eigenvalues.
The trace is the sum of the eigenvalues.
To find a maximum determinant, the sum should also be maximal, but only if all eigenvalues are positive.
Anyway, that would mean having 7,8,9 on the main diagonal.
That's when I decided to brute force it, to see if my idea was right.
At least I found that 12 matrices have indeed 7,8,9 on their diagonal.
You want a pattern?
Well, take a look yourself.
The solutions are:
There are another 12 matrices with 1,2,3 and yet another 12 with 4,5,6 on their main diagonal.
All matrices appear to have the same numbers in their rows, or in their columns.
For instance each matrix has the number 1,5,7 in either a row or a column.
The permutation that will produce the smallest sum of over is:
therfore, it doesn't matter how i'll set up the entries, as long as the sign of every one of these products ( ), is (-1).
so 9,6,1 for example can be set in , since the sign for is (-1), and so on...
thank you so much.
that was very helpful.
a little correction, it's not enough to find the amallest sum of , but also the biggest, which is:
the commutative is the explanation for the multiple options, i guess.