Answers are grounded in this paper and cite their sources.
Huang, Huh, Soskin and Wang characterized bounded ratios of Lorentzian matrix entries by cut inequalities. We prove that every normalized bounded ratio has supremum at most two on matrices of rank at most two. The supremum equals two exactly when the indices admit an ordering in which every proper initial cut is tight. In particular, the seven-index ratio that exceeds two in Zhou's rank-three example has rank-two supremum exactly two. We prove the coefficientwise conjecture of Huang, Huh, Soskin and Wang for all integral hypermetric exponents and find the optimal multiplier eight for each of the two six-index hypermetrics they single out. For bounded integral ratios whose denominator uses each edge of the complete bipartite graph \(K2,N\) once, we compute both the numerical supremum and the least coefficientwise multiplier. For every bounded integral ratio, the \(k\)th root of the least coefficientwise multiplier for its \(k\)th power converges to the rank-two numerical supremum of the original ratio.
No takes yet. Share an insight, caveat, or question.
Sam Vaseghi (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: