Search arXivSearch

arXiv · 2503.04950

Monomial stability of Frobenius images

Abstract

We study representation stability in the sense of Church, Ellenberg, and Farb \cite{FI-module} through the lens of symmetric function theory and the different symmetric function bases. We show that a sequence, $(F_n)_n$, where $F_n$ is a homogeneous symmetric function of degree $n$, has stabilizing Schur coefficients if and only if it has stabilizing monomial coefficients. More generally, we develop a framework for checking when stabilizing coefficients transfer from one symmetric function basis to another. We also see how one may compute representation stable ranges from the monomial expansions of the $F_n$.\parspace As applications, we reprove and refine the representation stability of diagonal coinvariant algebras, $DR_n$. We also observe new representation stability phenomena of the Garsia-Haiman modules. This establishes certain stability properties of the modified Macdonald polynomials, $\tilde{H}_{μ^{(n)}}[X;q,t]$ and the modified $q,t$-Kostka numbers, $\tilde{K}_{μ^{(n)},ν[n]}(q,t)$, for arbitrary sequences of partitions with $μ^{(n)}\vdash n$ and $μ^{(n)}\subseteq μ^{(n+1)}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nikita Borisov. 2025-05-26. Monomial stability of Frobenius images. https://arxiv.org/abs/2503.04950

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