Search arXivSearch

arXiv · math/0304070

Vanishing and non-vanishing criteria in Schubert calculus

Abstract

For any complex reductive connected Lie group G, many of the structure constants of the ordinary cohomology ring H^*(G/B; Z) vanish in the Schubert basis, and the rest are strictly positive. We present a combinatorial game, the ``root game'', which provides some criteria for determining which of the Schubert intersection numbers vanish. The definition of the root game is manifestly invariant under automorphisms of G, and under permutations of the classes intersected. Although these criteria are not proven to cover all cases, in practice they work very well, giving a complete answer to the question for G=SL(7,C). In a separate paper we show that one of these criteria is in fact necessary and sufficient when the classes are pulled back from a Grassmannian. More generally If G' -> G is an inclusion of complex reductive connected Lie groups, there is an induced map H^*(G/B) -> H^*(G'/B') on the cohomology of the homogeneous spaces. The image of a Schubert class under this map is a positive sum of Schubert classes on G'/B'. We investigate the problem of determining which Schubert classes appear with non-zero coefficient. This is the vanishing problem for branching Schubert calculus, which plays an important role in representation theory and symplectic geometry, as shown in [Berenstein-Sjamaar 2000]. The root game generalises to give a vanishing criterion and a non-vanishing criterion for this problem.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kevin Purbhoo. 2007-04-17. Vanishing and non-vanishing criteria in Schubert calculus. https://arxiv.org/abs/math/0304070

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO