Search arXivSearch

arXiv · 1611.01251

Ordered set partitions and the 0-Hecke algebra

Abstract

Let the symmetric group $\mathfrak{S}_n$ act on the polynomial ring $\mathbb{Q}[\mathbf{x}_n] = \mathbb{Q}[x_1, \dots, x_n]$ by variable permutation. The coinvariant algebra is the graded $\mathfrak{S}_n$-module $R_n := {\mathbb{Q}[\mathbf{x}_n]} / {I_n}$, where $I_n$ is the ideal in $\mathbb{Q}[\mathbf{x}_n]$ generated by invariant polynomials with vanishing constant term. Haglund, Rhoades, and Shimozono introduced a new quotient $R_{n,k}$ of the polynomial ring $\mathbb{Q}[\mathbf{x}_n]$ depending on two positive integers $k \leq n$ which reduces to the classical coinvariant algebra of the symmetric group $\mathfrak{S}_n$ when $k = n$. The quotient $R_{n,k}$ carries the structure of a graded $\mathfrak{S}_n$-module; Haglund et. al. determine its graded isomorphism type and relate it to the Delta Conjecture in the theory of Macdonald polynomials. We introduce and study a related quotient $S_{n,k}$ of $\mathbb{F}[\mathbf{x}_n]$ which carries a graded action of the 0-Hecke algebra $H_n(0)$, where $\mathbb{F}$ is an arbitrary field. We prove 0-Hecke analogs of the results of Haglund, Rhoades, and Shimozono. In the classical case $k = n$, we recover earlier results of Huang concerning the 0-Hecke action on the coinvariant algebra.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jia Huang, Brendon Rhoades. 2017-06-04. Ordered set partitions and the 0-Hecke algebra. https://arxiv.org/abs/1611.01251

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