Repository navigation
This edition brings together four papers on generalized stack permutations, their formal certificates, exact algebraic data, and reproducible source code.
Papers
The PDFs are the primary reading editions. Download them below or open them in the repository:
- Algebraic enumeration of generalized stack permutations: algebraicity for every fixed positive width pair and an exact degree-12 equation for the (3,3) counting series.
- A direct enumeration of permutations sortable by a generalized (2,2)-stack: a structural derivation of the known cubic generating function.
- Physical capacity in a generalized stack: exact series and a Brownian limit: exact bounded-capacity series, minimum-memory statistics, and asymptotic capacity.
- Finite and infinite bases for generalized stacks: obstruction families and capacity thresholds.
Changes in this edition
- Adds portable Lean source packets for general positive-width algebraicity, the exact degree-12 result for the actual (3,3) counting series, and finite-side basis cardinalities and obstruction-family widths.
- Updates the algebraicity and classification papers, formal-scope documentation, and reproduction instructions to reflect the included certificates.
- Preserves explicit distinctions between formalized results, written arguments, finite checks, and historical compilation evidence.
Reproduce and reuse
Start with the reproduction guide. The claim-by-claim scope and verification record document the proof boundaries and provenance. Publication verified the reviewed file inventory and hashes; it did not perform a new Lean proof replay.
Download either source archive below for the complete 2,701-file release. From its extracted root, run python3 verify_release.py to verify the manifest.
Papers and original exposition are licensed under CC BY 4.0; original code and Lean sources are licensed under MIT. See license coverage.