Search arXivSearch

arXiv · 2101.03191

Toward permutation bases in the equivariant cohomology rings of regular semisimple Hessenberg varieties

Abstract

Recent work of Shareshian and Wachs, Brosnan and Chow, and Guay-Paquet connects the well-known Stanley-Stembridge conjecture in combinatorics to the dot action of the symmetric group $S_n$ on the cohomology rings $H^*(Hess(S,h))$ of regular semisimple Hessenberg varieties. In particular, in order to prove the Stanley-Stembridge conjecture, it suffices to construct (for any Hessenberg function $h$) a permutation basis of $H^*(Hess(S,h))$ whose elements have stabilizers isomorphic to Young subgroups. In this manuscript we give several results which contribute toward this goal. Specifically, in some special cases, we give a new, purely combinatorial construction of classes in the $T$-equivariant cohomology ring $H^*_T(Hess(S,h))$ which form permutation bases for subrepresentations in $H^*_T(Hess(S,h))$. Moreover, from the definition of our classes it follows that the stabilizers are isomorphic to Young subgroups. Our constructions use a presentation of the $T$-equivariant cohomology rings $H^*_T(Hess(S,h))$ due to Goresky, Kottwitz, and MacPherson. The constructions presented in this manuscript generalize past work of Abe-Horiguchi-Masuda, Chow, and Cho-Hong-Lee.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Megumi Harada, Martha Precup, Julianna Tymoczko. 2022-02-20. Toward permutation bases in the equivariant cohomology rings of regular semisimple Hessenberg varieties. https://doi.org/10.1007/s44007-021-00016-5

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