PreprintCC BY 4.0arXiv
Inverting Dependently Random Tournaments
Abstract
Let inv(T) be the inversion index of the tournament T. Answering a question of Behague, we show that inv(T1→ T2)=inv(T1)+inv(T2) does not even hold asymptotically.
Related
- Random Tournaments Are Asymptotically Almost Surely Link-irregular
- Acyclic Dicolourings of Oriented Graphs: Paths, Random Tournaments, and Critical Orders
- Inverting the geodesic ray transform with finite measurements: stability and reconstruction
- An additional possibilities of the standard method of inverting the Radon transform
- RePAIR: Inverting Backdoor Attacks in Semantic Segmentation
BibTeX
@misc{williams2026inverting,
title = {{Inverting Dependently Random Tournaments}},
author = {Kada Williams},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.30185},
eprint = {2610.30185},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.30185},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Inverting Dependently Random Tournaments
AU - Kada Williams
PY - 2026
DA - 2026/10/20
PB - arXiv
DO - 10.48550/arxiv.2610.30185
UR - https://arxiv.org/abs/2610.30185
AB - Let inv(T) be the inversion index of the tournament T. Answering a question of Behague, we show that inv(T_1→ T_2)=inv(T_1)+inv(T_2) does not even hold asymptotically.
ER -