SearcharxivSearch

arXiv · 2311.13604

On the numerology of trigonometric polynomials

Abstract

This note is about the observation that the various transition formulas between bases of trigonometric polynomials can be expressed in terms binomial coefficients. More specifically, we write the entries of the Chebyshev matrices $ T$ and $ U$ in terms of binomial coefficients. We remark that the inverses of certain submatrices of the Chebyshev matrix $ T$ correspond to classical power reduction formulas for trigonometric functions. Therefore the entries of $ T^{-1}$ are expressible in terms of binomial coefficients and powers of two. The inverses of certain submatrices of the Chebyshev matrix $ U$ appear in power reduction formulas involving the Catalan triangles. We could not spot them in the literature. As a corollary the Catalan triangles are interpreted as inverses of rather natural matrices of binomial coefficients. We explain the matrix inversions in terms of Riordan arrays. We solve the integral $ \int _{0}^{2\pi }\cos^{2m}( x)\sin^{2n}( x) dx$ and deduce a hypergeometric identity from the Fourier expansion of $\cos^{2m}(x)$ and $ \sin^{2n}( x)$. As a corollary we prove that super Catalan numbers are integers. We emphasize that from the point of view of these base changes between the trigonometric polynomials it is more natural to work with $2\cos(x)$ and $2\sin(x)$ instead of $\cos(x)$ and $\sin(x)$, since the transition matrices become invertible over the integers. We do a similar analysis for the spread polynomials. This enables us to make a conjecture of Goh and Wildberger more precise. In this exposition we give a mostly self-contained account of the matter, the prerequisites just being four semesters of calculus, linear algebra, elementary complex variables and the residue theorem.

Explore related subjects

Keep this discovery

BibTeXRIS

Hans-Christian Herbig, Mateus de Jesus Gonçalves. 2023-11-19. On the numerology of trigonometric polynomials. https://arxiv.org/abs/2311.13604

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

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO