Displaying 161 – 180 of 291

Showing per page

Sums of Powered Characteristic Roots Count Distance-Independent Circular Sets

Zdzisław Skupień (2013)

Discussiones Mathematicae Graph Theory

Significant values of a combinatorial count need not fit the recurrence for the count. Consequently, initial values of the count can much outnumber those for the recurrence. So is the case of the count, Gl(n), of distance-l independent sets on the cycle Cn, studied by Comtet for l ≥ 0 and n ≥ 1 [sic]. We prove that values of Gl(n) are nth power sums of the characteristic roots of the corresponding recurrence unless 2 ≤ n ≤ l. Lucas numbers L(n) are thus generalized since L(n) is the count in question...

Currently displaying 161 – 180 of 291