Let $A$ be matrix in $\mathbb{R^{m \times n}}$. Let $A$ and $B$ be quadratic submatrices of $M$ such that $\det(A)< \det(B)$.
Does this imply $\prod_{i=1}^n \|A^i\| < \prod_{i=1}^n \|B^i\|$ (using Hadamard's inequality), where $A^i$ and $B^i$ denotes the columns of $A$ and $B$, respectively.
If I have understood the question correctly, this is a counterexample:
Let $$A=\left(\begin{matrix} 10 & 0 & 0\\ 0 & 10 & 10\\ 0 & 0 & 0 \end{matrix}\right) $$
$$B=\left(\begin{matrix} 1 & 0 & 0\\ 0 & 1 & 0\\ 0 & 0 & 1 \end{matrix}\right) $$
Then $0=\det(A)<\det(B)=1$, but $\prod_{i=1}^3 \|a_i\| \ge \prod_{i=1}^3 \|b_i\|$.