Recurrence Relations for Wronskian Hermite Polynomials
Niels Bonneux, Marco Stevens

TL;DR
This paper introduces a recurrence relation for Wronskian Hermite polynomials, generalizing the classical Hermite recurrence, and connects these polynomials to combinatorial structures like Young tableaux, simplifying their analysis.
Contribution
It derives a new recurrence relation for Wronskian Hermite polynomials, linking them to partitions and Young tableaux, and simplifies existing results in the literature.
Findings
Derived a recurrence relation for Wronskian Hermite polynomials.
Connected polynomial coefficients to standard Young tableaux counts.
Simplified analysis of these polynomials and related results.
Abstract
We consider polynomials that are defined as Wronskians of certain sets of Hermite polynomials. Our main result is a recurrence relation for these polynomials in terms of those of one or two degrees smaller, which generalizes the well-known three term recurrence relation for Hermite polynomials. The polynomials are defined using partitions of natural numbers, and the coefficients in the recurrence relation can be expressed in terms of the number of standard Young tableaux of these partitions. Using the recurrence relation, we provide another recurrence relation and show that the average of the considered polynomials with respect to the Plancherel measure is very simple. Furthermore, we show that some existing results in the literature are easy corollaries of the recurrence relation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
