2000 character limit reached
Matrix scaling, explicit Sinkhorn limits, and arithmetic
Published 12 Feb 2019 in math.NT | (1902.04544v1)
Abstract: The process of alternately row scaling and column scaling a positive $n \times n$ matrix $A$ converges to a doubly stochastic positive $n \times n$ matrix $S(A)$, called the \emph{Sinkhorn limit} of $A$. Exact formulae for the Sinkhorn limits of certain symmetric positive $3\times 3$ matrices are computed, and related problems in diophantine approximation are considered.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.