The complementary symmetric functions: Connection constants using negative sets
Let \(f(x)\) be a rational function in \(x\) of degree \(n\). As the main result of this paper, the coefficients \(c_{k}\) in the expansion \[ f(x)=\sum _{k\geq 0} ^{}c_{k}q_{n-k}(x), \quad\text{where}\quad q_i(x)=\prod _{j=1} ^{i}(x-b_j), \] and where the product has to be read as \(1/\prod _{j=1+i} ^{0}(x-b_j)\) for negative \(i\), are expressed in what are otherwise known as supersymmetric analogues of elementary symmetric functions (in \(\lambda\)-ring language, these are elementary symmetric functions in a difference of two alphabets). In several examples it is shown that special cases yield (if though well-known) identities for Stirling numbers, Lah numbers, and \(q\)-binomial coefficients.
- A generalization of the Stirling numbers
- Décompositions dans l'algèbre des différences divisées. (Decompositions in the algebra of divided differences)
- scientific article; zbMATH DE number 3781427 (Why is no real title available?)
- Inversion Properties of Triangular Arrays of Numbers
- On the Connection Constants
- Sequences of Symmetric Functions of Binomial Type
- Sets with a negative number of elements
- Tiling Bricks with Bricks
- Whitney numbers of some geometric lattices
This page was built for publication: The complementary symmetric functions: Connection constants using negative sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1267984)
