A q-analog of certain symmetric functions and one of its specializations
Vincent Brugidou

TL;DR
This paper introduces a $q$-analog of certain symmetric functions related to partitions, explores its properties, and connects it to classical combinatorial polynomials like tree inversions and parking functions, providing new formulas and recurrences.
Contribution
It presents a novel $q$-analog of symmetric functions $p_{n}^{(r)}$, links it to $q$-Stirling numbers, and derives new recurrence relations and representations for related combinatorial polynomials.
Findings
Defined a $q$-analog of $p_{n}^{(r)}$ with key properties.
Connected the $q$-analog to classical combinatorial polynomials.
Derived new recurrence relations and explicit formulas for $J_{n}^{(r)}$ and their reciprocals.
Abstract
Let the symmetric functions be defined for the pair of integers , , by where are the monomial symmetric functions, the sum being over the partitions of the integer with length . We introduce by a generating function, a -analog of and give some of its properties. This -analog is related to its the classical form using the -Stirling numbers. We also start with the same procedure the study of a -analog of . By specialization of this -analog in the series , we recover in a purely formal waya class of polynomials historically introduced as combinatorial enumerators, in particular of tree inversions. This also results in a…
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.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Identities · Bayesian Methods and Mixture Models
