跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.20344 · v2

Up or down at every integer: Collatz-type maps of arbitrary sets and the up-down graph

首次提交 2026-11-16 08:13
版本更新 2026-11-18 11:50
雷达观测 2026-11-19 19:08
arXiv ↗PDF ↗

摘要

For a set SS of positive integers let TST_S send xx to ⌈3x/2⌉\lceil 3x/2\rceil if x∈Sx\in S and to ⌈x/2⌉\lceil x/2\rceil otherwise. The odd numbers give the Collatz map, the even numbers give it again after a shift by one, and S=NS=\mathbb{N} gives Mahler's map x↦⌈3x/2⌉x\mapsto\lceil 3x/2\rceil. All these maps are subgraphs of the up-down graph GG, in which every xx has the edges x→⌈x/2⌉x\to\lceil x/2\rceil and x→⌈3x/2⌉x\to\lceil 3x/2\rceil, and so are the families of maps in which the direction is forced at some numbers and free at the others. The cycles of the maps are the simple cycles of the subgraph, their divergent orbits are its rays, and all maps of a family are bounded exactly when the subgraph has no ray. We classify the simplest sets and show that density says little: some sets of density one send every orbit to 1, and some periodic sets of arbitrarily small density have increasing orbits. Every positive integer is the least element of a cycle of some map. The critical proportion of steps up is log⁡32\log_3 2: cycles stay below it, divergent orbits stay above it, and both come arbitrarily close. For sets periodic modulo a power of 2, an effective up-frequency from a finite Markov chain takes the place of the density, and a finite computation can prove that every orbit reaches a cycle. Mahler's Z-number problem is implied by a question about one such map. Finally, we ask how far the Collatz map is from maps whose behaviour can be proved. Finite changes never help. Adding fewer than log⁡3/2N+1\log_{3/2}N+1 even numbers below NN makes an orbit increase, while removing the odd numbers congruent to 9 or 15 modulo 16, an eighth of all integers, gives a map all of whose orbits provably reach the cycle (1,2); removing 22 residue classes modulo 512, a proportion 0.043, also suffices.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

仅对比实际观测的元数据,不代表 PDF 正文或实验变化。版本可能不连续;带删除线为移除,下划线为新增。

这两个版本的已观测标题、作者、分类、摘要和备注没有变化。正文是否变化请核对原文。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-18 11:50 · 最新观测版本

Up or down at every integer: Collatz-type maps of arbitrary sets and the up-down graph

For a set SS of positive integers let TST_S send xx to ⌈3x/2⌉\lceil 3x/2\rceil if x∈Sx\in S and to ⌈x/2⌉\lceil x/2\rceil otherwise. The odd numbers give the Collatz map, the even numbers give it again after a shift by one, and S=NS=\mathbb{N} gives Mahler's map x↦⌈3x/2⌉x\mapsto\lceil 3x/2\rceil. All these maps are subgraphs of the up-down graph GG, in which every xx has the edges x→⌈x/2⌉x\to\lceil x/2\rceil and x→⌈3x/2⌉x\to\lceil 3x/2\rceil, and so are the families of maps in which the direction is forced at some numbers and free at the others. The cycles of the maps are the simple cycles of the subgraph, their divergent orbits are its rays, and all maps of a family are bounded exactly when the subgraph has no ray. We classify the simplest sets and show that density says little: some sets of density one send every orbit to 1, and some periodic sets of arbitrarily small density have increasing orbits. Every positive integer is the least element of a cycle of some map. The critical proportion of steps up is log⁡32\log_3 2: cycles stay below it, divergent orbits stay above it, and both come arbitrarily close. For sets periodic modulo a power of 2, an effective up-frequency from a finite Markov chain takes the place of the density, and a finite computation can prove that every orbit reaches a cycle. Mahler's Z-number problem is implied by a question about one such map. Finally, we ask how far the Collatz map is from maps whose behaviour can be proved. Finite changes never help. Adding fewer than log⁡3/2N+1\log_{3/2}N+1 even numbers below NN makes an orbit increase, while removing the odd numbers congruent to 9 or 15 modulo 16, an eighth of all integers, gives a map all of whose orbits provably reach the cycle (1,2); removing 22 residue classes modulo 512, a proportion 0.043, also suffices.

查看此版本解读 →查看此版本原文 ↗
v1 · 2026-11-16 08:13

Up or down at every integer: Collatz-type maps of arbitrary sets and the up-down graph

For a set SS of positive integers let TST_S send xx to ⌈3x/2⌉\lceil 3x/2\rceil if x∈Sx\in S and to ⌈x/2⌉\lceil x/2\rceil otherwise. The odd numbers give the Collatz map, the even numbers give it again after a shift by one, and S=NS=\mathbb{N} gives Mahler's map x↦⌈3x/2⌉x\mapsto\lceil 3x/2\rceil. All these maps are subgraphs of the up-down graph GG, in which every xx has the edges x→⌈x/2⌉x\to\lceil x/2\rceil and x→⌈3x/2⌉x\to\lceil 3x/2\rceil, and so are the families of maps in which the direction is forced at some numbers and free at the others. The cycles of the maps are the simple cycles of the subgraph, their divergent orbits are its rays, and all maps of a family are bounded exactly when the subgraph has no ray. We classify the simplest sets and show that density says little: some sets of density one send every orbit to 1, and some periodic sets of arbitrarily small density have increasing orbits. Every positive integer is the least element of a cycle of some map. The critical proportion of steps up is log⁡32\log_3 2: cycles stay below it, divergent orbits stay above it, and both come arbitrarily close. For sets periodic modulo a power of 2, an effective up-frequency from a finite Markov chain takes the place of the density, and a finite computation can prove that every orbit reaches a cycle. Mahler's Z-number problem is implied by a question about one such map. Finally, we ask how far the Collatz map is from maps whose behaviour can be proved. Finite changes never help. Adding fewer than log⁡3/2N+1\log_{3/2}N+1 even numbers below NN makes an orbit increase, while removing the odd numbers congruent to 9 or 15 modulo 16, an eighth of all integers, gives a map all of whose orbits provably reach the cycle (1,2); removing 22 residue classes modulo 512, a proportion 0.043, also suffices.

查看此版本解读 →查看此版本原文 ↗