Add to ORKGA bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n+ 1 into parts greater than one. Some commentary about the history of partitions and compositions is provided
Let 1, 2, 3, 5, 8, … denote the Fibonacci sequence beginning with 1 and 2, and then setting each sub...
An n-color composition of n is a composition of n where a part k has k possible colors. It is known ...
Integer compositions, cyclic compositions, and lately k-compositions, are an important topic in comb...
A bijective proof is given for the following theorem: The number of compositions of n into parts con...
We study Fibonacci compositions, which are compositions of natural numbers that only use Fibonacci n...
The compositions, or ordered partitions, of integers, fall under certain natural classes. In this e...
I shall define the Partition and Composition of a positive integer n in this paper. We shall discuss...
AbstractA general formula for summation over weighted compositions is developed. From this a number ...
A composition of an integer n is a tuple of positive integers that sum up to n. Our study began with...
A composition of an integer n is a tuple of positive integers that sum up to n. Our study began with...
In this thesis I show the relation of binary and Gray Code to integer compositions and the Fibonacci...
The numbers A{m, k, s, r) = [Vw+1E*(ga? + r)JT_n, where V = 1- E"1, EJf(x) = f(x + j), u_x = ...
Two proofs, one using generating functions, the other bijective, are given for the following theorem...
Two proofs, one using generating functions, the other bijective, are given for the following theorem...
Combinatorial techniques can frequently provide satisfying “explanations” of various mathematical ph...
Let 1, 2, 3, 5, 8, … denote the Fibonacci sequence beginning with 1 and 2, and then setting each sub...
An n-color composition of n is a composition of n where a part k has k possible colors. It is known ...
Integer compositions, cyclic compositions, and lately k-compositions, are an important topic in comb...
A bijective proof is given for the following theorem: The number of compositions of n into parts con...
We study Fibonacci compositions, which are compositions of natural numbers that only use Fibonacci n...
The compositions, or ordered partitions, of integers, fall under certain natural classes. In this e...
I shall define the Partition and Composition of a positive integer n in this paper. We shall discuss...
AbstractA general formula for summation over weighted compositions is developed. From this a number ...
A composition of an integer n is a tuple of positive integers that sum up to n. Our study began with...
A composition of an integer n is a tuple of positive integers that sum up to n. Our study began with...
In this thesis I show the relation of binary and Gray Code to integer compositions and the Fibonacci...
The numbers A{m, k, s, r) = [Vw+1E*(ga? + r)JT_n, where V = 1- E"1, EJf(x) = f(x + j), u_x = ...
Two proofs, one using generating functions, the other bijective, are given for the following theorem...
Two proofs, one using generating functions, the other bijective, are given for the following theorem...
Combinatorial techniques can frequently provide satisfying “explanations” of various mathematical ph...
Let 1, 2, 3, 5, 8, … denote the Fibonacci sequence beginning with 1 and 2, and then setting each sub...
An n-color composition of n is a composition of n where a part k has k possible colors. It is known ...
Integer compositions, cyclic compositions, and lately k-compositions, are an important topic in comb...