The Fibonacci number of a grid graph and a new class of integer sequences.
When is an Incomplete 3 × n Latin Rectangle Completable?
We use the concept of an availability matrix, introduced in Euler [7], to describe the family of all minimal incomplete 3 × n latin rectangles that are not completable. We also present a complete description of minimal incomplete such latin squares of order 4.
Counting Maximal Distance-Independent Sets in Grid Graphs
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
On a binary recurrent sequence of polynomials
In this paper, we study the properties of the sequence of polynomials given by , for , where is non-constant and the characteristic of is . This complements some results from R. Euler, L.H. Gallardo: On explicit formulae and linear recurrent sequences, Acta Math. Univ. Comenianae, 80 (2011) 213-219.
Page 1