Exact word lengths in the transformation semigroup generated by a directed cycle
Year: 2026
Type: preprint
Abstract: Let C_n be the directed cycle on Z_n (n ≥ 3) and let S(C_n) be the semigroup generated by the n idempotents a_i that send i to i+1 and fix every other point. For α ∈ S(C_n), let ℓ(α) be the least number of generators whose product is α. We prove that S(C_n) is the semigroup of all singular orientation-preserving transformations of Z_n (this also follows from known results on idempotent generation), and that ℓ(α) = n − 1 for constant maps, while for α of rank r ≥ 2, ℓ(α) = (n − r) + λ(α), where λ(α) is the minimum total displacement of a lift of α to an order-preserving map of Z, given by an explicit closed formula. Consequently the maximum of ℓ over elements of rank r is r(2n − r − 1) for 2 ≤ r ≤ n − 1, and the maximum of ℓ over S(C_n) is n(n − 1), attained exactly by the n idempotents sending s+1 to s. To our knowledge no exact length formula was previously known for S(C_n). All formulas agree with exhaustive computation for n ≤ 10.
Author: Miyata, Fumio
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7226934579
