In this paper we find closed form for the generating function of powers of any non-degenerate second-order recurrence sequence, completing a study begun by Carlitz and Riordan in 1962. Moreover, we generalize a theorem of Horadam on partial sums involving such sequences. Also, we find closed forms for weighted (by binomial coefficients) partial sums of powers of any non-degenerate second-order recurrence sequences. As corollaries we give some known and seemingly unknown identities and derive some very interesting congruence relations involving Fibonacci and Lucas sequences.
We give a simplified presentation of some results about recurrences of certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials.
Due to some results by John P. D Angelo and Dusty Grundmeier about CR- mappings the main results of my 2001 paper about recurrences for some sequences of binomial sums can be simplified.
Rotation symmetric Boolean functions are invariant under circular translation of indices. These functions have very rich cryptographic properties and have been used in different cryptosystems. Recently, Thomas Cusick proved that exponential sums of rotation symmetric Boolean functions satisfy homogeneous linear recurrences with integer coefficients. In this work, a generalization of this result is proved over any Galois field. That is, exponential sums over Galois fields of rotation symmetric polynomials satisfy linear recurrences with integer coefficients. In the particular case of $\mathbb{F…
Modifying an idea of E. Brietzke we give simple proofs for the recurrence relations of some sequences of binomial sums which have previously been obtained by other more complicated methods.
We consider certain modules of the symmetric groups whose basis elements are called tabloids. Some of these modules are isomorphic to subspaces of the cohomology rings of subvarieties of flag varieties as modules of the symmetric groups. We give a combinatorial description for some weighted sums of their characters, i.e., we introduce combinatorial objects called $(ρ,\Ll)$-tabloids and rewrite weighted sums of characters as the numbers of these combinatorial objects. We also consider the meaning of these combinatorial objects, i.e., we construct a correspondence between $(ρ,\Ll)$-tabloids and …
For the Stirling numbers of the second kind $S(n,k)$ and the ordered Bell numbers $B(n)$, we prove the identity $\sum_{k=1}^{n/2} S(n,2k)(2k-1)! = B(n-1)$. An analogous identity holds for the sum over odd $k$'s.
Usually creative telescoping is used to derive recurrences for sums. In this article we show that the non-existence of a creative telescoping solution, and more generally, of a parameterized telescoping solution, proves algebraic independence of certain types of sums. Combining this fact with summation-theory shows transcendence of whole classes of sums. Moreover, this result throws new light on the question why, e.g., Zeilberger's algorithm fails to find a recurrence with minimal order.
We describe the combinatorics that arise in summing a double recursion formula for the enumeration of connected Feynman graphs in quantum field theory. In one index the problem is more tractable and yields concise formulas which are combinatorially interesting on their own. In the other index, one of these sums is Sloane's sequence A001865.
For a fixed integer N, and fixed numbers b_1,...,b_N, we consider sequences, the nth term (a_n) of which is the sum of the squares of the terms in the expansion of (b_1 + ... + b_N)^n. In the case all b_i=1, we give a formula for a recurrence relation for the a_n. Otherwise we give an algorithm for finding a recurrence relation. As an application, we give the Picard-Fuchs equations for certain families of elliptic curves.
Let $S$ be a set of $n$ points in general position in the plane, and let $X_{k,\ell}(S)$ be the number of convex $k$-gons with vertices in $S$ that have exactly $\ell$ points of $S$ in their interior. We prove several equalities for the numbers $X_{k,\ell}(S)$. This problem is related to the Erdős-Szekeres theorem. Some of the obtained equations also extend known equations for the numbers of empty convex polygons to polygons with interior points. Analogous results for higher dimension are shown as well.
In this paper, we obtain formulas for the number of representations of positive integers as sums of arbitrarily many squares (and other polygonal numbers) with a certain natural weighting. The resulting weighted sums give Fourier coefficients of weight two quasimodular forms.
For any integer $q\geq 2$ we provide a formula to express indefinite sums of a sequence $(f(n))_{n\geq 0}$ weighted by $q$-periodic sequences in terms of indefinite sums of sequences $(f(qn+p))_{n\geq 0}$, where $p\in\{0,\ldots,q-1\}$. When explicit expressions for the latter sums are available, this formula immediately provides explicit expressions for the former sums. We also illustrate this formula through some examples.
Let $\mathcal{P}(Σ^*)$ be the semiring of languages, and consider its subset $\mathcal{P}(Σ)$. In this paper we define the language recognized by a weighted automaton over $\mathcal{P}(Σ)$ and a one-letter alphabet. Similarly, we introduce the notion of language recognition by linear recurrence equations with coefficients in $\mathcal{P}(Σ)$. As we will see, these two definitions coincide. We prove that the languages recognized by linear recurrence equations with coefficients in $\mathcal{P}(Σ)$ are precisely the regular languages, thus providing an alternative way to present these languages. …
Let $a$ and $b$ be relatively prime positive integers. In this paper the weighted sum $\sum_{n\in{\rm NR}(a,b)}λ^{n-1}n^m$ is given explicitly or in terms of the Apostol-Bernoulli numbers, where $m$ is a nonnegative integer, and ${\rm NR}(a,b)$ denotes the set of positive integers nonrepresentable in terms of $a$ and $b$.
In this paper, we describe a method to determine the power sum of the elements of the rows in the hyperbolic Pascal triangles corresponding to $\{4,q\}$ with $q\ge5$. The method is based on the theory of linear recurrences, and the results are demonstrated by evaluating the $k^{th}$ power sum in the range $2\le k\le 11$.
Let $a_1,a_2,\dots,a_k$ be positive integers with $\gcd(a_1,a_2,\dots,a_k)=1$. Frobenius number is the largest positive integer that is NOT representable in terms of $a_1,a_2,\dots,a_k$. When $k\ge 3$, there is no explicit formula in general, but some formulae may exist for special sequences $a_1,a_2,\dots,a_k$, including, those forming arithmetic progressions and their modifications. In this paper, we give formulae for the power and weighted sum of nonrepresentable positive integers. As applications, we show explicit expressions of these sums for $a_1,a_2,\dots,a_k$ forming arithmetic progres…
Let $a_1,a_2,\dots,a_k$ be positive integers with $\gcd(a_1,a_2,\dots,a_k)=1$. Let ${\rm NR}={\rm NR}(a_1,a_2,\dots,a_k)$ denote the set of positive integers nonrepresentable in terms of $a_1,a_2,\dots,a_k$. The largest nonrepresentable integer $\max{\rm NR}$, the number of nonrepresentable positive integers $\sum_{n\in{\rm NR}}1$ and the sum of nonrepresentable positive integers $\sum_{n\in{\rm NR}}n$ have been widely studied for a long time as related to the famous Frobenius problem. In this paper by using Eulerian numbers, we give formulas for the weighted sum $\sum_{n\in{\rm NR}}λ^{n}n^μ$,…
In this paper we study mixed sums of primes and linear recurrences. We show that if m=2(mod 4) and m+1 is a prime then $(m^{2^n-1}-1)/(m-1)\not=m^n+p^a$ for any n=3,4,... and prime power p^a. We also prove that if a>1 is an integer, u_0=0, u_1=1 and u_{i+1}=au_i+u_{i-1} for i=1,2,3,..., then all the sums u_m+au_n (m,n=1,2,3,...) are distinct. One of our conjectures states that any integer n>4 can be written as the sum of an odd prime, an odd Fibonacci number and a positive Fibonacci number.
Single scale quantities, as anomalous dimensions and hard scattering cross sections, in renormalizable Quantum Field Theories are found to obey difference equations of finite order in Mellin space. It is often easier to calculate fixed moments for these quantities compared to a direct attempt to derive them in terms of harmonic sums and their generalizations involving the Mellin parameter $N$. Starting from a sufficiently large number of given moments, we establish linear recurrence relations of lowest possible order with polynomial coefficients of usually high degree. Then these recurrence eq…
