Polynomial sequences related to Chebyshev polynomials and the minimal polynomial of 2 (2π /n)

Abstract

In this paper we consider the minimal polynomial n(x) of 2 (2π /n). We introduce some polynomial sequences with the same recurrence relation as the rescaled Chebyshev polynomials tn(x)=2\, Tn(x/2) of the first kind, which turn out to be related to those of various kinds, all coming from those of the second kind. We see that tn(x) 2=2(Tn(x/2) 1) are divisible by the square of either of these polynomials. Then by appropriately removing unnecessary factors from these polynomials, we can easily calculate n(x) without recursion, which improves Barnes' result in 1977. As an appendix, we give a compact table of the minimal polynomials n(x) of 2 (2π /n) for n≤slant 120.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…