I changed the order of the rows, does not matter, and puts off the fractions until later
parisize = 4000000, primelimit = 500000
? m = [ -1,2,-7,-2,46; 2,-3,5,1,-41; 3,7,-6,1,31; 7,2,-1,0,-28]
%1 =
[-1 2 -7 -2 46]
[ 2 -3 5 1 -41]
[ 3 7 -6 1 31]
[ 7 2 -1 0 -28]
? l1 = [ 1,0,0,0; 2,1,0,0; 3,0,1,0; 7,0,0,1]
%2 =
[1 0 0 0]
[2 1 0 0]
[3 0 1 0]
[7 0 0 1]
? l1 * m
%3 =
[-1 2 -7 -2 46]
[ 0 1 -9 -3 51]
[ 0 13 -27 -5 169]
[ 0 16 -50 -14 294]
? l2 = [ 1, -2,0,0; 0,1,0,0; 0,-13,1,0; 0, -16,0,1]
%4 =
[1 -2 0 0]
[0 1 0 0]
[0 -13 1 0]
[0 -16 0 1]
? l2 * l1 * m
%5 =
[-1 0 11 4 -56]
[ 0 1 -9 -3 51]
[ 0 0 90 34 -494]
[ 0 0 94 34 -522]
? l3 = [ 1,0,0,0; 0,1,0,0; 0,0,1/2,0; 0,0,0,1/2]
%6 =
[1 0 0 0]
[0 1 0 0]
[0 0 1/2 0]
[0 0 0 1/2]
? l3 * l2 * l1 * m
%7 =
[-1 0 11 4 -56]
[ 0 1 -9 -3 51]
[ 0 0 45 17 -247]
[ 0 0 47 17 -261]
? l4 = [ 1,0,0,0; 0,1,0,0; 0,0,1,-1; 0,0,0,1]
%8 =
[1 0 0 0]
[0 1 0 0]
[0 0 1 -1]
[0 0 0 1]
? l4 * l3 * l2 * l1 * m
%9 =
[-1 0 11 4 -56]
[ 0 1 -9 -3 51]
[ 0 0 -2 0 14]
[ 0 0 47 17 -261]
? l5 = [ 1,0,0,0; 0,1,0,0; 0,0,1/2,0; 0,0,0,1]
%10 =
[1 0 0 0]
[0 1 0 0]
[0 0 1/2 0]
[0 0 0 1]
? l5 *l4 * l3 * l2 * l1 * m
%11 =
[-1 0 11 4 -56]
[ 0 1 -9 -3 51]
[ 0 0 -1 0 7]
[ 0 0 47 17 -261]
? l6 = [ 1,0,0,0; 0,1,0,0; 0,0,1,0; 0,0,47,1]
%12 =
[1 0 0 0]
[0 1 0 0]
[0 0 1 0]
[0 0 47 1]
? l6 * l5 *l4 * l3 * l2 * l1 * m
%13 =
[-1 0 11 4 -56]
[ 0 1 -9 -3 51]
[ 0 0 -1 0 7]
[ 0 0 0 17 68]
? l7 = [ 1,0,0,0; 0,1,0,0; 0,0,1,0; 0,0,0,1/17]
%14 =
[1 0 0 0]
[0 1 0 0]
[0 0 1 0]
[0 0 0 1/17]
? l7 * l6 * l5 *l4 * l3 * l2 * l1 * m
%15 =
[-1 0 11 4 -56]
[ 0 1 -9 -3 51]
[ 0 0 -1 0 7]
[ 0 0 0 1 4]
?
?
? l8 = [ 1,0,11,0; 0,1,-9,0; 0,0,1,0; 0,0,0,1]
%16 =
[1 0 11 0]
[0 1 -9 0]
[0 0 1 0]
[0 0 0 1]
? l8 * l7 * l6 * l5 *l4 * l3 * l2 * l1 * m
%17 =
[-1 0 0 4 21]
[ 0 1 0 -3 -12]
[ 0 0 -1 0 7]
[ 0 0 0 1 4]
? l9 = [ 1,0,0,-4; 0,1,0,3; 0,0,1,0; 0,0,0,1]
%18 =
[1 0 0 -4]
[0 1 0 3]
[0 0 1 0]
[0 0 0 1]
? l9 * l8 * l7 * l6 * l5 *l4 * l3 * l2 * l1 * m
%19 =
[-1 0 0 0 5]
[ 0 1 0 0 0]
[ 0 0 -1 0 7]
[ 0 0 0 1 4]
?
?
All in all, we multiplied on the left by a nonsingular rational matrix,
?
? L = l9 * l8 * l7 * l6 * l5 *l4 * l3 * l2 * l1
%20 =
[ -3/34 -11/68 -1/68 -7/68]
[-19/34 -16/17 -3/17 9/34]
[ 1/2 3/4 1/4 -1/4]
[ 11/17 109/68 47/68 -45/68]
? matdet(L)
%21 = 1/136
?
?
Best Answer
Your observation that in binomial coefficients, the central ones are largest is the key. Let's conjecture that the same holds here: the multinomial coefficient will be largest when the difference between any two of the $r_i$ is at most $1$. To prove this, suppose for example $r_1-r_2\geq2.$ Show that you get a larger coefficient if you replace $r_1$ by $r_1+1$ and $r_2$ by $r_2-1,$ leaving $r_3,r_4$ unchanged. This follows at once from your observation about the binomial coefficients.