Pairs of intertwined integer sequences

Abstract

In previous work we computed the number Cn(q) of ideals of codimension n of the algebra Fq[x,y,x-1, y-1] of two-variable Laurent polynomials over a finite field: it turned out that Cn(q) is a palindromic polynomial of degree 2n in q, divisible by (q-1)2. The quotient Pn(q) = Cn(q)/(q-1)2 is a palindromic polynomial of degree 2n-2. For each n≥ 1 let Pn(X) ∈ Z[X] be the degree n-1 polynomial such that Pn(q+q-1) = Pn(q)/qn-1. In this note we show that for any integer N the integer value Pn(N) is close to the value at N of the degree n-1 polynomial Fn-1(X) = 1 + Σk=1n-1 \, Tk(X), which is a sum of monic versions Tk(X) of Chebyshev polynomials of the first kind. We give a precise formula for Pn(X) as a linear combination of Fk(X)'s, each appearance of the latter being parametrized by an odd divisor of n. As a consequence, Pn(X) = Fn-1(X) if and only if n is a power of 2. We exhibit similar formulas for Cn(q).

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…