Table of Contents
Fetching ...

Complete homogeneous symmetric polynomials with repeating variables

Luis Angel González-Serrano, Egor A. Maximenko

TL;DR

The paper addresses the problem of evaluating and expanding complete homogeneous polynomials with repeating variables $h_m(y^{[\varkappa]})$. It develops two equivalent expansion frameworks: one via a partial fraction decomposition yielding coefficients $A_{y,\varkappa,s,r}$ and another via the inverse of a confluent Vandermonde matrix yielding coefficients $B_{y,\varkappa,s,r}$. The main results express $h_m(y^{[\varkappa]})$ as sums over $s$ and $r$ of these coefficients times powers of $y_s$, with $m$-dependent binomial factors, and they connect these expansions to Schur polynomials with repeating variables. The work provides explicit combinatorial, determinant-based, and derivative-based methods, offering computational schemes and insights into the structure of repeated-variable symmetric polynomials, with potential applications to banded Toeplitz matrices and the theory of confluent Vandermonde inverses.

Abstract

We consider polynomials of the form $\operatorname{h}_m(y_1^{[\varkappa_1]},\ldots,y_n^{[\varkappa_n]})$, where $\operatorname{h}_m$ is the complete homogeneous polynomial of degree $m$ and $y_j^{[\varkappa_j]}$ denotes $y_j$ repeated $\varkappa_j$ times. Using the decomposition of the generating function into partial fractions we represent such polynomials in the form \[ \operatorname{h}_m(y_1^{[\varkappa_1]},\ldots,y_n^{[\varkappa_n]}) =\sum_{j=1}^n \sum_{r=1}^{\varkappa_j} \binom{r+m-1}{r-1} A_{y,\varkappa,j,r} y_j^m, \] where $A_{y,\varkappa,j,r}$ are some coefficients that do not depend on $m$. We also provide an alternative proof using the inverse of the confluent Vandermonde matrix.

Complete homogeneous symmetric polynomials with repeating variables

TL;DR

The paper addresses the problem of evaluating and expanding complete homogeneous polynomials with repeating variables . It develops two equivalent expansion frameworks: one via a partial fraction decomposition yielding coefficients and another via the inverse of a confluent Vandermonde matrix yielding coefficients . The main results express as sums over and of these coefficients times powers of , with -dependent binomial factors, and they connect these expansions to Schur polynomials with repeating variables. The work provides explicit combinatorial, determinant-based, and derivative-based methods, offering computational schemes and insights into the structure of repeated-variable symmetric polynomials, with potential applications to banded Toeplitz matrices and the theory of confluent Vandermonde inverses.

Abstract

We consider polynomials of the form , where is the complete homogeneous polynomial of degree and denotes repeated times. Using the decomposition of the generating function into partial fractions we represent such polynomials in the form \[ \operatorname{h}_m(y_1^{[\varkappa_1]},\ldots,y_n^{[\varkappa_n]}) =\sum_{j=1}^n \sum_{r=1}^{\varkappa_j} \binom{r+m-1}{r-1} A_{y,\varkappa,j,r} y_j^m, \] where are some coefficients that do not depend on . We also provide an alternative proof using the inverse of the confluent Vandermonde matrix.

Paper Structure

This paper contains 9 sections, 23 theorems, 128 equations.

Key Result

Proposition 2.6

Let $\varkappa\in\mathbb{N}^n$. Then $\gamma_\varkappa$ is the inverse function to $\rho_\varkappa$. Moreover, $\gamma_\varkappa$ is the enumeration of $Q_\varkappa$ in the lexicographic order.

Theorems & Definitions (65)

  • Example 2.1
  • Definition 2.2
  • Remark 2.3: consistency of the definitions of $\rho_\varkappa$ and $\gamma_\varkappa$
  • Example 2.4
  • Example 2.5
  • Proposition 2.6
  • Definition 2.7
  • Example 2.8
  • Remark 2.9: multivariate polynomials
  • Remark 2.10: the repetition homomorphism
  • ...and 55 more