论文信息 - Enumeration, Counting, and Random Generation of Ladder Lotteries

Enumeration, Counting, and Random Generation of Ladder Lotteries

A ladder lottery, known as “Amidakuji” in Japan, is one of the most popular lotteries. In this paper, we consider the problems of enumeration, counting, and random generation of the ladder lotteries. For given two positive integers \(n\) and \(b\), we give algorithms of enumeration, counting, and random generation of ladder lotteries with \(n\) lines and \(b\) bars.

Shin-Ichi Nakano | Katsuhisa Yamanaka

[1] Shin-Ichi Nakano. Efficient generation of triconnected plane triangulations , 2004, Comput. Geom..

[2] Shin-Ichi Nakano,et al. Efficient enumeration of all ladder lotteries and its application , 2010, Theor. Comput. Sci..

[3] David Avis,et al. Reverse Search for Enumeration , 1996, Discret. Appl. Math..

[4] Laurent Manivel,et al. Symmetric Functions Schubert Polynomials and Degeneracy Loci , 2001 .

[5] Yamanaka Katsuhisa,et al. Coding Ladder Lotteries , 2012 .