> Doron Gepner's Statistics on Words in {1,2,3}<sup>*</sup> is (Most Probably) Asymptotically Logistic
Doron Gepner's Statistics on Words in {1,2,3}* is (Most Probably) Asymptotically Logistic

By Doron Zeilberger


.pdf   .ps   .tex  

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

Written: March 31, 2016


Dedicated to my friend and hero, Doron Gepner (b. March 31, 1956), on his 60th birthday
ד ו ר ו ן   ל ד ו ר ו ן   מ ד ו ר ו ן

I first met Doron Gepner in 1980, when he was a Physics graduate student at the Weizmann Institute of Science, and I was a young ח ו ק ר   ב כ י ר. Already then Doron was a legend, since he was the first person in Israel, as far as I know, to have solved Rubik's cube completely from scratch, using group-theoretical methods. I was so impressed that I asked him to present a guest-lecture in my graduate combinatorics class, and the students loved it.

Doron then went on to do seminal work in theoretical physics, that, unfortunately, is over my head. But the part that is really interesting to me is his current work, greatly generalizing the celebrated Rogers-Ramanujan identities, and giving lots of new insight. I am sure that this work will lead to many future gems.

In this modest "gift" (Doron in Hebrew) to Doron, I continue work inspired by Gepner way back in 1987.

Happy birthday, Doron, and keep up the good work!


Added April 7, 2016: read Chaim Even-Zohar's insightful remarks.


Maple Program

GEPNER.txt.

Sample Input and Output Files for the Maple package GEPNER.txt


Personal Journal of Shalosh B. Ekhad and Doron Zeilberger

Doron Zeilberger's Home Page