Boundedness-by-one conjecture for ratios of minors

About 2 years old · traced to

Let AA be a totally positive element of GLnGL_n, and let

R=det(AI1,I1′)det(AI2,I2′)⋯det(AIp,Ip′)det(AJ1,J1′)det(AJ2,J2′)⋯det(AJq,Jq′),R=\frac{\text{det}(A_{I_1,I'_1})\text{det}(A_{I_2,I'_2})\cdots\text{det}(A_{I_p,I'_p})}{\text{det}(A_{J_1,J'_1})\text{det}(A_{J_2,J'_2})\cdots\text{det}(A_{J_q,J'_q})},

where Ik,Ik′,Jk,Jk′⊆{1,2,…,n}I_k,I'_k,J_k,J'_k\subseteq\{1,2,\ldots,n\} satisfy ∣Ik∣=∣Ik′∣|I_k|=|I'_k| and ∣Jk∣=∣Jk′∣|J_k|=|J'_k|. A ratio is subtraction free when, in a weighted planar-network parametrization by face weights, its denominator minus numerator is a polynomial in the face weights with all coefficients positive. Boundedness-by-one conjecture. The ratio RR is bounded on the totally positive locus if and only if it is bounded by 11. This conjecture asserts a sharp normalization for bounded multiplicative determinantal inequalities. Its status is not resolved by the supplied text, which explicitly says that other bounded-ratio conjectures remain open.

References

Primary source

Michael Gekhtman, Zachary Greenberg and Daniel Soskin, “Multiplicative Inequalities In Cluster Algebras Of Finite Type”, arXiv:2409.06642 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.