{
  "abstract": "The paper develops a source-uniform impossibility theorem within our stationary chronological-carry-refinement (CCR) polynomial program. The question is whether any choice of ordinary integer connected-source parameters can make the three lowest coefficients of a polynomial column vanish simultaneously. For every odd order from 5 through 75 and every prime transport parameter exceeding twice that order, the paper proves that divisibility by X^3 is impossible for all integer source vectors. It combines Bernoulli-numerator restrictions on transport primes with source-independent prime-order congruences and explicit finite-ring obstructions for exceptional composite orders. A particularly strong order-65 certificate uses uniform p-adic valuation bounds to eliminate higher sources and a Frobenius-function identity covering all 1,013 relevant low-source monomials. Its main novelty is converting a potentially unrestricted search over source vectors and transport primes into a complete, exact 36-order exclusion theorem, with computational certificates serving the universal algebraic reductions rather than sampled evidence. This is a finite-order impossibility theorem for the formal CCR family, not a proof for all odd orders or arbitrary physical automata.",
  "abstract_shown": true,
  "affiliations": [
    "Independent Researcher"
  ],
  "article_type": null,
  "arxiv": null,
  "author_total": 1,
  "authors": [
    {
      "affs": [
        0
      ],
      "name": "Alp Eren Bütün",
      "orcid": "0009-0001-2479-6037"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/82vbkmvnqycph.bib",
  "cited_by": 0,
  "doi": "10.5281/zenodo.23670863",
  "fulltext_url": null,
  "id": "82vbkmvnqycph",
  "issns": [],
  "landing_url": "https://zenodo.org/records/23670863",
  "language": "eng",
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "https://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": null,
  "native_subjects": [],
  "openalex": null,
  "pdf_url": "https://zenodo.org/api/records/23670863/files/Bernoulli_Transport_Sieves_and_Finite-Range_Triple-Zero_Exclusion.pdf/content",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-26",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/82vbkmvnqycph.ris",
  "sources": [
    {
      "first_seen": "2026-11-09T12:20:47Z",
      "native_id": "23670863",
      "source": "zenodo",
      "url": "https://zenodo.org/records/23670863"
    }
  ],
  "subjects": [],
  "title": "Bernoulli Transport Sieves and Finite-Range Integer-Source Triple-Zero Exclusion in Stationary CCR Polynomials",
  "title_text": "Bernoulli Transport Sieves and Finite-Range Integer-Source Triple-Zero Exclusion in Stationary CCR Polynomials",
  "type": "preprint",
  "updated_at": "2026-11-09T12:20:47Z",
  "url": "https://research.draconitic.com/paper/82vbkmvnqycph",
  "venue": "Zenodo",
  "versions": []
}