Linear Extensions of Rotor-Routing in Directed Graphs: Reachability Problems
The Electronic Journal of Combinatorics · 14.04.2026 · 33 (2)
DOI: 10.37236/13580 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 14.04.2026. Verfasst von David Auger und 2 weiteren Autor:innen.
Abstract (Originalsprache)
We introduce a linear extension of the rotor-routing model in directed graphs, akin to the sandpile model and vector addition systems, together with new rotor mechanisms that extend standard cyclic rotors. In this framework, rotor-routing is interpreted as the simultaneous movement of particles accross two coupled graphs, involving both vertex and arc-based particles. The standard, combinatorial rotor-routing of positive particles (legal routing) based on rotor-configurations, then becomes a special case of a linear equivalence. We give comprehensive reachability results characterizing legal routings among linear equivalences, expanding on previous results, and settle the algorithmic complexities associated with these problems.
Zitieren
APA
Auger, D., Coucheney, P., & Etse, K. R. (2026). Linear Extensions of Rotor-Routing in Directed Graphs: Reachability Problems. The Electronic Journal of Combinatorics, 33(2). https://doi.org/10.37236/13580
Vancouver
Auger D, Coucheney P, Etse KR. Linear Extensions of Rotor-Routing in Directed Graphs: Reachability Problems. The Electronic Journal of Combinatorics. 2026;33(2). doi:10.37236/13580
BibTeX
@article{Auger2026,
author = {Auger, David and Coucheney, Pierre and Etse, Kossi Roland},
title = {Linear Extensions of Rotor-Routing in Directed Graphs: Reachability Problems},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {2},
doi = {10.37236/13580}
}
EUVIMED