arXiv (OAI Expanded)
open access
Wirsching's Positive-Predecessor-Density Program: Proofs of Conjectures 1 and 3
Wirsching (2003) reduces uniform positive predecessor density for the $3n+1$ map to a chain of five conditions, organized into three conjectures. We prove two of them. Conjecture 1 concerns his path-counting generators: in the convolution carrying them to his Elka functions the partition weights gro
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Wirsching's Positive-Predecessor-Density Program: Proofs of Conjectures 1 and 3#780920
- Factorizations of 3d Interval Partition Functions#625480
- Factorizations of 3d Interval Partition Functions#623207
- Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration#259613
- Greedy Regular Convolutions#609775
Record · ID 779545
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive