Press release · 30 August 2026 · version 0.1.0-candidate
A four-element obstruction to birational and piecewise-linear rowmotion periodicity
A non-graded four-element rooted tree has infinite-order birational and piecewise-linear rowmotion, and exhaustive exact replay proves that no smaller finite poset can do so.
Summary
Rowmotion repeatedly updates labels on a partially ordered set. Many important families are periodic: after finitely many updates, every generic labelling returns to where it began. This anonymous, unrefereed candidate gives a smallest possible obstruction for two standard lifted forms of rowmotion.
The poset has four elements:
r
/ \
a b
|
cBoth birational rowmotion and order-polytope piecewise-linear rowmotion have infinite order on this poset. Exact exhaustive enumeration proves that no finite poset with three or fewer elements can have either behaviour.
Summary for specialists
Let $P=\{r,a,b,c\}$ have covers $a<r$, $b<r$ and $c<b$. With birational boundary labels fixed to one and toggles applied from top to bottom,
If $t>1$ is the positive root of $t^9-t-1$, then
is fixed. Writing $p=1/(1+t)$, the logarithmic derivative has characteristic polynomial
Finite order would put $p$ in a totally real cyclotomic subfield. But $\mathbb Q(p)=\mathbb Q(t)$, while $t^9-t-1$ is irreducible and has one real root and eight nonreal roots. This contradiction proves infinite birational order.
For piecewise-linear rowmotion, the rational interior fixed point
lies in a strict linearity chamber. The local derivative there has a nontrivial Jordan block at eigenvalue $-1$. A finite-order map cannot have such a derivative at a fixed point.
Technical account: two local obstructions
The birational proof does not try to follow a generic orbit. It uses a fixed point to turn a global periodicity claim into a local linear-algebra test. If $R^N$ were the identity rational map, differentiating at the positive fixed point would give $J^N=I$. Every eigenvalue would be an $N$th root of unity, so every real coefficient of the characteristic polynomial would lie in a totally real cyclotomic field. The exact field signature rules this out.
The piecewise-linear argument follows the same compression principle in a different category. At an interior point where the relevant maxima and minima are strict, the map is genuinely linear nearby. A nontrivial Jordan block survives every even power, so no iterate can be the identity on that neighbourhood.
These are separate proofs. The piecewise-linear claim is not inferred from the birational obstruction.
Why four elements are necessary
Minimality is global over finite posets, not merely over rooted trees or fences. The verifier enumerates every labelled strict partial order through size three and then quotients by relabelling:
| Size | Labelled strict orders | Isomorphism classes | Exact birational periods |
|---|---|---|---|
| 0 | 1 | 1 | $1$ |
| 1 | 1 | 1 | $2$ |
| 2 | 3 | 2 | $2,3$ |
| 3 | 19 | 5 | $2,4,6,6,6$ |
All nine isomorphism classes therefore have finite birational order. Because these identities are subtraction-free, the standard tropicalisation principle transfers them to the corresponding piecewise-linear maps. Hence no poset on at most three elements is an obstruction for either lift.
Evidence, assurance and limitations
The immutable package contains the five-page DOI-bearing paper, aligned Markdown and proof certificate, exact Python replay, language-separated JavaScript corroboration, the exhaustive small-poset classification, five semantic mutations, source and convention correspondence, citation and bounded novelty audits, the supplied review and response, licences, environment declaration, checksum ledger and complete manifest.
Public Linux CI verifies the shipped bytes, reruns Python normally and under optimization, rejects all five corrupted certificates, runs the JavaScript checks, rebuilds the PDF and inspects its structure. GitHub and Zenodo expose the same five release assets, and unauthenticated downloads matched the local files byte for byte.
These checks establish availability, integrity and producer replay. They do not establish unaffiliated rerun or reimplementation, proof-assistant formalization, authenticated external specialist review, editorial peer review, historical priority or research impact.
Relationship to earlier work
The four-element Hasse shape is not claimed as new. Grinberg and Roby draw the same non-skeletal rooted tree, up to order duality, in their Example 70. Their nearby theorem proves finite order for skeletal posets and does not determine the order of this non-skeletal example.
The 2015 AIM problem list asks broadly for the study of birational rowmotion on Proctor's d-complete posets. Dangwal and coauthors later reported experimental evidence for nonperiodicity on non-graded rooted trees without a proof. Up to reversal or duality, the present poset is the asymmetric two-segment fence $\breve F(2,3)$; Mertin and Poznanović provide the closest family-level context but not the two fixed-point obstructions or global four-element minimality proved here.
The bounded search found no exact theorem collision. That is not proof of historical novelty, so the release makes no first or priority claim.
Who should care, and why
| Audience | Potential use | Required caution |
|---|---|---|
| Algebraic combinatorialists | A sharp local obstruction on the smallest possible poset | Do not read it as a classification of d-complete posets |
| Dynamical-systems researchers | A fixed-point derivative route from periodicity to field signature or Jordan form | The arguments depend on the stated toggle and boundary conventions |
| Computational reviewers | A nine-class exact minimality fixture with hostile mutations | Reimplement independently rather than importing producer code |
| Formalizers | Two compact local arguments plus a finite exhaustive base case | The rational-map domain and tropical transfer still need formalization |
| Interested readers | A concrete example where a four-point order already supports nonperiodic lifted dynamics | Candidate publication is not field consensus |
Why the problem matters
Rowmotion links posets, dynamical algebraic combinatorics and representation- theoretic structure. Periodicity theorems are often signatures of hidden regularity. A size-minimal obstruction identifies exactly how little non-graded structure is needed for that regularity to fail, while the two different derivative arguments give reusable tests for other families.
How to inspect or reproduce the checks
Use tag v0.1.0-candidate or the version DOI, not moving main:
python3 verify_theorem.py
python3 -O verify_theorem.py
node verify_theorem.mjs
python3 test_mutations.pyFor the complete manifest and document gates:
bash run_all.shExpected markers include PASS_EXHAUSTIVE_SMALL_POSET_MINIMALITY, LANGUAGE_SEPARATED_ALL_CHECKS_PASS, MUTATIONS_PASS 5/5 and PACKAGE_PASS. Successful execution confirms the encoded identities and finite enumeration. It does not establish novelty, independence or peer review.
The most valuable next projects
- Classify finite- and infinite-order birational rowmotion on non-graded rooted trees or more general d-complete posets.
- Determine the periodicity boundary for asymmetric two-segment fences.
- Reconstruct both local obstructions in a materially separate stack.
- Formalize the field, Jordan and minimality arguments in a proof assistant.
- Obtain an authenticated specialist review and wider priority audit.
What is in the evidence package
The all-files ZIP includes the DOI-bearing PDF and source, aligned Markdown, proof and theorem certificates, exact verifiers, exhaustive minimality output, tests and mutations, source/citation/novelty records, the supplied review and response, licences, runtime declaration, release notes, receipts, checksums and complete manifest. The version DOI is the citation target; any correction should be a versioned successor rather than a silent edit.
Media
The audio briefing is provided in the header above. Download the MP3 briefing · read the transcript.
Open directions for follow-up research
Also available in machine-readable form for research agents and follow-up projects.
- Classify finite-order and infinite-order birational rowmotion on non-graded rooted trees or on d-complete posets more broadly.
- Determine which asymmetric two-segment fences have finite-order birational or piecewise-linear rowmotion.
- Independently reconstruct both fixed-point derivative obstructions in a materially separate stack.
- Formalize the birational field argument, piecewise-linear Jordan obstruction and exhaustive size-three minimality in a proof assistant.
- Obtain an authenticated specialist review and a broader historical-priority assessment.
Verification status
Anonymous, unrefereed algebraic-combinatorics theorem candidate at PASS_WITH_NOTES after minor-revision repair. The supplied review independently recalculated the central theorem as correct, but reviewer identity and unaffiliated status were not authenticated. The four-element Hasse shape is prior art up to duality; no exact theorem collision was found in the bounded search, and no first or priority claim is made.
Cite
BibTeX
@misc{fourelementrowmotionperiodicity2026,
title = {A four-element obstruction to birational and piecewise-linear rowmotion periodicity},
author = {Anonymous},
year = {2026},
doi = {10.5281/zenodo.22178666},
url = {https://doi.org/10.5281/zenodo.22178666},
version = {0.1.0-candidate},
howpublished = {Zenodo},
note = {Unrefereed; internally replayed evidence package. Press page: https://evidencepress.org/releases/four-element-rowmotion-periodicity/}
}Also: cite.bib · paper.json · this page as Markdown