Up or down at every integer: Collatz-type maps of arbitrary sets and the up-down graph
cs.DM, math.DS, math.NT
Submitted: 2026-11-16
Updated: 2026-11-18
Related papers
- Low-Temperature Sampling via Equilibrium Disagreements
- An Improved Bound for Testing k-Colorability
- Temporal Cliques Admit Linear Spanners
- Multiway Partition is FPT for Connectivity Functions
- Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
- Constrained intersection representations and forbidden patterns