Signs behaviour of sums of weighted numbers of partitions
Abstract
Let A be a subset of positive integers. By A-partition of n we understand the representation of n as a sum of elements from the set A. For given i, n∈, by cA(i,n) we denote the number of A-partitions of n with exactly i parts. In the paper we obtain several result concerning sign behaviour of the sequence SA,k(n)=Σi=0n(-1)iikcA(i,n), where k∈ is fixed. In particular, we prove that for a broad class A of subsets of + we have that for each A∈ A we have (-1)nSA,k(n)≥ 0 for each n, k∈.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.