Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries
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 $\pi$ and an optimal displacement vector $\mathbf{x}$ are given...
Saved in:
Main Authors | , , |
---|---|
Format | Journal Article |
Language | English |
Published |
25.05.2024
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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
$\pi$ and an optimal displacement vector $\mathbf{x}$ are given, we investigate
the reconfiguration and enumeration problems of the ``optimal'' cyclic ladder
lotteries of $\pi$ and $\mathbf{x}$. Next, for a give permutation $\pi$ we
consider reconfiguration and enumeration problems of the optimal displacement
vectors of $\pi$. |
---|---|
DOI: | 10.48550/arxiv.2405.16408 |