Fallat–Gekhtman–Johnson conjecture on factorization of bounded ratios of minors
Fallat–Gekhtman–Johnson conjecture on factorization of bounded ratios of minors
Let be a totally positive matrix. For index sequences and defining products of minors, write for the corresponding ratio. A ratio is subtraction-free if, when expressed as a rational function in the face weights, the polynomial has all positive coefficients. A primitive ratio is one of the primitive ratios defined for ratios of minors of totally positive matrices. Fallat–Gekhtman–Johnson's conjecture. Let be a ratio. Then (1) is bounded on all totally positive matrices if and only if it can be written as a product of primitive ratios; and (2) is bounded on all totally positive matrices if and only if it is subtraction-free. The paper gives counterexamples to the factorization assertion, while reporting that all found examples satisfy the subtraction-free assertion; hence the combined conjecture is not established as stated.
Sources & referencesView supporting material
Primary source
Daniel Soskin and Michael Gekhtman, “On bounded ratios of minors of totally positive matrices”, arXiv:2204.11962 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.