Page 1

Displaying 1 – 16 of 16

Showing per page

Single polynomials that correspond to pairs of cyclotomic polynomials with interlacing zeros

James McKee, Chris Smyth (2013)

Open Mathematics

We give a complete classification of all pairs of cyclotomic polynomials whose zeros interlace on the unit circle, making explicit a result essentially contained in work of Beukers and Heckman. We show that each such pair corresponds to a single polynomial from a certain special class of integer polynomials, the 2-reciprocal discbionic polynomials. We also show that each such pair also corresponds (in four different ways) to a single Pisot polynomial from a certain restricted class, the cyclogenic...

Solution des problèmes de Favard

Michel Langevin (1988)

Annales de l'institut Fourier

Pour tout c < 2 , on calcule un rang D ( c ) tel que tout entier algébrique x de degré au moins D ( c ) ait deux conjugués x ' , x ' ' vérifiant | x ' - x ' ' | c . De plus, on donne une nouvelle preuve de l’égalité D ( 3 ) = 2 .

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 1 – 16 of 16

Page 1