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

By Shalosh B. Ekhad and Doron Zeilberger


.pdf   .ps   .tex  

(Exclusively published in the Personal Journal of Shalosh B. Ekhad and Doron Zeilberger and arxiv.org )

Posted: Feb. 27, 2019; Last update of this webpage (but not article): March 3, 1019.


At the Jan. 2018 Joint Mathematics Meetings, Avi Wigderson gave a series of three fascinating lectures (here is the first one) 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.


Maple package


Sample Input and Output Files for the Maple package SINKHORN.txt,



Personal Journal of Shalosh B. Ekhad and Doron Zeilberger

Doron Zeilberger's Home Page