Search arXivSearch

arXiv · 2401.17687

q-power symmetric functions and q-exponential formula

Abstract

Let $λ=\left( λ_{1},λ_{2},...,λ_{r}\right) $ be an integer partition, and $\left[p_{λ}\right] $ the $q$-analog of the symmetric power function $%p_{λ}$. This $q$-analogue has been defined as a special case, in the author's previous article: "A $q$-analog of certain symmetric functions and one of its specializations". Here, we prove that a large part of the classical relations between $p_{λ}$, on one hand, and the elementary and complete symmetric functions $e_{n}$ and $h_{n}$, on the other hand, have $q$-analogues with $\left[ p_{λ}\right] $. In particular, the generating functions $E\left( t\right) =\sum\nolimits_{n\geq 0}e_{n}t^{n}$ and $H\left( t\right) =\sum\nolimits_{n\geq 0}h_{n}t^{n}$ are expressed in terms of $\left[ p_{n}\right] $, using Gessel's $q$-exponential formula and a variant of it. A factorization of these generating functions into infinite $q$-products, which has no classical counterpart, is established. By specializing these results, we show that the $q$-binomial theorem is a special case of these infinite $q$-products. We also obtain new formulas for the tree inversions enumerators and for certain $q$-orthogonal polynomials, detailing the case of dicrete $q$-Hermite polynomials.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vincent Brugidou. 2024-09-13. q-power symmetric functions and q-exponential formula. https://arxiv.org/abs/2401.17687

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO