Negative orientable sequences: exact periods at orders three and four, finite certificates and even-order asymptotics

We study negative orientable sequences over Z_k with modular negation. We give explicit integer dual certificates and matching constructions for the maximum period at order three for every even k>=4, and at order four for every k>=3. A negative-palindrome return bound, combined with the construction of Mitchell and Wild, yields the optimal leading deficit m k^m+O_m(k^(m-1)) at each fixed even order 2m>=4. Two separately implemented integer checkers verify 62 baseline finite cases, closing 27 entries in the cited Mitchell–Wild table, and four additional order-four cases at k=17–20. The package includes sequences, certificates, reproducible checkers and a stepwise adversarial review of the general arguments. Finite mechanical verification is distinguished from analytical proofs; independent specialist review is pending. Higher-order exact families and the odd-order leading deficit remain open.

Authors

Publication Details

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

Negative orientable sequences: exact periods at orders three and four, finite certificates and even-order asymptotics

Franciscus Gerardus Adrianus Van den Berg
Zenodo (CERN European Organization for Nuclear Research)
semigroups and automata theory
preprint

Negative orientable sequences: exact periods at orders three and four, finite certificates and even-order asymptotics

Franciscus Gerardus Adrianus Van den Berg
preprint en

Abstract

We study negative orientable sequences over Z_k with modular negation. We give explicit integer dual certificates and matching constructions for the maximum period at order three for every even k>=4, and at order four for every k>=3. A negative-palindrome return bound, combined with the construction of Mitchell and Wild, yields the optimal leading deficit m k^m+O_m(k^(m-1)) at each fixed even order 2m>=4. Two separately implemented integer checkers verify 62 baseline finite cases, closing 27 entries in the cited Mitchell–Wild table, and four additional order-four cases at k=17–20. The package includes sequences, certificates, reproducible checkers and a stepwise adversarial review of the general arguments. Finite mechanical verification is distinguished from analytical proofs; independent specialist review is pending. Higher-order exact families and the odd-order leading deficit remain open.

Zenodo (CERN European Organization for Nuclear Research)
semigroups and automata theory
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