Published August 31, 2026
| Version 0.2.0-candidate
Preprint
Open
A linearly growing free-by-cyclic family with unbounded BNS component-orbit count
Authors/Creators
Description
Unrefereed theorem candidate constructing a linearly growing free-by-cyclic family with exactly 2m+2 BNS components and an unbounded lower bound of m+1 on component orbits under the outer automorphism group. The BNS identification depends on Cashen-Levitt Corollary 2.10. Producer-side replay and internal editorial review do not constitute peer review, independent reproduction, formal verification, or historical priority.
Notes
The cc-zero field applies only to package-original components; LICENSES.md records MIT code and third-party exclusions. Anonymous, AI-assisted, unrefereed theorem candidate; publication does not imply peer review, formal verification, independent reconstruction, authenticated specialist consensus, or historical priority.
Files
paper.pdf
Additional details
Related works
- Is derived from
- https://web.archive.org/web/20240828224509id_/http://aimpl.org/freebycyclic/6/ (URL)
- Is supplement to
- https://github.com/ipitchford/unbounded-bns-component-orbits (URL)