Search arXivSearch

arXiv · 2306.15300

On a particular specialization of monomial symmetric functions

Abstract

Let $m_{λ}$ be the monomial symmetric functions, $ λ$ being an integer partition of $n\in \mathbb{N}^{\ast }$. For the specialization corresponding to the $q$-deformation of the exponential, we prove that each $m_{λ}$ is associated with a polynomial $J_{λ}\left( q\right) $ whose coefficients belong to $\mathbb{Z}$. $J_{λ}$ is a generalization of the case $λ=\left( n\right) $ for which $ J_{\left( n\right) }=J_{n}$ is the enumerator of tree inversions. Some relations between $J_{λ}$ and $J_{n}^{\left( r\right) }$ are obtained, these $J_{n}^{\left( r\right) }$ having been defined algebraically in a previous work of the author for $n\geq r\geq 1$ and being classically combinatorial enumerators with $J_{n}^{\left( 1\right) }=J_{n}$. From the calculation by induction of $J_{λ}$ for $n\leq 6$, we conjecture that the coefficients of each $J_{λ}$ are strictly positive and log-concave. As a consequence of Huh's Theorem on the $h$-vector of matroid complex it is shown that the coefficients of $J_{n}^{\left( r\right) }$ are strictly positive and log-concave, which gives a second argument in favor of these conjectures. It is also proven that the last $n-1$ coefficients of $ J_{λ}$ are proportional to the first coefficients of column $n-r-1$ of Pascal's triangle, $r$ being the length of $λ$. This is a third argument to state the conjectures. The calculation of $J_{\left( 3,2,1\right) }$ shows the existence of an obstacle, if one wants to prove the conjectures by application of Huh's theorem cited above.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vincent Brugidou. 2025-06-04. On a particular specialization of monomial symmetric functions. https://arxiv.org/abs/2306.15300

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO