arXiv subjects

Sara Billey

Publications and source records attributed to Sara Billey.

22 records · Page 2Linked to original sources

arXiv2005

Intersections of Schubert varieties and other permutation array schemes

Using a blend of combinatorics and geometry, we give an algorithm for algebraically finding all flags in any zero-dimensional intersection of Schubert varieties with respect to three transverse flags, and more generally, any number of flags. In particular, the number of flags in a triple intersection is also a structure constant for the cohomology ring of the flag manifold. Our algorithm is based on solving a limited number of determinantal equations for each intersection (far fewer than the naive approach). These equations may be used to compute Galois and monodromy groups of intersections of Schubert varieties. We are able to limit the number of equations by using the permutation arrays of Eriksson and Linusson, and their permutation array varieties, introduced as generalizations of Schubert varieties. We show that there exists a unique permutation array corresponding to each realizable Schubert problem and give a simple recurrence to compute the corresponding rank table, giving in particular a simple criterion for a Littlewood-Richardson coefficient to be 0. We describe pathologies of Eriksson and Linusson's permutation array varieties (failure of existence, irreducibility, equidimensionality, and reducedness of equations), and define the more natural permutation array schemes. In particular, we give several counterexamples to the Realizability Conjecture based on classical projective geometry. Finally, we give examples where Galois/monodromy groups experimentally appear to be smaller than expected.

math.AG↗

arXiv2004

Smoothness of Schubert varieties via patterns in root systems

The aim of this article is to present a smoothness criterion for Schubert varieties in generalized flag manifolds $G/B$ in terms of patterns in root systems. We generalize Lakshmibai-Sandhya's well-known result that says that a Schubert variety in $SL(n)/B$ is smooth if and only if the corresponding permutation avoids the patterns 3412 and 4231. Our criterion is formulated uniformly in general Lie theoretic terms. We define a notion of pattern in Weyl group elements and show that a Schubert variety is smooth (or rationally smooth) if and only if the corresponding element of the Weyl group avoids a certain finite list of patterns. These forbidden patterns live only in root subsystems with star-shaped Dynkin diagrams. In the simply-laced case the list of forbidden patterns is especially simple: besides two patterns of type $A_3$ that appear in Lakshmibai-Sandhya's criterion we only need one additional forbidden pattern of type $D_4$. Remarkably, several other important classes of elements in Weyl groups can also be described in terms of forbidden patterns. For example, the fully commutative elements in Weyl groups have such a characterization. In order to prove our criterion we used several known results for the classical types. For the exceptional types, our proof is based on computer verifications. In order to conduct such a verification for the computationally challenging type $E_8$, we derived several general results on Poincaré polynomials of cohomology rings of Schubert varieties based on parabolic decomposition, which have an independent interest.

math.CO↗

arXiv2003

Lower bounds for Kazhdan-Lusztig polynomials from patterns

We give a lower bound for the value at q=1 of a Kazhdan-Lustig polynomial in a Weyl group W in terms of "patterns''. This is expressed by a "pattern map" from W to W' for any parabloic subgroup W'. This notion generalizes the concept of patterns and pattern avoidance for permutations to all Weyl groups. The main tool of the proof is a "hyperbolic localization" on intersection cohomology; see the related paper http://front.math.ucdavis.edu/math.AG/0202251

math.RT↗

arXiv2003

A vector partition function for the multiplicities of sl_k(C)

We use Gelfand-Tsetlin diagrams to write down the weight multiplicity function for the Lie algebra sl_k(C) (type A_{k-1}) as a single partition function. This allows us to apply known results about partition functions to derive interesting properties of the weight diagrams. We relate this description to that of the Duistermaat-Heckman measure from symplectic geometry, which gives a large-scale limit way to look at multiplicity diagrams. We also provide an explanation for why the weight polynomials in the boundary regions of the weight diagrams exhibit a number of linear factors. Using symplectic geometry, we prove that the partition of the permutahedron into domains of polynomiality of the Duistermaat-Heckman function is the same as that for the weight multiplicity function, and give an elementary proof of this for sl_4(C) (A_3).

math.CO↗