Irrational relative Fourier angles in cyclic Legendre pairs of lengths 159 and 177

A normalized cyclic Legendre pair consists of two periodic sequences of +1 and −1, each with sum one, whose periodic autocorrelations add to −2 at every nonzero shift. For such a pair of length 159 or 177, the relative argument of its two Fourier coefficients is an irrational multiple of π at every nonprincipal character except possibly the two of order three. A rational angle would allow a cyclic shift that makes the two coefficients collinear or perpendicular. The sum of the two Fourier powers would then determine the squared magnitude of a cyclotomic integer. After a translation, its coefficient word is constant on the orbits of a multiplier. The lengths of these orbits constrain the sum of the coefficients, and reduction modulo 53 or 59 rules out the remaining configuration. At length 159 the theorem covers 156 of the 158 nonprincipal characters. At length 177 it covers 174 of 176. The conclusion holds under independent cyclic shifts of the two sequences. It gives a necessary condition for a pair at either length. The existence of such a pair is a separate question. This record holds the article and its source archive, supplement.zip. The same archive is attached to the PDF. It contains the LaTeX manuscript and bibliography, the Lean statements and proofs, the claim map, the pinned dependency versions, and the build and verification programs. The README explains how to rebuild the PDF and run the arithmetic checks with Python 3.11 or later. The formal guide explains how to obtain the pinned Lean 4.33.1 and Mathlib dependencies and replay the proofs. The formal check compiles all 22 supplied Lean modules from source, audits 270 declarations and replays the proofs in the Lean kernel. The only axioms used are propext, Classical.choice and Quot.sound. The check also alters each of the three stated propositions in turn and confirms that its original proof fails. The manuscript and original prose use CC BY 4.0. The original programs and all 22 Lean source files in this supplement use the MIT License. LICENSES.md gives the terms. Use of generative AI. Generative AI tools, including ChatGPT, Codex and Claude, assisted with the mathematics, proofs, programs and text. The author is responsible for all content.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24330065
Primary Topic
Coding theory and cryptography
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Irrational relative Fourier angles in cyclic Legendre pairs of lengths 159 and 177

Benedek Blackthorn
8 links
Zenodo (CERN European Organization for Nuclear Research)
Coding theory and cryptography
preprint

Irrational relative Fourier angles in cyclic Legendre pairs of lengths 159 and 177

Benedek Blackthorn
preprint en

Abstract

A normalized cyclic Legendre pair consists of two periodic sequences of +1 and −1, each with sum one, whose periodic autocorrelations add to −2 at every nonzero shift. For such a pair of length 159 or 177, the relative argument of its two Fourier coefficients is an irrational multiple of π at every nonprincipal character except possibly the two of order three. A rational angle would allow a cyclic shift that makes the two coefficients collinear or perpendicular. The sum of the two Fourier powers would then determine the squared magnitude of a cyclotomic integer. After a translation, its coefficient word is constant on the orbits of a multiplier. The lengths of these orbits constrain the sum of the coefficients, and reduction modulo 53 or 59 rules out the remaining configuration. At length 159 the theorem covers 156 of the 158 nonprincipal characters. At length 177 it covers 174 of 176. The conclusion holds under independent cyclic shifts of the two sequences. It gives a necessary condition for a pair at either length. The existence of such a pair is a separate question. This record holds the article and its source archive, supplement.zip. The same archive is attached to the PDF. It contains the LaTeX manuscript and bibliography, the Lean statements and proofs, the claim map, the pinned dependency versions, and the build and verification programs. The README explains how to rebuild the PDF and run the arithmetic checks with Python 3.11 or later. The formal guide explains how to obtain the pinned Lean 4.33.1 and Mathlib dependencies and replay the proofs. The formal check compiles all 22 supplied Lean modules from source, audits 270 declarations and replays the proofs in the Lean kernel. The only axioms used are propext, Classical.choice and Quot.sound. The check also alters each of the three stated propositions in turn and confirms that its original proof fails. The manuscript and original prose use CC BY 4.0. The original programs and all 22 Lean source files in this supplement use the MIT License. LICENSES.md gives the terms. Use of generative AI. Generative AI tools, including ChatGPT, Codex and Claude, assisted with the mathematics, proofs, programs and text. The author is responsible for all content.

Zenodo (CERN European Organization for Nuclear Research)
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon