Computing Tools for Translation-Invariant Total Orders
arXiv:2607.11709
The paper presents TITO_Explore, a software library for representing translation‑invariant total orders (TITOs) and performing algorithmic operations such as canonical normalization, inversion‑set computation, weak‑order comparison, and join computation.
Abstract
We introduce TITO_Explore, a software package for representing and computing with Translation-Invariant Total Orders (TITOs). We define a canonical window notation for TITOs and design and implement algorithms for several computational tasks involving them. The package normalizes the window notation of a given TITO into its canonical form, computes its inversion set, compares the weak order between two TITOs, and computes the join of two specified TITOs. Our weak order comparison algorithm operates by partitioning the inversion sets into disjoint subsets, thereby breaking down the comparison problem into evaluations of paired subsets. The join algorithm uses an edge-weighted directed graph to represent inversions and converts the problem of finding the join into a weighted path problem in the graph.
13 pages