4 problems

For $n \geq 1$, let $D(n,n)$ be the set of minor specifications described in the paper, and let $M(S)$ be the associated product of minors of a positive $n \times n$ matrix $A$. Le…

Conjectural formula. The number of degree of difficulty is

Finite-supremum conjecture. The supremum of the number of solutions of this equation, as $D$ ranges over integer-coefficient polynomials with $\deg(D)\leq k$, exists; denote it by…

For each $n$, let $\mathcal{P}_n$ be the parameter space of degree-$n$ polynomials and let $\widetilde{\mathcal{P}}_n\to\mathcal{P}_n$ be the associated cover parametrizing a root.…