Reconfiguration and enumeration of optimal cyclic ladder lotteries

DOI10.1007/978-3-031-34347-6_28MaRDI QIDQ6182918zbMATH OpenOpenAlexFDO

Authors Yuta Nozaki, Kunihiro Wasa, Katsuhisa Yamanaka

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

cyclic ladder lotteryenumerationreconfiguration

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(2)

• Enumeration, Counting, and Random Generation of Ladder Lotteries
• Reconfiguration and enumeration of optimal cyclic ladder lotteries

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

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