Answers are grounded in this paper and cite their sources.
We ask whether all distinct arrangements of a fixed collection of symbols can be visited once by reversing initial segments, with one final reversal returning to the start. Requiring a cycle to contain at least three distinct arrangements, such a listing exists exactly when at least three distinct symbols occur, or when two occur and each occurs at least twice. For binary words, we construct smaller paths with entrance and exit choices that allow them to be joined. For general multisets, we carry colours through binary tours and join the resulting cycles. For the canonical binary cycle, we compute the successor from the current word in linear time. We also stream the reversal lengths with constant worst-case control delay after linear initialization. Both algorithms use linear working space. Control delay measures the work to choose and emit the next reversal length, excluding physical reversal, copying and printing of the word.
No takes yet. Share an insight, caveat, or question.
Ariel Elboim (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: