Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1308.6536

Root-theoretic Young diagrams and Schubert calculus: planarity and the adjoint varieties

Dominic Searles·Alexander Yong
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study root-theoretic Young diagrams to investigate the existence of a Lie-type uniform and nonnegative combinatorial rule for Schubert calculus. We provide formulas for (co)adjoint varieties of classical Lie type. This is a simplest case after the (co)minuscule family (where a rule has been proved by H.Thomas and the second author using work of R.Proctor). Our results build on earlier Pieri-type rules of P.Pragacz-J.Ratajski and of A.Buch-A.Kresch-H.Tamvakis. Specifically, our formula for OG(2,2n) is the first complete rule for a case where diagrams are non-planar. Yet the formulas possess both uniform and non-uniform features. Using these classical type rules, as well as results of P.-E.Chaput-N.Perrin in the exceptional types, we suggest a connection between polytopality of the set of nonzero Schubert structure constants and planarity of the diagrams. This is an addition to work of A.Klyachko and A.Knutson-T.Tao on the Grassmannian and of K.Purbhoo-F.Sottile on cominuscule varieties, where the diagrams are always planar.

Explore related subjects

math.COmath.AGmath.RT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dominic Searles, Alexander Yong. 2013-08-29. Root-theoretic Young diagrams and Schubert calculus: planarity and the adjoint varieties. https://arxiv.org/abs/1308.6536

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗