English(EN) Adaptive Search in Collatz Exponent-Code Space via 2-adic and 3-adic Constraints

新的符号搜索空间有助于 Collatz 猜想的研究

作者 PulseAugur 编辑部 · [1 个来源] · 2026-07-10 23:45

研究人员开发了一个新颖的符号搜索空间来研究 Collatz 猜想，利用有限指数代码来跟踪每次 3n + 1 步骤后的除以二操作。该方法基于实际漂移、2-adic 起始代表和 3-adic 终点代表定义了一个“2-3-无穷诊断”。实验表明，自适应进化搜索增强了有限长度代码的权衡，尽管所有测试方法都保持了正残差率，这表明该框架充当了诊断工具而非验证方法。 AI

排序理由该条目是一篇学术论文，详细介绍了一种研究数学猜想的新方法。[lever_c_demoted from research: ic=1 ai=0.1]

在 arXiv cs.NE (Neural & Evolutionary) 阅读 →

AI 生成摘要 · Google Gemini · 来自 1 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 0 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 该条目是一篇学术论文，详细介绍了一种研究数学猜想的新方法。[lever_c_demoted from research: ic=1 ai=0.1]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics: paper, other; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: Low; Off-topic or adjacent — cluster remains reachable but doesn't surface in AI-industry rankings.
Story freshness: 60 days old; Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

完整方法见我们的编辑标准。

报道来源 [1]

arXiv cs.NE (Neural & Evolutionary) TIER_1 English(EN) · Oliver Kramer · 2026-07-10 23:45

通过 2-adic 和 3-adic 约束在 Collatz 指数-代码空间中进行自适应搜索

We study a symbolic search space for the Collatz conjecture based on finite exponent codes of the accelerated map. Each code records the number of divisions by two after every 3n + 1 step and determines three quantities: real drift, a 2-adic start representative, and a 3-adic end…

本文如何被排名

报道来源 [1]

通过 2-adic 和 3-adic 约束在 Collatz 指数-代码空间中进行自适应搜索

相关实体

相关话题