Search arXivSearch

arXiv · math/9901016

Positivity for special cases of $(q,t)$-Kostka coefficients and standard tableaux statistics

Abstract

We present two symmetric function operators $H_3^{qt}$ and $H_4^{qt}$ that have the property $H_{3}^{qt} H_{(2^a1^b)}[X;q,t] = H_{(32^a1^b)}[X;q,t]$ and $H_4^{qt} H_{(2^a1^b)}[X;q,t] = H_{(42^a1^b)}[X;q,t]$. These operators are generalizations of the analogous operator $H_2^{qt}$ and also have expressions in terms of Hall-Littlewood vertex operators. We also discuss statistics, $a_μ(T)$ and $b_μ(T)$, on standard tableaux such that the $q,t$ Kostka polynomials are given by the sum over standard tableaux of shape $\la$, $K_{\laμ}(q,t) = \sum_T t^{a_μ(T)} q^{b_μ(T)}$ for the case when when $μ$ is two columns or of the form $(32^a1^b)$ or $(42^a1^b)$. This provides proof of the positivity of the $(q,t)$-Kostka coefficients in the previously unknown cases of $K_{\la (32^a1^b)}(q,t)$ and $K_{\la (42^a1^b)}(q,t)$. The vertex operator formulas are used to give formulas for generating functions for classes of standard tableaux that generalize the case when $μ$ is two columns.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mike Zabrocki. 1999-08-10. Positivity for special cases of $(q,t)$-Kostka coefficients and standard tableaux statistics. https://arxiv.org/abs/math/9901016

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