Related papers: A Method for Uniformly Proving a Family of Identit…

This paper presents both a method and a result. The result presents a closed formula for the sum of the first $m+1,m \ge 0,$ squares of the sequence $F^{(k)}$ where each member is the sum of the previous $k$ members and with initial…

A probability method is provided to prove three classes of combinatorial identities. The method is extremely simple, only one step after the proper probability setup.

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…

Assume that $\{a_{n};\,n\geq0\}$ is a sequence of positive numbers and $\sum a_{n}^{\,-1}<\infty$. Let $\alpha_{n}=ka_{n}$, $\beta_{n}=a_{n}+k^{2}a_{n-1}$ where $k\in(0,1)$ is a parameter, and let $\{P_{n}(x)\}$ be an orthonormal polynomial…

We prove a number of new Rogers-Ramanujan type identities involving double, triple and quadruple sums. They were discovered after an extensive search using Maple. The main idea of proofs is to reduce them to some known identities in the…

We prove the following uniform version of a theorem by Lindstr\"om: Let $\mbox{$\cal F$}:=\{F_i:~ i\in I\}$ be a $k$-uniform set family of $[n]$, where $k\geq 1$. If $|\mbox{$\cal F$}|\geq n+1$, then there exist two disjoint subsets $I_1$…

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…

In this paper, a class of combinatorial identities is proved. A method is used which is based on the following rule: counting elements of a given set in two ways and making equal the obtained results. This rule is known as "counting in two…

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…

We apply a tree-based methodology to solve new, very broadly defined families of nested recursions of the general form R(n)=sum_{i=1}^k R(n-a_i-sum_{j=1}^p R(n-b_{ij})), where a_i are integers, b_{ij} are natural numbers, and k,p are…

A set family ${\cal F}$ is called intersecting if every two members of ${\cal F}$ intersect, and it is called uniform if all members of ${\cal F}$ share a common size. A uniform family ${\cal F} \subseteq \binom{[n]}{k}$ of $k$-subsets of…

We investigate general properties of number sequences which allow explicit representation in terms of products. We find that such sequences form whole families of number sequences sharing similar recursive identities. Restricting to the…

For odd n>=3, we consider a general hypothetical identity for the differences S_{n,0}(x) of multiples of n with even and odd digit sums in the base n-1 in interval [0,x), which we prove in the cases n=3 and n=5 and empirically confirm for…

Utilizing spectral residues of parameterized, recursively defined sequences, we develop a general method for generating identities of composition sums. Specific results are obtained by focusing on coefficient sequences of solutions of first…

A new family of $n$-dimensional solutions of the Jacobi identities is characterized. Such a family is very general, thus unifying in a common framework many different well-known Poisson systems seemingly unrelated. This unification is not…

Let $s_{k}(n)$ denote the sum of digits of an integer $n$ in base $k$. Motivated by certain identities of Nieto, and Bateman and Bradley involving sums of the form $\sum_{i=0}^{2^{n}-1}(-1)^{s_{2}(i)}(x+i)^{m}$ for $m=n$ and $m=n+1$, we…

Consider $k\ge 2$ distinct, linearly independent, homogeneous linear recurrences of order $k$ satisfying the same recurrence relation. We prove that the recurrences are related to a decomposable form of degree $k$, and there is a very broad…

We prove that for all positive integers $n$ and $k$, there exists an integer $N = N(n,k)$ satisfying the following. If $U$ is a set of $k$ direction vectors in the plane and $\mathcal{J}_U$ is the set of all line segments in direction $u$…

Franklin's identity generalizes Euler's identity and states that the number of partitions of $n$ with $j$ different parts divisible by $r$ equals the number of partitions of $n$ with $j$ repeated parts. In this article, we give a refinement…

We derive an identity connecting any two second-order linear recurrence sequences having the same recurrence relation but whose initial terms may be different. Binomial and ordinary summation identities arising from the identity are…