Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Nozaki, Yuta, Wasa, Kunihiro, Yamanaka, Katsuhisa
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914812608380928
author Nozaki, Yuta
Wasa, Kunihiro
Yamanaka, Katsuhisa
author_facet Nozaki, Yuta
Wasa, Kunihiro
Yamanaka, Katsuhisa
contents 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 $\mathbf{x}$ are given, we investigate the reconfiguration and enumeration problems of the ``optimal'' cyclic ladder lotteries of $π$ and $\mathbf{x}$. Next, for a give permutation $π$ we consider reconfiguration and enumeration problems of the optimal displacement vectors of $π$.
format Preprint
id arxiv_https___arxiv_org_abs_2405_16408
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries
Nozaki, Yuta
Wasa, Kunihiro
Yamanaka, Katsuhisa
Data Structures and Algorithms
Combinatorics
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 $\mathbf{x}$ are given, we investigate the reconfiguration and enumeration problems of the ``optimal'' cyclic ladder lotteries of $π$ and $\mathbf{x}$. Next, for a give permutation $π$ we consider reconfiguration and enumeration problems of the optimal displacement vectors of $π$.
title Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries
topic Data Structures and Algorithms
Combinatorics
url https://arxiv.org/abs/2405.16408