Enumeration, Counting, and Random Generation of Ladder Lotteries

DOI10.1007/978-3-319-19647-3_27MaRDI QIDQ3452576zbMATH OpenOpenAlexFDO

Authors Katsuhisa Yamanaka, Shin-Ichi Nakano

Publication date 12 November 2015

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-19647-3_27

zbMATH Keywords

counting algorithmsenumeration algorithms

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Nonnumerical algorithms (68W05)

Recommendations

• Efficient enumeration of all ladder lotteries and its application
• Reconfiguration and enumeration of optimal cyclic ladder lotteries
• Enumerating optimal solutions to special instances of the lottery problem
• Lattices and lotteries
• Lotteries and truncated binomial coefficients
• Prompt enumerations and relative randomness
• On the probability of generating a lattice
• Recursive combinatorial structures: enumeration, probabilistic analysis and random generation

Cites work

• Axioms and hulls
• Efficient enumeration of all ladder lotteries and its application
• Efficient generation of triconnected plane triangulations.
• Listing All Plane Graphs
• Reverse search for enumeration
• Symmetric functions, Schubert polynomials and degeneracy loci. Transl. from the French by John R. Swallow

Cited in

(3)

• Optimal reconfiguration of optimal ladder lotteries
• scientific article; zbMATH DE number 3896971 (Why is no real title available?)
• Efficient enumeration of all ladder lotteries and its application

This page was built for publication: Enumeration, Counting, and Random Generation of Ladder Lotteries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452576)