Related papers: Fibonacci Numbers and Model-Complete Axiomatizatio…

We introduce a model-complete theory which completely axiomatizes the structure $Z_{\alpha}=(Z, +, 0, 1, f)$ where $f : x \to \lfloor{\alpha} x \rfloor $ is a unary function with $\alpha$ a fixed transcendental number. When $\alpha$ is…

We introduce a new Tauberian framework through the theory of "regular arithmetic functions". This allows us to establish a characterization of the Riemann hypothesis by linking the floor function to the distribution of nontrivial zeros of…

We have provided a pure model-theoretic proof for the decidability of the additive structure of the integers together with the function {f} sending {x} to {[\phi x]} where {\phi} is the golden ratio.

We prove model completeness for the theory of addition and the Frobenius map for certain subrings of rational functions in positive characteristic. More precisely: Let $p$ be a prime number, $\mathbb{F}_{p}$ the prime field with $p$…

We present a quite curious generalization of multi-step Fibonacci numbers. For any positive rational $q$, we enumerate binary words of length $n$ whose maximal factors of the form $0^a1^b$ satisfy $a = 0$ or $aq > b$. When $q$ is an integer…

Let $f\colon\mathbb{N}\rightarrow\mathbb{C}$ be an arithmetic function and consider the Beatty set $\mathcal{B}(\alpha) = \lbrace\, \lfloor n\alpha \rfloor : n\in\mathbb{N} \,\rbrace$ associated to a real number $\alpha$, where…

The generalized Fibonacci sequences are sequences $\{f_n\}$ which satisfy the recurrence $f_n(s, t) = sf_{n - 1}(s, t) + tf_{n - 2}(s, t)$ ($s, t \in \mathbb{Z}$) with initial conditions $f_0(s, t) = 0$ and $f_1(s, t) = 1$. In a recent…

Mignosi, Restivo, and Salemi (1998) proved that for all $\epsilon > 0$ there exists an integer $N$ such that all prefixes of the Fibonacci word of length $\geq N$ contain a suffix of exponent $\alpha^2-\epsilon$, where $\alpha =…

We study the selfmatching properties of Beatty sequences, in particular of the graph of the function $\lfloor j\beta\rfloor $ against $j$ for every quadratic unit $\beta\in(0,1)$. We show that translation in the argument by an element $G_i$…

The Additive Transform of an arithmetic function represents a novel approach to examining the interplay between multiplicative arithmetic function and additive functions. This transform concept introduces a method to systematically generate…

The Fibonacci sequence is a series of positive integers in which, starting from $0$ and $1$, every number is the sum of two previous numbers, and the limiting ratio of any two consecutive numbers of this sequence is called the golden ratio.…

In the base phi expansion any natural number is written uniquely as a sum of powers of the golden mean with coefficients 0 and 1, where it is required that the product of two consecutive digits is always 0. We tackle the problem of…

Let $\alpha = (1+\sqrt{5})/2$ and define the lower and upper Wythoff sequences by $a_i = \lfloor i \alpha \rfloor$, $b_i = \lfloor i \alpha^2 \rfloor$ for $i \geq 1$. In a recent interesting paper, Kawsumarng et al. proved a number of…

We present some results and open problems related to expansions of the field of real numbers by hypergeometric and related functions focussing on definability and model completeness questions. In particular, we prove the strong model…

We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…

In a base phi representation a natural number is written as a sum of powers of the golden mean $\varphi$. There are many ways to do this. How many? Even if the number of powers of $\varphi$ is finite, then any number has infinitely many…

The paper explores combinatorial properties of Fibonacci words and their generalizations within the framework of combinatorics on words. These infinite sequences, measures the diversity of subwords in Fibonacci words, showing non-decreasing…

Let X = S \oplus G, where S is a countable abelian semigroup and G is a countably infinite abelian group such that {2g : g in G} is infinite. Let pi: X \to G be the projection map defined by pi(s,g) = g for all x =(s,g) in X. Let f:X \to…

We prove that a multiplicative function $f:\mathbb{N}\to\mathbb{C}$ is Toeplitz if and only if there are a Dirichlet character $\chi$ and a finite subset $F$ of prime numbers such that $f(n)=\chi(n)$ for each $n$ which is coprime to all…

We generalize Cooper's method of quantifier elimination for classical Presburger arithmetic to give a new proof that all parametric Presburger families (as defined by Kevin Woods) are definable by formulas with polynomially bounded…