Search arXivSearch

arXiv · 1910.10990

Derivations and identities for Chebyshev polynomials of the first and second kinds

Abstract

In this paper we follow the general approach, proposed earlier by the first author, which is derived from the invariant theory field and provides a way of obtaining of the polynomial identities for any arbitrary polynomial family. We introduce the notion of Chebyshev derivations of the first and second kinds, which is based on the polynomial algebra, and corresponding specific differential operators. We derive the elements of their kernels and prove that any element of the kernel of the derivations defines a polynomial identity satisfied by the Chebyshev polynomials of the first and second kinds. Combining elementary methods and combinatorial techniques, we obtain several new polynomial identities involving the Chebyshev polynomials of the both kinds and a special case of the Jacobi polynomials. Using the properties of the generalised hypergeometric function, we specify the Chebyshev polynomials of the first and second kinds via the generalised hypergeometric function and, as a consequence, derive the corresponding identities involving the generalised hypergeometric function and the Chebyshev polynomials of the first and second kinds.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Leonid Bedratyuk, Nataliia Luno. 2019-10-24. Derivations and identities for Chebyshev polynomials of the first and second kinds. https://arxiv.org/abs/1910.10990

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO