Answers to Some Questions about Explicit Sinkhorn Limits posed by Mel Nathanson

Abstract

At the Jan. 2018 Joint Mathematics Meetings, Avi Wigderson gave a series of three fascinating lectures whose starting point was the Sinkhorn algorithm. One of the people in the audience was Mel Nathanson, and this lead him to ask some intriguing questions, some of which we answer in this note.

6 pages. Accompanied by a Maple package, SINKHORN.txt and numerous output files available from http://sites.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/sinkhorn.html

Cited by in corpus (1)

• Matrix scaling and explicit doubly stochastic limits