An explicit determinantal formula for Sinkhorn limits of matrices and tensors
Version 1 / Nov 15, 2026 / CC BY-SA 4.0
Abstract
We give an explicit formula, as a single determinant, for the polynomial satisfied by any entry of the limit obtained by scaling a positive tensor of format to arbitrary prescribed one-dimensional margins (Sinkhorn--Knopp scaling, Kruithof's method, iterative proportional fitting). The polynomial is the multilinear resultant, on the Segre variety $\PP^{n_1-1}\times\dots\times\PP^{n_r-1}$, of the linear forms expressing the margin conditions. Its degree is the multinomial coefficient with , and for generic tensors its roots are the corresponding entries of all complex solutions of the scaling equations. A Sylvester matrix turns it into an explicit generalized eigenvalue problem, whose null vector recovers the whole limit. The leading coefficient is the principal -determinant of the product of simplices, that is, the product of the hyperdeterminants of all faces of the tensor. The constant term is likewise a product of face hyperdeterminants, and the faces avoiding the chosen entry split off as a factor independent of that entry. For matrices we also give a short proof, in Pl\"ucker coordinates, of a diagonal form of the eliminant. For every positive tensor, the limit is the unique root for which the Sylvester matrix has a positive null vector of monomials. Generically, the other roots are the corner entries of the solutions of the same scaling equations with complex scaling factors.
Provenance statement
References
- C. Améndola, N. Bliss, I. Burke, C. Gibbons, M. Helmer, S. Hoşten, E. Nash, J. Rodriguez, D. Smolkin, The maximum likelihood degree of toric varieties , J.\ Symbolic Comput.\ 92 (2019) 222--242, doi:10.1016/j.jsc.2018.04.016 (https://doi.org/10.1016/j.jsc.2018.04.016).DOI
- D. N. Bernshtein, The number of roots of a system of equations , Funct.\ Anal.\ Appl.\ 9 (1975) 183--185, doi:10.1007/BF01075595 (https://doi.org/10.1007/BF01075595).DOI
- C. D'Andrea, Macaulay style formulas for sparse resultants , Trans.\ Amer.\ Math.\ Soc.\ 354 (2002) 2595--2629, doi:10.1090/S0002-9947-02-02910-0 (https://doi.org/10.1090/S0002-9947-02-02910-0).DOI
- C. D'Andrea, M. Sombra, A Poisson formula for the sparse resultant , Proc.\ Lond.\ Math.\ Soc.\ (3) 110 (2015) 932--964, doi:10.1112/plms/pdu069 (https://doi.org/10.1112/plms/pdu069).DOI
- M. C. Fang, Closed form of a generalized Sinkhorn limit , arXiv:2506.06338 (https://arxiv.org/abs/2506.06338) (2025).arXiv
- M. C. Fang, The eliminant of the generalized Sinkhorn limit: a resolution of the Rowland--Wu conjectures , preprint, Zenodo, doi:10.5281/zenodo.22864938 (https://doi.org/10.5281/zenodo.22864938) (2026).DOI
- J. Franklin, J. Lorenz, On the scaling of multidimensional matrices , Linear Algebra Appl.\ 114/115 (1989) 717--735, doi:10.1016/0024-3795(89)90490-4 (https://doi.org/10.1016/0024-3795(89)90490-4).DOI
- I. M. Gelfand, M. M. Kapranov, A. V. Zelevinsky, Discriminants, Resultants, and Multidimensional Determinants , Birkhäuser, Boston, 1994.
- J. Kruithof, Telefoonverkeersrekening , De Ingenieur 52 (1937) E15--E25.
- M. B. Nathanson, Alternate minimization and doubly stochastic matrices , Integers 20A (2020), #A10, doi:10.5281/zenodo.10657507 (https://doi.org/10.5281/zenodo.10657507).DOI
Show all 13 referencesShow fewer references
- E. Rowland, J. Wu, The entries of the Sinkhorn limit of an matrix , arXiv:2409.02789 (https://arxiv.org/abs/2409.02789) (2024).arXiv
- R. Sinkhorn, Diagonal equivalence to matrices with prescribed row and column sums , Amer.\ Math.\ Monthly 74 (1967) 402--405.
- B. Sturmfels, A. Zelevinsky, Multigraded resultants of Sylvester type , J.\ Algebra 163 (1994) 115--127, doi:10.1006/jabr.1994.1007 (https://doi.org/10.1006/jabr.1994.1007).DOI
Version history
- v1 · 12 pagesSubmitted by Shankar SivarajanInitial depositCurrentNov 13, 2026