Answers are grounded in this paper and cite their sources.
We study rowmotion on the order ideals of the four-segment fence F̆(a,b,c,d), with a,b,c,d ≥ 2. When d divides c, a central first return is described by the positive first return of a modular translation to an integer interval, with explicit return times and red-tile counts. Put g = gcd(a,b), m = a/g > 1, and P = mb + 1. Under the resonance conditions gcd(P,c) ≥ m and gcd(P,c+1) ≥ m, we classify all primitive rowmotion orbits by at most six arithmetic records. The formulas give their multiplicities, lengths, and ideal-cardinality sums, and yield a necessary and sufficient homometry test involving at most fifteen pairs of records. The interval size m is unbounded. An explicit infinite family has three distinct orbit lengths and satisfies ideal-cardinality homometry. For the general one-sided return, one first hit can be evaluated in O(log² P) integer arithmetic operations using Euclidean floor sums.
No takes yet. Share an insight, caveat, or question.
Zihuan Xu (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: