Related papers: Using binary string to prove the Collatz conjectur…
In this paper, we investigate a class of Collatz-like problems associated with weakly and strongly admissible triplets of integers. This framework extends the classical Collatz mapping, providing a systematic method for generating triplets…
A characterization is provided for each natural number except one (1) by means of an ordered pair of elements. The first element is a natural number called the type of the natural number characterized, and the second is a natural number…
In this paper, we present a new method for the analysis of piecewise dynamical systems that are similar to the Collatz conjecture in regard to certain properties of the commutator of their sub-functions. We use the fact that the commutator…
We study a natural analogue of Collatz's Conjecture for polynomials over $\mathbb{F}_2$.
We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…
A simple hierarchical structure is imposed on the set of Lipschitz functions on streams (i.e. sequences over a fixed alphabet set) under the standard metric. We prove that sets of non-expanding and contractive functions are closed under a…
The Collatz iteration is governed by two distinct update rules, depending on the parity of the current iterate: n(i+1)=3n(i)+1 for odd n(i), and n(i+1)=n(i)/2 for even n(i). We show that these rules can be written equivalently as a single…
We build a variant of Collatz Conjecture for polynomials over $\mathbb{F}_2$ and we prove that it is solved. By the way, we give several examples.
We explore a physical model of ordered sums of integers as trains of rods. The trains for a fixed, possibly infinite, set of rod lengths naturally correspond to nodes in a tree; relations among finite linear recursions encoded in the…
Given a sequence of distinct positive integers $w_0 , w_1, w_2, \ldots$ and any positive integer $n$, we define the discriminator function $\mathcal{D}_{\bf w}(n)$ to be the smallest positive integer $m$ such that $w_0,\ldots, w_{n-1}$ are…
Can we do arithmetic in a completely different way, with a radically different data structure? Could this approach provide practical benefits, like operations on giant numbers while having an average performance similar to traditional…
The Collatz Conjecture's connection to dynamical systems opens it to a variety of techniques aimed at recurrence and density results. First, we turn to density results and strengthen the result of Terras through finding a strict rate of…
Morphic sequences form a natural class of infinite sequences, typically defined as the coding of a fixed point of a morphism. Different morphisms and codings may yield the same morphic sequence. This paper investigates how to prove that two…
In this article we present set of infinite natural numbers which satisfies the conjecture $3n+1$.
This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
Very recently, Qi and Cui extended the Perron-Frobenius theory to dual number matrices with primitive and irreducible nonnegative standard parts and proved that they have Perron eigenpair and Perron-Frobenius eigenpair. The Collatz method…
Based on continued fractions with subtractions, we identify the set of real numbers with the set of infinite integer sequences with all terms but the first one greater or equal to two. Each such sequence produces in a canonical way a unique…
Goldbach`s Conjecture, "every even number greater than 2 can be expressed as the sum of two primes" is renamed Goldbach`s Rule for it can not be otherwise. The conjecture is proven by showing that the existence of prime pairs adding to any…
We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…