Submitted works

Advanced search

math.AG — Algebraic Geometry

An explicit determinantal formula for Sinkhorn limits of matrices and tensors

Contributed by Shankar Sivarajan

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 n1×⋯×nrn_1\times\dots\times n_r 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 N=(dn1−1,…,nr−1)N=\binom{d}{n_1-1,\dots,n_r-1} with d=∑k(nk−1)d=\sum_k(n_k-1), 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 N×NN\times N generalized eigenvalue problem, whose null vector recovers the whole limit. The leading coefficient is the principal AA-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.

Primarily AI-generated textHuman understanding: all partsSinkhorn scaling
Nov 15, 202612 pages
PDFView work