Reconfiguration and enumeration of optimal cyclic ladder lotteries

DOI10.1007/978-3-031-34347-6_28OpenAlexW4379117827MaRDI QIDQ6182918

Katsuhisa Yamanaka, Kunihiro Wasa, Yuta Nozaki

Publication date: 22 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-34347-6_28

zbMATH Keywords

enumerationreconfigurationcyclic ladder lottery

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Coding and counting arrangements of pseudolines
• Efficient enumeration of all ladder lotteries and its application
• The complexity of finding minimum-length generator sequences
• Reverse search for enumeration
• Optimal reconfiguration of optimal ladder lotteries
• Combinatorics of Coxeter Groups
• New lower bounds for the number of pseudoline arrangements

This page was built for publication: Reconfiguration and enumeration of optimal cyclic ladder lotteries