Related papers: Synchronizable functions on integers

Consider all possible ways of attaching disjoint chords to two ordered and oriented disjoint intervals so as to produce a connected graph. Taking the intervals to lie in the real axis with the induced orientation and the chords to lie in…

Given a polynomial $f(x_1,x_2,\ldots, x_t)$ in $t$ variables with integer coefficients and a positive integer $n$, let $\alpha(n)$ be the number of integers $0\leq a<n$ such that the polynomial congruence $f(x_1, x_2, \ldots, x_t)\equiv a\…

In this paper, we study the dynamics of an operator $\mathcal T$ naturally associated to the so-called Collatz map, which maps an integer $n \geq 0$ to $n / 2$ if $n$ is even and $3n + 1$ if $n$ is odd. This operator $\mathcal T$ is defined…

Motivated by a 2001 problem of S\'ark\"ozy, we classify all situations of the integers $b,c,e$ and $f$ satisfying \begin{align*} \limsup_{n\rightarrow\infty}|d(\mathcal{A},bn+c)-d(\mathcal{A},en+f)|=\infty \end{align*} for any infinite…

We consider the set of finite sequences of length n over a finite or countable alphabet C. We consider the function which associate each given sequence with the size of the maximum overlap with a (shifted) copy of itself. We compute the…

Erdos and Niven proved that for any positive integers $m$ and $d$, there are only finitely many positive integers $n$ for which one or more of the elementary symmetric functions of $1/m,1/(m+d), ..., 1/(m+nd)$ are integers. Recently, Chen…

We introduce a basis of rational polynomial-like functions $P_0,\ldots,P_{n-1}$ for the free module of functions $Z/nZ\to Z/mZ$. We then characterize the subfamily of congruence preserving functions as the set of linear combinations of the…

For $-1\le B<A\le 1$, let $\mathcal{S}^*(A,B)$ denote the class of normalized analytic functions $f(z)= z+\sum_{n=2}^{\infty}a_n z^n$ in $|z|<1$ which satisfy the subordination relation $zf'(z)/f(z)\prec (1+Az)/(1+Bz)$ and $\Sigma^*(A,B)$…

The theory of regular and aperiodic transformations of finite strings has recently received a lot of interest. These classes can be equivalently defined using logic (Monadic second-order logic and first-order logic), two-way machines…

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 establish an equivalent condition to the validity of the Collatz conjecture, using elementary methods. We derive some conclusions and show several examples of our results. We also offer a variety of exercises, problems and conjectures.

We define two natural classes of functions, called 2-open and 2-closed, that are closest to open and closed functions. We show that they have the following property: there are $X_i \subset X$ $ (i=1,2,...$) such that $f|X_i$ are open or…

This paper introduces and analyzes symmetric and anti-symmetric quantum binary functions. Generally, such functions uniquely convert a given computational basis state into a different basis state, but with either a plus or a minus sign.…

Let $g$ be a map from the set of positive integers into itself defined as follows: Let $x$ be a positive integer. If $x$ is odd, then $g(x)=3x+1$, and if $x$ is even, then $g(x)=x/2$. The $3x+1$ conjecture, also called the Collatz…

I propose and investigate the use of continuous functional equations for the study of meta-Fibonacci integer sequences. This exploratory study includes three sequences with quite different behavior: Conway's famous sequence $A(n)=…

Floyd and Knuth investigated in 1990 register machines which can add, subtract and compare integers as primitive operations. They asked whether their current bound on the number of registers for multiplying and dividing fast (running in…

Finite (word) state transducers extend finite state automata by defining a binary relation over finite words, called rational relation. If the rational relation is the graph of a function, this function is said to be rational. The class of…

A natural connection between rational functions of several real or complex variables, and subspace collections is explored. A new class of function, superfunctions, are introduced which are the counterpart to functions at the level of…

The Collatz conjecture is one of the easiest mathematical problems to state and yet it remains unsolved. For each $n\ge 2$ the Collatz iteration is mapped to a binary sequence and a corresponding unique integer which can recreate the…

We investigate (2,1):1 structures, which consist of a countable set $A$ together with a function $f: A \to A$ such that for every element $x$ in $A$, $f$ maps either exactly one element or exactly two elements of $A$ to $x$. These…