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

Shalosh B. Ekhad, Doron Zeilberger · arXiv (Cornell University) · 2019

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.

Read the paper · More papers on PaperTik