Reconfiguration and enumeration of optimal cyclic ladder lotteries
Year: 2025
Type: article
Abstract: A ladder lottery , known as “Amidakuji” in Japan, is a common way to decide an assignment at random. In this paper, we investigate reconfiguration and enumeration problems of cyclic ladder lotteries. First, when a permutation π and an optimal displacement vector x are given, we investigate the reconfiguration and enumeration problems of the “optimal” cyclic ladder lotteries of π and x . Next, for a given permutation π we consider reconfiguration and enumeration problems of the optimal displacement vectors of π .
Source: Theoretical Computer Science
Authors: Yuta Nozaki, Kunihiro Wasa, Katsuhisa Yamanaka
Institutions: Yokohama National University, Hosei University, Iwate University
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,880
OpenAlex ID: W4412049247
