Fallat–Gekhtman–Johnson conjecture on factorization of bounded ratios of minors
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.