Related papers: The Kolakoski sequence and related conjectures abo…
In this paper, we construct an infinite family of binary linear codes associated with double cosets with respect to certain maximal parabolic subgroup of the orthogonal group O(2n+1,q). Here q is a power of two. Then we obtain an infinite…
It is shown that every Collatz sequence $C(s)$ consists only of same structured finite subsequences $C^h(s)$ for $s\equiv9\ (mod\ 12)$ or $C^t(s)$ for $s\equiv3,7\ (mod\ 12)$. For starting numbers of specific residue classes ($mod\…
An Ulam sequence U(1,n) is defined as the sequence starting with integers 1,n such that n > 1, and such that every subsequent term is the smallest integer that can be written as the sum of distinct previous terms in exactly one way. This…
The Fibonacci sequence is a sequence of numbers that has been studied for hundreds of years. In this paper, we introduce the new sequence S_{k,n} with initial conditions S_{k,0} = 2b and S_{k,1} = bk + a, which is generated by the…
{\bf Abstract.} Considered is the distribution of the cross correlation between $m$-sequences of length $2^m-1$, where $m$ is even, and $m$-sequences of shorter length $2^{m/2}-1$. The infinite family of pairs of $m$-sequences with…
Golomb's sequence is the unique nondecreasing sequence of positive integers in which each $n$ appears exactly $a(n)$ times. It satisfies the global self-referential rule \[ a\bigl(a(n)+a(n-1)+\cdots+a(1)\bigr)=n, \] grows smoothly like a…
The Collatz function is defined as C(n) = n / 2 if n is even and C(n) = 3n + 1 if n is odd. The Collatz conjecture states that every sequence generated by the Collatz function ends with the cycle (4, 2, 1) after a finite number of…
We define a Tanaka's equation on an oriented graph with two edges and two vertices. This graph will be embedded in the unit circle. Extending this equation to flows of kernels, we show that the laws of the flows of kernels $K$ solution of…
It is well known that Sturmian sequences are the aperiodic sequences that are balanced over a 2-letter alphabet. They are also characterized by their complexity: they have exactly $(n+1)$ factors of length $n$. One possible generalization…
Considering all possible paths that a natural number can take following the rules of the algorithm proposed in the Collatz conjecture we construct a graph that can be interpreted as an infinite network that contemplates all possible paths…
We prove a conjecture that classifies exceptional numbers. This conjecture arises in two different ways, from cryptography and from coding theory. An odd integer $t\geq 3$ is said to be exceptional if $f(x)=x^t$ is APN (Almost Perfect…
We study an extension to the uniqueness conjecture for Markov numbers. For any three positive integers $m\geq a$ and $m\geq b$ satisfying $a^2+b^2+m^2=3abm$, this conjecture states that the triple $(a,m,b)$ is uniquely determined by the…
Let $m$, $n$, and $k$ be integers satisfying $0 < k \leq n < 2k \leq m$. A family of sets $\mathcal{F}$ is called an $(m,n,k)$-intersecting family if $\binom{[n]}{k} \subseteq \mathcal{F} \subseteq \binom{[m]}{k}$ and any pair of members of…
This paper presents full classification of second minimal odd periodic orbits of a continuous endomorphisms on the real line. A $(2k+1)$-periodic orbit ($k\geq 3$) is called second minimal for the map $f$, if $2k-1$ is a minimal period of…
Orientable sequences of order n are infinite periodic sequences with symbols drawn from a finite alphabet of size k with the property that any particular subsequence of length n occurs at most once in a period in either direction. They were…
An n-ary k-radius sequence is a finite sequence of elements taken from an alphabet of size n such that any two distinct elements of the alphabet occur within distance k of each other somewhere in the sequence. These sequences were…
For N=1,2,..., let S_N be a simple random sample of size n=n_N from a population A_N of size N, where 0<=n<=N. Then with f_N=n/N, the sampling fraction, and 1_A the inclusion indicator that A is in S_N, for any H a subset of A_N of size k>=…
The aim of this paper is to show a peculiar behavior of a (hypothetical) Collatz sequence going to infinity. We study the associated Syracusa sequence (the odd elements of the former) and show that the limit set of a conveniently normalized…
This paper studies the proof of Collatz conjecture for some set of sequence of odd numbers with infinite number of elements. These set generalized to the set which contains all positive odd integers. This extension assumed to be the proof…
Let $ k, m, n $ be positive integers with $ k \geq 2 $. A $ k $-multiset of $ [n]_m $ is a collection of $ k $ integers from the set $ \{1, 2, \ldots, n\} $ in which the integers can appear more than once but at most $ m $ times. A family…