Related papers: Generalizing Zeckendorf's Theorem to f-decompositi…

It is well known that every positive integer N can be written as the sum of non-consecutive powers of the golden ratio. We prove that the non-positive powers, together with the parity of the first positive power, can determine the positive…

Prempreesuk, Noppakaew, and Pongsriiam determined the Zeckendorf representation of the multiplicative inverse of $2$ modulo $F_n$, for every positive integer $n$ not divisible by $3$, where $F_n$ denotes the $n$th Fibonacci number. We…

A subset of positive integers $F$ is a Schreier set if it is non-empty and $|F|\leqslant \min F$ (here $|F|$ is the cardinality of $F$). For each positive integer $k$, we define $k\mathcal{S}$ as the collection of all the unions of at most…

A positive linear recurrence sequence (PLRS) is a sequence defined by a homogeneous linear recurrence relation with positive coefficients and a particular set of initial conditions. A sequence of positive integers is \emph{complete} if…

In this paper we present a family of identities for recursive sequences arising from a second order recurrence relation, that gives instances of Zeckendorf representation. We prove these results using a special case of an universal property…

Philip Matchett Wood and Doron Zeilberger have constructed identities for the Fibonacci numbers $f_n$ of the form $1f_n = f_n$ for all $n \geq 1$; $2f_n = f_{n-2} + f_{n+1}$ for all $n \geq 3$; $3f_n = f_{n-2} + f_{n+2}$ for all $n \geq 3$;…

Let $\beta=\frac{1+\sqrt{5}}{2}$, $(a_n)_{n \in \mathbb{N}^+}$ be a non-uniform morphic sequence involving the infinite Fibonacci word and $(\delta(n))_{n \in \mathbb{N}^+}$ be a positive sequence such that for all positive integers $n$,…

Hofstadter's $G$ function is recursively defined via $G(0)=0$ and then $G(n)=n-G(G(n-1))$. Following Hofstadter, a family $(F_k)$ of similar functions is obtained by varying the number $k$ of nested recursive calls in this equation. We…

A combinatorial structure, $\mathcal{F}$, with counting sequence $\{a_n\}_{n\ge 0}$ and ordinary generating function $G_\mathcal{F}=\sum_{n\ge0} a_n x^n$, is positive algebraic if $G_\mathcal{F}$ satisfies a polynomial equation…

Let $f_1=1,f_2=2$ and $f_i=f_{i-1}+f_{i-2}$ for $i>2$ be the sequence of Fibonacci numbers. Let $\Phi_h(n)$ be the quantity of partitions of natural number $n$ into $h$ different Fibonacci numbers. In terms of Zeckendorf partition of $n$ I…

A finite subset of the natural numbers is weak-Schreier if $\min S \ge |S|$, strong-Schreier if $\min S>|S|$, and maximal if $\min S = |S|$. Let $M_n$ be the number of weak-Schreier sets with $n$ being the largest element and $(F_n)_{n\geq…

Consider a_1,a_2,...,a_n, arbitrary elements of R. We characterize those real functions f that decompose into the sum of a_j-periodic functions, i.e., f=f_1+...+f_n with D_{a_j}f(x):=f(x+a_j)-f(x)=0. We show that f has such a decomposition…

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

In the process of proving a sharpened form of G\r{a}rding's inequality, Fefferman & Phong demonstrated that every non-negative function $f\in C^{3,1}(\mathbb{R}^n)$ can be written as a finite sum of squares of functions in…

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…

By $(\mathbb{Z}^+)^{\infty}$ we denote the set of all the infinite sequences $\mathcal{S}=\{s_i\}_{i=1}^{\infty}$ of positive integers (note that all the $s_i$ are not necessarily distinct and not necessarily monotonic). Let $f(x)$ be a…

If a function $f:\mathbb{R}\to\mathbb{R}$ can be represented as the sum of $n$ periodic functions as $f=f_1+\dots+f_n$ with $f(x+\alpha_j)=f(x)$ ($j=1,\dots,n$), then it also satisfies a corresponding $n$-order difference equation…

Let $F_n(k)$ be the generalized Fibonacci number defined by (with $F_i(k)$ abbreviated to $F_i$): $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$, for $n \geq k$, and the initial values $(F_0,F_1,...,F_{k-1})$. Let $B_n(k,j)$ be $F_n(k)$ with…

The non-commutative theory of the Lebesgue-type decomposition of positive functionals is originated with S. P. Gudder. Although H. Kosaki's counterexample shows that the decomposition is not unique in general, the complete characterization…

This paper is about counting the number of distinct (scattered) subwords occurring in a given word. More precisely, we consider the generalization of the Pascal triangle to binomial coefficients of words and the sequence $(S(n))_{n\ge 0}$…