Search arXivSearch

arXiv · 1410.7419

Cohomology classes of interval positroid varieties and a conjecture of Liu

Abstract

To each finite subset of $\mathbb{Z}^2$ (a diagram), one can associate a subvariety of a complex Grassmannian (a diagram variety), and a representation of a symmetric group (a Specht module). Liu has conjectured that the cohomology class of a diagram variety is represented by the Frobenius characteristic of the corresponding Specht module. We give a counterexample to this conjecture. However, we show that for the diagram variety of a permutation diagram, Liu's conjectured cohomology class $σ$ is at least an upper bound on the actual class $τ$, in the sense that $σ- τ$ is a nonnegative linear combination of Schubert classes. To do this, we exhibit the appropriate diagram variety as a component in a degeneration of one of Knutson's interval positroid varieties (up to Grassmann duality). A priori, the cohomology classes of these interval positroid varieties are represented by affine Stanley symmetric functions. We give a different formula for these classes as ordinary Stanley symmetric functions, one with the advantage of being Schur-positive and compatible with inclusions between Grassmannians.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Brendan Pawlowski. 2018-07-24. Cohomology classes of interval positroid varieties and a conjecture of Liu. https://arxiv.org/abs/1410.7419

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