Symmetric sets of shifts with rational rotations: criteria, two infinite families, and computations
Year: 2026
Type: preprint
Abstract: To every finite set of distinct rational shifts the divided-difference identity attaches an orthogonal matrix, and the first paper of this series showed that all its entries are rational exactly when certain products of differences are squares. Here I study the sets that are symmetric about a point. I recall the criteria with short proofs, describe the two symmetric cases through the involution x→−x of the projective line (fixed points inside the configuration for an odd number of shifts, outside for an even number), prove a necessary condition in the even case, classify the case of four shifts, and give two infinite families of symmetric rational sets of six shifts: a one-parameter family with six projective automorphisms, and a second one, consisting of all rational sets of the form {±a, ±b, ±(a+b)}, whose generic member has two. I then report exhaustive searches: 38 primitive symmetric rational sets of nine shifts with largest shift at most 1500 (37 up to inversion), ten sets of six shifts up to 200 and 45 up to 1500 (36 and 5 of them in the two families, four outside both), one set of eight shifts up to 120, and none of ten shifts up to 400. Finally, I view the rotation as an orthogonal Cauchy-like matrix and describe all rational sets of five and of six shifts through integer quaternions. Whether the nine-shift sets are infinite in number, and whether symmetric rational sets of ten or thirteen shifts exist, is left open. Files: the paper (PDF), its LaTeX source, and code.zip with the search programs, their outputs, the exact check scripts, and the Lean 4 file RotCauchyOrth.lean with its build log.
Author: Bali, Mohammad
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Keywords: orthogonal matrices, exhaustive search
Open Access status: green
OpenAlex ID: W7234395342
