No Finite Modular Obstructions for the Inverse Collatz Tree

The paper demonstrates a general method for determining if a generalized Collatz-type map (called herein an a, b, c map) has modular obstructions via an exact solution over the accelerated inverse tree formulation. We fully work the case for the Collatz map (3, 1, 2 map) and demonstrate that no finite modular obstructions, equivalently, no modular holes, no profinite obstructions, and that the tree contains infinite representatives at each class.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-05-31
DOI
https://doi.org/10.5281/zenodo.20479807
Primary Topic
Benford’s Law and Fraud Detection
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

No Finite Modular Obstructions for the Inverse Collatz Tree

Kilder Alexis Urrutia Martinez
Zenodo (CERN European Organization for Nuclear Research)
Benford’s Law and Fraud Detection
preprint

No Finite Modular Obstructions for the Inverse Collatz Tree

Kilder Alexis Urrutia Martinez
preprint en

Abstract

The paper demonstrates a general method for determining if a generalized Collatz-type map (called herein an a, b, c map) has modular obstructions via an exact solution over the accelerated inverse tree formulation. We fully work the case for the Collatz map (3, 1, 2 map) and demonstrate that no finite modular obstructions, equivalently, no modular holes, no profinite obstructions, and that the tree contains infinite representatives at each class.

Zenodo (CERN European Organization for Nuclear Research)
Benford’s Law and Fraud Detection
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.