Table of Contents
Fetching ...

Increasing-decreasing patterns in the iteration of an arithmetic function

Melvyn B. Nathanson

TL;DR

The paper investigates whether the Syracuse function $S(m)$ can realize every prescribed alternating pattern of increases and decreases for odd positive integers. It develops a matrix-based realization: a built matrix $M$ with carefully chosen integer sequences yields a surjective map from $\mathbb{Z}^{n+1}$ to $\mathbb{Z}^n$, guaranteeing the existence of odd-positive solutions to $M\mathbf x=\mathbf h$ and hence the desired pattern $V$ via a finite Diophantine system; with two proofs provided (diophantine construction and Smith normal form). A direct Syracuse-specific analysis furnishes explicit monotone runs, and a modular, simpler proof shows that for any pattern sequence $\Lambda$ there exists a modulus $2^{\ell}$ and residue $r$ such that $m\equiv r\pmod{2^{\ell}}$ yields the pattern, establishing wild increasing-decreasing without solving the full Diophantine system. The work demonstrates a constructive framework for pattern realizability in discrete dynamical systems and raises open questions about related aliquot-like trajectories and necessary-sufficient conditions for wild behavior.

Abstract

Let $Ω$ be a set of positive integers and let $f:Ω\rightarrow Ω$ be an arithmetic function. Let $V = (v_i)_{i=1}^n$ be a finite sequence of positive integers. An integer $m \in Ω$ has \textit{increasing-decreasing pattern} $V$ with respect to $f$ if, for all odd integers $i \in \{1,\ldots, n\}$, \[ f^{v_1+ \cdots + v_{i-1}}(m) < f^{v_1+ \cdots + v_{i-1}+1}(m) < \cdots < f^{v_1+ \cdots + v_{i-1}+v_{i}}(m) \] and, for all even integers $i \in \{2,\ldots, n\}$, \[ f^{v_1+ \cdots + v_{i-1}}(m) > f^{v_1+ \cdots +v_{i-1}+1}(m) > \cdots > f^{v_1+ \cdots +v_{i-1}+v_i}(m). \] The arithmetic function $f$ is \textit{wildly increasing-decreasing} if, for every finite sequence $V$ of positive integers, there exists an integer $m \in Ω$ such that $m$ has increasing-decreasing pattern $V$ with respect to $f$. This paper gives a proof that the Syracuse function is wildly increasing-decreasing.

Increasing-decreasing patterns in the iteration of an arithmetic function

TL;DR

The paper investigates whether the Syracuse function can realize every prescribed alternating pattern of increases and decreases for odd positive integers. It develops a matrix-based realization: a built matrix with carefully chosen integer sequences yields a surjective map from to , guaranteeing the existence of odd-positive solutions to and hence the desired pattern via a finite Diophantine system; with two proofs provided (diophantine construction and Smith normal form). A direct Syracuse-specific analysis furnishes explicit monotone runs, and a modular, simpler proof shows that for any pattern sequence there exists a modulus and residue such that yields the pattern, establishing wild increasing-decreasing without solving the full Diophantine system. The work demonstrates a constructive framework for pattern realizability in discrete dynamical systems and raises open questions about related aliquot-like trajectories and necessary-sufficient conditions for wild behavior.

Abstract

Let be a set of positive integers and let be an arithmetic function. Let be a finite sequence of positive integers. An integer has \textit{increasing-decreasing pattern} with respect to if, for all odd integers , and, for all even integers , The arithmetic function is \textit{wildly increasing-decreasing} if, for every finite sequence of positive integers, there exists an integer such that has increasing-decreasing pattern with respect to . This paper gives a proof that the Syracuse function is wildly increasing-decreasing.
Paper Structure (8 sections, 7 theorems, 88 equations)

This paper contains 8 sections, 7 theorems, 88 equations.

Key Result

Theorem 1

Let $(a_i)_{i=1}^n$ and $(b_j)_{j=2}^{n+1}$ be sequences of nonzero real numbers. Consider the $n \times (n+1)$ matrix

Theorems & Definitions (14)

  • Theorem 1
  • proof
  • Theorem 2
  • proof
  • Theorem 3
  • proof
  • Lemma 1
  • proof
  • Lemma 2
  • proof
  • ...and 4 more