Table of Contents
Fetching ...

Bivariate multiple orthogonal polynomials of mixed type on the step-line

Manuel Mañas, Miguel Rojas, Jianwen Wu

TL;DR

This work develops a comprehensive framework for mixed-type, bivariate multiple orthogonal polynomials along the step-line through Gauss–Borel LU factorization of a carefully structured moment matrix. It introduces monomial matrices, graded lexicographic ordering, and shift operators to define biorthogonal polynomial families and their orthogonality relations, then derives recurrence relations and Christoffel–Darboux-type kernels with an ABC-type theorem in this setting. The approach is illustrated via a detailed bivariate Jacobi–Piñeiro example on the triangle, implemented with Maple, highlighting explicit polynomials and biorthogonality proofs. By connecting moment-factorization structures to spectral-like recurrences and integral kernels, the paper advances multivariate mixed-type orthogonality and its potential links to quadrature, integrable systems, and numerical analysis.

Abstract

This article studies bivariate multiple orthogonal polynomials of the mixed type on the step-line. The analysis is based on the LU factorization of a moment matrix specifically adapted to this framework. The orthogonality and biorthogonality relations satisfied by these polynomials are identified, and their precise multi-degrees are determined. The corresponding recurrence relations and the growing band matrices that encode them are also derived. Christoffel-Darboux kernels and the associated Christoffel-Darboux-type formulas are obtained. An ABC-type theorem is established, relating the inverse of the truncated moment matrix to these kernels. As an illustration, the bivariate Jacobi-Piñeiro multiple orthogonal polynomials of mixed type on the triangle are computed by means of an LU factorization implemented in a dedicated Maple script.

Bivariate multiple orthogonal polynomials of mixed type on the step-line

TL;DR

This work develops a comprehensive framework for mixed-type, bivariate multiple orthogonal polynomials along the step-line through Gauss–Borel LU factorization of a carefully structured moment matrix. It introduces monomial matrices, graded lexicographic ordering, and shift operators to define biorthogonal polynomial families and their orthogonality relations, then derives recurrence relations and Christoffel–Darboux-type kernels with an ABC-type theorem in this setting. The approach is illustrated via a detailed bivariate Jacobi–Piñeiro example on the triangle, implemented with Maple, highlighting explicit polynomials and biorthogonality proofs. By connecting moment-factorization structures to spectral-like recurrences and integral kernels, the paper advances multivariate mixed-type orthogonality and its potential links to quadrature, integrable systems, and numerical analysis.

Abstract

This article studies bivariate multiple orthogonal polynomials of the mixed type on the step-line. The analysis is based on the LU factorization of a moment matrix specifically adapted to this framework. The orthogonality and biorthogonality relations satisfied by these polynomials are identified, and their precise multi-degrees are determined. The corresponding recurrence relations and the growing band matrices that encode them are also derived. Christoffel-Darboux kernels and the associated Christoffel-Darboux-type formulas are obtained. An ABC-type theorem is established, relating the inverse of the truncated moment matrix to these kernels. As an illustration, the bivariate Jacobi-Piñeiro multiple orthogonal polynomials of mixed type on the triangle are computed by means of an LU factorization implemented in a dedicated Maple script.

Paper Structure

This paper contains 6 sections, 28 theorems, 126 equations.

Key Result

Proposition 2.6

The graded lexicographical sequence $s$ defines a bijection between $\mathbb{N}_0$ and the pairs $(i,j)$ with $i \in \mathbb{N}_0$ and $0 \leq j \leq i$. For a given pair $(i,j)$, its position $I\in\mathbb{N}_0$ in the sequence is given by: Conversely, for a given position $I\in \mathbb{N}_0$, the corresponding pair $(i,j)\in s$ in the lexicographical sequence is determined by:

Theorems & Definitions (67)

  • Definition 2.1
  • Definition 2.2
  • Remark 2.3
  • Definition 2.4
  • Definition 2.5
  • Proposition 2.6
  • Definition 2.7
  • Proposition 2.8
  • Definition 2.9
  • Definition 2.10
  • ...and 57 more