Related papers: Synchronizable functions on integers
Regular string-to-string functions enjoy a nice triple characterization through deterministic two-way transducers (2DFT), streaming string transducers (SST) and MSO definable functions. This result has recently been lifted to FO definable…
We give new Turing machines that simulate the iteration of the Collatz 3x+1 function. First, a never halting Turing machine with 3 states and 4 symbols, improving the known 3x5 and 4x4 Turing machines. Second, Turing machines that halt on…
Proposed in 1937, the Collatz conjecture has remained in the spotlight for mathematicians and computer scientists alike due to its simple proposal, yet intractable proof. In this paper, we propose several novel theorems, corollaries, and…
We consider the Lommel functions $s_{\mu,\nu}(z)$ for different values of the parameters $(\mu,\nu)$. We show that if $(\mu,\nu)$ are half integers, then it is possible to describe these functions with an explicit combination of polynomials…
Using Euler transformation of series we relate values of Hurwitz zeta function at integer and rational values of arguments to certain rapidly converging series where some generalized harmonic numbers appear. The form of these generalized…
In this paper, we are interested in the number of fixed points of functions $f:A^n\to A^n$ over a finite alphabet $A$ defined on a given signed digraph $D$. We first use techniques from network coding to derive some lower bounds on the…
In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data $\omega$-words). The notion of computability is defined through Turing machines with infinite inputs which can…
The Collatz problem is related to the fixed point problem, and is widely used in mathematics. It has attracted a wide range of math enthusiasts, but is still difficult to solve. So, this article aimed to study the extension of the Collatz…
We study two formalisms that allow to compare transducers over words under origin semantics: rational and regular resynchronizers, and show that the former are captured by the latter. We then consider some instances of the following…
Let $A = \{a_{1},a_{2},\dots{}\}$ $(a_{1} < a_{2} < \dots{})$ be an infinite sequence of nonnegative integers, and let $R_{A,2}(n)$ denote the number of solutions of $a_{x}+a_{y}=n$ $(a_{x},a_{y}\in A)$. P. Erd\H{o}s, A. S\'ark\"ozy and V.…
In this article, we reduce the unsolved problem of convergence of Collatz sequences to convergence of Collatz sequences of odd numbers that are divisible by 3. We give an elementary proof of the fact that a Collatz sequence does not…
Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…
For a long time, Collatz Conjecture has been assumed to be true, although a formal proof has eluded all efforts to date. In this article, evidence is presented that suggests such an assumption is incorrect. By analysing the stopping times…
It is consistent that for every function f:R x R-> R there is an uncountable set A subseteq R and two continuous functions f_0,f_1:D(A)-> R such that f(alpha, beta) in {f_0(alpha, beta),f_1(alpha, beta)} for every (alpha, beta) in A^2,…
We introduce an infinite set of integer mappings that generalize the well-known Collatz-Ulam mapping and we conjecture that an infinite subset of these mappings feature the remarkable property of the Collatz conjecture, namely that they…
Linear-constraint loops are programs whose transition relation is specified by a system of linear inequalities. The termination problem asks, given a loop, whether it admits an infinite computation. Decidability of termination remains open…
Two infinite sequences A and B of non-negative integers are called additive complements, if their sum contains all sufficiently large integers. Let $A(x)$ and $B(x)$ be the counting functions of A and B. In this paper, we extend the results…
In this work the generalized Collatz problem $qn+1$ ($q$ odd) is studied. As a natural generalization of the original $3n+1$ problem, it consists of a discrete dynamical system of an arithmetical kind. Using standard methods of number…
Given a positive definite binary quadratic form f, let r(n) = |{(x,y): f(x,y)=n}| denote its representation function. In this paper we study linear correlations of these functions. For example, if r_1, ..., r_k are representation functions,…
We study in general algebras Gratzer's notion of congruence preserving function, characterizing functions in terms of stability under inverse image of particular Boolean algebras of subsets generated from any subset of the algebra.…