Related papers: Generalized Schreier sets, linear recurrence relat…
Linear recursions of degree $k$ are determined by evaluating the sequence of Generalized Fibonacci Polynomials, $\{F_{k,n}(t_1,...,t_k)\}$ (isobaric reflects of the complete symmetric polynomials) at the integer vectors $(t_1,...,t_k)$. If…
While not obvious from its initial motivation in linear algebra, there are many context where iterated traces can be defined. In this paper we prove a very general theorem about iterated 2-categorical traces. We show that many…
We show that Generic Green's conjecture holds for generic binary curves, through a detailed analysis of the family of scrolls containing fixed rational normal curves.
The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…
In this paper, we connect two well established theories, the Fibonacci numbers and the Jordan algebras. We give a series of matrices, from literature, used to obtain recurrence relations of second-order and polynomial sequences. We also…
In the last 30 years, the mathematical theory of aperiodic order has developed enormously. Many new tilings and properties have been discovered, few of which are covered or anticipated by the early papers and books. Here, we start from the…
We prove a stronger version of Jarden's Theorem for recurrence of powers of recursive functions
We study the Tur\'{a}n numbers of $3$-graphs avoiding $3$-graphs $F$ and $M_{s+1}^3$, a matching of size $s+1$. We disprove a conjecture of Gerbner, Tompkins, and Zhou [European Journal of Combinatorics, 2025, 127:104155] on…
In this paper, we establish several formulae for sums and alternating sums of products of generalized Fibonacci and Lucas numbers. In particular, we recover and extend all results of Z. Cerin and Z. Cerin & G. M. Gianella, more easily.
The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…
We generalize Mattei's result relative to the Brian\c{c}on-Skoda theorem for foliations to the family of foliations of the second type. We use this generalization to establish relationships between the Milnor and Tjurina numbers of…
We study growth rates of generalised Fibonacci sequences of a particular structure. These sequences are constructed from choosing two real numbers for the first two terms and always having the next term be either the sum or the difference…
We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests. We prove that the number of generalized Stirling permutations with a fixed number of ascents is given by a natural…
We prove the following the generalized Tur\'an type result. A collection $\mathcal{T}$ of $r$ sets is an $r$-triangle if for every $T_1,T_2,\dots,T_{r-1}\in \mathcal{T}$ we have $\cap_{i=1}^{r-1}T_i\neq\emptyset$, but $\cap_{T\in…
We investigate a connection between generalized Fibonacci numbers and renewal theory for stochastic processes. Using Blackwell's renewal theorem we find an approximation to the generalized Fibonacci numbers. With the help of error estimates…
In this paper, we consider infinite sums derived from the reciprocals of the generalized Fibonacci numbers. We obtain some new and interesting identities for the generalized Fibonacci numbers.
We study the existence of a natural `linearisation' process for generalised connections on an affine bundle. It is shown that this leads to an affine generalised connection over a prolonged bundle, which is the analogue of what is called a…
We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]
We start with a bijective proof of Schur's theorem due to Alladi and Gordon and describe how a particular iteration of it leads to some very general theorems on colored partitions. These theorems imply a number of important results,…
In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving…