Connection between ordinary multinomials, Fibonacci numbers, Bell polynomials and discrete uniform distribution.
We continue the investigation of convolutions of second order linear recursive sequences (see the first part in [1]). In this paper, we focus on the case when the characteristic polynomials of the sequences have common root.
Previous work on counting maximal independent sets for paths and certain 2-dimensional grids is extended in two directions: 3-dimensional grid graphs are included and, for some/any ℓ ∈ N, maximal distance-ℓ independent (or simply: maximal ℓ-independent) sets are counted for some grids. The transfer matrix method has been adapted and successfully applied
In this paper we find certain equivalent formulations of Wall's question and derive two interesting criteria that can be used to resolve this question for particular primes.