Skip to main content
SpringerLink
Log in

Enumeration, Counting, and Random Generation of Ladder Lotteries

  • Conference paper
  • First Online:
Frontiers in Algorithmics (FAW 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9130))

Included in the following conference series:

  • 704 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    We assume that \(n\) and \(b\) are coded in unary codes.

References

  1. Aiuchi, T., Yamanaka, K., Hirayama, T., Nishitani, Y.: Coding ladder lotteries. In: Proceedings of European Workshop on Computational Geometry 2013, Braunschweig, Germany, pp. 151–154, March 2013

    Google Scholar 

  2. Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math. 65(1–3), 21–46 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  3. Knuth, D.E.: Axioms and Hulls. LNCS, vol. 606. Springer, Heidelberg (1992)

    MATH  Google Scholar 

  4. Manivel, L.: Symmetric Functions, Schubert Polynomials and Degeneracy Loci. American Mathematical Society, Providence (2001)

    MATH  Google Scholar 

  5. Nakano, S.: Efficient generation of triconnected plane triangulations. Comput. Geom. Theory Appl. 27(2), 109–122 (2004)

    Article  MATH  Google Scholar 

  6. Yamanaka, K., Nakano, S.: Listing all plane graphs. J. Graph Algorithms Appl. 13(1), 5–18 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  7. Yamanaka, K., Nakano, S., Matsui, Y., Uehara, R., Nakada, K.: Efficient enumeration of all ladder lotteries and its application. Theoret. Comput. Sci. 411, 1714–1722 (2010)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgment

This work is partially supported by MEXT/JSPS KAKENHI, including the ELC project. (Grant Numbers 24106007 and 25330001).

Author information

Authors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Iwate University, Ueda 4-3-5, Morioka, Iwate, 020-8551, Japan

    Katsuhisa Yamanaka

  2. Department of Computer Science, Gunma University, Tenjin-cho 1-5-1, Kiryu, Gunma, 376-8515, Japan

    Shin-ichi Nakano

Authors
  1. Katsuhisa Yamanaka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shin-ichi Nakano
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Katsuhisa Yamanaka .

Editor information

Editors and Affiliations

  1. Central South University, Changsha, China

    Jianxin Wang

  2. Courant Institute, New York University, New York, New York, USA

    Chee Yap

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Yamanaka, K., Nakano, Si. (2015). Enumeration, Counting, and Random Generation of Ladder Lotteries. In: Wang, J., Yap, C. (eds) Frontiers in Algorithmics. FAW 2015. Lecture Notes in Computer Science(), vol 9130. Springer, Cham. https://doi.org/10.1007/978-3-319-19647-3_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19647-3_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19646-6

  • Online ISBN: 978-3-319-19647-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation