Related papers: General Recurrence Multidimensional Zeckendorf Rep…

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$,…

We consider $m$-th order linear recurrences that can be thought of as generalizations of the Lucas sequence. We exploit some interplay with matrices that again can be considered generalizations of the Fibonacci matrix. We introduce the…

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by $F_{n+2}=F_{n+1}+F_n$, for $n\geq 0$, where $F_0=0$ and $F_1=1$. There are several interesting identities involving this sequence such as $F_n^2+F_{n+1}^2=F_{2n+1}$, for all $n\geq…

The necessary and sufficient conditions for existence of a generalized representer theorem are presented for learning Hilbert space-valued functions. Representer theorems involving explicit basis functions and Reproducing Kernels are a…

One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…

Zeckendorf proved that every positive integer has a unique partition as a sum of non-consecutive Fibonacci numbers. We study the difference between the number of summands in the partition of two consecutive integers. In particular, let…

We give a complete analysis of the projective unitary irreducible representations of the Poincar\'e group in 1+2 dimensions applying Mackey theorem and using an explicit formula for the universal covering group of the Lorentz group in 1+2…

In this paper, we study the linear space of all two-sided generalized Fibonacci sequences $\{F_n\}_{n \in \mathbb{Z}}$ that satisfy the recurrence equation of order $k$: $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$. We give two types of…

We introduce representations of the Cuntz algebra $\con$ which are parameterized by sequences in the set of unit vectors in ${\bf C}^{N}$. These representations are natural generalizations of permutative representations by…

We continue our earlier investigation on generalized reproducing kernels, in connection with the complex geometry of $C^*$- algebra representations, by looking at them as the objects of an appropriate category. Thus the correspondence…

Given a recurrence sequence $H$, with $H_n = c_1 H_{n-1} + \dots + c_t H_{n-t}$ where $c_i \in \mathbb{N}_0$ for all $i$ and $c_1, c_t \geq 1$, the generalized Zeckendorf decomposition (gzd) of $m \in \mathbb{N}_0$ is the unique…

We consider expansions of vectors by a general class of multidimensional continued fraction algorithms. If the expansion is eventually periodic, then we describe the possible structure of a matrix corresponding to the repetend, and use it…

We derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.

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 conjecture of Kac states that the polynomial counting the number of absolutely indecomposable representations of a quiver over a finite field with given dimension vector has positive coefficients and furthermore that its constant term is…

In previous work on Clebsch-Gordan coefficients, certain remarkable hexagonal arrays of integers are constructed that display behaviors found in Pascal's Triangle. We explain these behaviors further using the binomial transform and discrete…

We say that a contractive Hilbert space operator is universal if there is a natural surjection from its generated C*-algebra to the C*-algebra generated by any other contraction. A universal contraction may be irreducible or a direct sum of…

We construct C-algebras for a class of surfaces that are inverse images of certain polynomials of arbitrary degree. By using the directed graph associated to a matrix, the representation theory can be understood in terms of ``loop'' and…

Let $ k \geq 2 $ be an integer. The $ k- $generalized Fibonacci sequence is a sequence defined by the recurrence relation $ F_{n}^{(k)}=F_{n-1}^{(k)} + \cdots + F_{n-k}^{(k)}$ for all $ n \geq 2$ with the initial values $ F_{i}^{(k)}=0 $…

We propose a new definition of effective formulas for problems in enumerative combinatorics. We outline the proof of the fact that every linear recurrence sequence of integers has such a formula. It follows from a lower bound that can be…