arXiv subjects

Alexander Yong

Publications and source records attributed to Alexander Yong.

At least 73 records · Page 4Linked to original sources

arXiv2010

The direct sum map on Grassmannians and jeu de taquin for increasing tableaux

The direct sum map Gr(a,n) x Gr(b,m) -> Gr(a+b,m+n) on Grassmannians induces a K-theory pullback that defines the splitting coefficients. We geometrically explain an identity from [Buch '02] between the splitting coefficients and the Schubert structure constants for products of Schubert structure sheaves. This is related to the topic of product and splitting coefficients for Schubert boundary ideal sheaves. Our main results extend jeu de taquin for increasing tableaux [Thomas-Yong '09] by proving transparent analogues of [Schützenberger '77]'s fundamental theorems on well-definedness of rectification. We then establish that jeu de taquin gives rules for each of these four kinds of coefficients.

math.CO↗

arXiv2010

Some degenerations of Kazhdan-Lusztig ideals and multiplicities of Schubert varieties

We study Hilbert-Samuel multiplicity for points of Schubert varieties in the complete flag variety, by Groebner degenerations of the Kazhdan-Lusztig ideal. In the covexillary case, we give a positive combinatorial rule for multiplicity by establishing (with a Groebner basis) a reduced and equidimensional limit whose Stanley-Reisner simplicial complex is homeomorphic to a shellable ball or sphere. We show that multiplicity counts the number of facets of this complex. We also obtain a formula for the Hilbert series of the local ring. In particular, our work gives a multiplicity rule for Grassmannian Schubert varieties, providing alternative statements and proofs to formulae of [Lakshmibai-Weyman '90], [Rosenthal-Zelevinsky '01], [Krattenthaler '01], [Kreiman-Lakshmibai '04] and [Woo-Yong '09]. We suggest extensions of our methodology to the general case.

math.AG↗

arXiv2009

Presenting the cohomology of a Schubert variety

We extend the short presentation due to [Borel '53] of the cohomology ring of a generalized flag manifold to a relatively short presentation of the cohomology of any of its Schubert varieties. Our result is stated in a root-system uniform manner by introducing the essential set of a Coxeter group element, generalizing and giving a new characterization of [Fulton '92]'s definition for permutations. Further refinements are obtained in type A.

math.CO↗

arXiv2008

Longest increasing subsequences, Plancherel-type measure and the Hecke insertion algorithm

We define and study the Plancherel-Hecke probability measure on Young diagrams; the Hecke algorithm of [Buch-Kresch-Shimozono-Tamvakis-Yong '06] is interpreted as a polynomial-time exact sampling algorithm for this measure. Using the results of [Thomas-Yong '07] on jeu de taquin for increasing tableaux, a symmetry property of the Hecke algorithm is proved, in terms of longest strictly increasing/decreasing subsequences of words. This parallels classical theorems of [Schensted '61] and of [Knuth '70], respectively, on the Schensted and Robinson-Schensted-Knuth algorithms. We investigate, and conjecture about, the limit typical shape of the measure, in analogy with work of [Vershik-Kerov '77], [Logan-Shepp '77] and others on the ``longest increasing subsequence problem'' for permutations. We also include a related extension of [Aldous-Diaconis '99] on patience sorting. Together, these results provide a new rationale for the study of increasing tableau combinatorics, distinct from the original algebraic-geometric ones concerning K-theoretic Schubert calculus.

math.CO↗

arXiv2008

An approximation algorithm for counting contingency tables

We present a randomized approximation algorithm for counting contingency tables, mxn non-negative integer matrices with given row sums R=(r_1, ..., r_m) and column sums C=(c_1, ..., c_n). We define smooth margins (R,C) in terms of the typical table and prove that for such margins the algorithm has quasi-polynomial N^{O(ln N)} complexity, where N=r_1+...+r_m=c_1+...+c_n. Various classes of margins are smooth, e.g., when m=O(n), n=O(m) and the ratios between the largest and the smallest row sums as well as between the largest and the smallest column sums are strictly smaller than the golden ratio (1+sqrt{5})/2 = 1.618. The algorithm builds on Monte Carlo integration and sampling algorithms for log-concave densities, the matrix scaling algorithm, the permanent approximation algorithm, and an integral representation for the number of contingency tables.

math.CO↗

arXiv2007

A jeu de taquin theory for increasing tableaux, with applications to K-theoretic Schubert calculus

We introduce a theory of jeu de taquin for increasing tableaux, extending fundamental work of [Schützenberger '77] for standard Young tableaux. We apply this to give a new combinatorial rule for the K-theory Schubert calculus of Grassmannians via K-theoretic jeu de taquin, providing an alternative to the rules of [Buch '02] and others. This rule naturally generalizes to give a conjectural root-system uniform rule for any minuscule flag variety G/P, extending [Thomas-Yong '06]. We also present analogues of results of Fomin, Haiman, Schensted and Schützenberger.

math.CO↗

arXiv2007

Multiplicity-free Schubert calculus

We give a nonrecursive, combinatorial characterization of multiplicity-free products of Grassmannian Schubert classes. This answers a question of W. Fulton and extends results of J. Stembridge.

math.CO↗

arXiv2007

An S_3-symmetric Littlewood-Richardson rule

The classical Littlewood-Richardson coefficients C(lambda,mu,nu) carry a natural $S_3$ symmetry via permutation of the indices. Our "carton rule" for computing these numbers transparently and uniformly explains these six symmetries; previously formulated Littlewood-Richardson rules manifest at most three of the six.

math.CO↗

arXiv2007

Counting magic squares in quasi-polynomial time

We present a randomized algorithm, which, given positive integers n and t and a real number 0< epsilon <1, computes the number Sigma(n, t) of n x n non-negative integer matrices (magic squares) with the row and column sums equal to t within relative error epsilon. The computational complexity of the algorithm is polynomial in 1/epsilon and quasi-polynomial in N=nt, that is, of the order N^{log N}. A simplified version of the algorithm works in time polynomial in 1/epsilon and N and estimates Sigma(n,t) within a factor of N^{log N}. This simplified version has been implemented. We present results of the implementation, state some conjectures, and discuss possible generalizations.

math.CO↗

arXiv2006

What is a Young tableau?

Young tableaux are classical combinatorial objects playing recurring and varied roles in representation theory, algebraic geometry and commutative algebra. This article is a short exposition on Young tableaux, written for the "WHAT IS...?" series of the Notices of the American Mathematical Society. It describes some of their properties and applications.

math.CO↗

arXiv2006

A combinatorial rule for (co)minuscule Schubert calculus

We prove a root system uniform, concise combinatorial rule for Schubert calculus of_minuscule_ and_cominuscule_ flag manifolds G/P (the latter are also known as "compact Hermitian symmetric spaces"). We connect this geometry to the poset combinatorics of [Proctor '04], thereby giving a generalization of the [Schützenberger `77]_jeu de taquin_ formulation of the Littlewood-Richardson rule that computes the intersection numbers of Grassmannian Schubert varieties. Our proof introduces_cominuscule recursions_, a general technique to relate the numbers for different Lie types. A discussion about connections of our rule to (geometric) representation theory is also briefly entertained.

math.AG↗

arXiv2006

Governing Singularities of Schubert Varieties

We present a combinatorial and computational commutative algebra methodology for studying singularities of Schubert varieties of flag manifolds. We define the combinatorial notion of *interval pattern avoidance*. For "reasonable" invariants P of singularities, we geometrically prove that this governs (1) the P-locus of a Schubert variety, and (2) which Schubert varieties are globally not P. The prototypical case is P="singular"; classical pattern avoidance applies admirably for this choice [Lakshmibai-Sandhya'90], but is insufficient in general. Our approach is analyzed for some common invariants, including Kazhdan-Lusztig polynomials, multiplicity, factoriality, and Gorensteinness, extending [Woo-Yong'05]; the description of the singular locus (which was independently proved by [Billey-Warrington '03], [Cortez '03], [Kassel-Lascoux-Reutenauer'03], [Manivel'01]) is also thus reinterpreted. Our methods are amenable to computer experimentation, based on computing with *Kazhdan-Lusztig ideals* (a class of generalized determinantal ideals) using Macaulay 2. This feature is supplemented by a collection of open problems and conjectures.

math.AG↗

arXiv2006

Tableau complexes

Let X,Y be finite sets and T a set of functions from X -> Y which we will call "tableaux". We define a simplicial complex whose facets, all of the same dimension, correspond to these tableaux. Such "tableau complexes" have many nice properties, and are frequently homeomorphic to balls, which we prove using vertex decompositions. In our motivating example, the facets are labeled by semistandard Young tableaux, and the more general interior faces are labeled by Buch's set-valued semistandard tableaux. One vertex decomposition of this "Young tableau complex" parallels Lascoux's transition formula for vexillary double Grothendieck polynomials. Consequently, we obtain formulae (both old and new) for these polynomials. In particular, we present a common generalization of the formulae of Wachs and Buch, each of which implies the classical tableau formula for Schur polynomials.

math.CO↗

arXiv2006

Stable Grothendieck polynomials and K-theoretic factor sequences

We formulate a nonrecursive combinatorial rule for the expansion of the stable Grothendieck polynomials of [Fomin-Kirillov '94] in the basis of stable Grothendieck polynomials for partitions. This gives a common generalization, as well as new proofs of the rule of [Fomin-Greene '98] for the expansion of the stable Schubert polynomials into Schur polynomials, and the K-theoretic Grassmannian Littlewood-Richardson rule of [Buch '02]. The proof is based on a generalization of the Robinson-Schensted and Edelman-Greene insertion algorithms. Our results are applied to prove a number of new formulas and properties for K-theoretic quiver polynomials, and the Grothendieck polynomials of [Lascoux-Schutzenberger '82]. In particular, we provide the first $K$-theoretic analogue of the factor sequence formula of [Buch-Fulton '99] for the cohomological quiver polynomials.

math.CO↗

arXiv2005

When is a Schubert variety Gorenstein?

A (normal) variety is Gorenstein if it is Cohen-Macualay and its canonical sheaf is a line bundle. This property, which measures the ``pathology'' of the singularities of a variety, is thus stronger than Cohen-Macualayness, but is also weaker than smoothness. We determine which Schubert varieties are Gorenstein in terms of a combinatorial characterization using generalized pattern avoidance conditions. We also give an explicit description as a line bundle of the canonical sheaf of a Gorenstein Schubert variety.

math.AG↗

arXiv2005

Gröbner geometry of vertex decompositions and of flagged tableaux

We relate a classic algebro-geometric degeneration technique, dating at least to [Hodge 1941], to the notion of vertex decompositions of simplicial complexes. The good case is when the degeneration is reduced, and we call this a "geometric vertex decomposition". Our main example in this paper is the family of vexillary matrix Schubert varieties, whose ideals are also known as (one-sided) ladder determinantal ideals. Using a diagonal term order to specify the (Gröbner) degeneration, we show that these have geometric vertex decompositions into simpler varieties of the same type. From this, together with the combinatorics of the pipe dreams of [Fomin--Kirillov 1996], we derive a new formula for the numerators of their multigraded Hilbert series, the double Grothendieck polynomials, in terms of "flagged set-valued tableaux". This unifies work of [Wachs 1985] on flagged tableaux, and [Buch 2002] on set-valued tableaux, giving geometric meaning to both. This work focuses on diagonal term orders, giving results complementary to those of [Knutson--Miller 2004], where it was shown that the generating minors form a Gröbner basis for any antidiagonal term order and any matrix Schubert variety. We show here that under a diagonal term order, the only matrix Schubert varieties for which these minors form Gröbner bases are the vexillary ones, reaching an end toward which the ladder determinantal literature had been building.

math.AG↗

arXiv2004

A formula for K-theory truncation Schubert calculus

Define a ``truncation'' $r_{t}(p)$ of a polynomial $p$ in $\{x_1,x_2,x_3,...\}$ as the polynomial with all but the first $t$ variables set to zero. In certain good cases, the truncation of a Schubert or Grothendieck polynomial may again be a Schubert or Grothendieck polynomial. We use this phenomenon to give subtraction-free formulae for certain Schubert structure constants in $K(Flags({\mathbb C}^n))$, in particular generalizing those from [Kogan '00] in which only cohomology was treated, and from [Buch `02] on the Grassmannian case. The terms of the answer are computed using ``marching'' operations on permutation diagrams.

math.CO↗

arXiv2003

Quiver coefficients are Schubert structure constants

We give an explicit natural identification between the quiver coefficients of Buch and Fulton, decomposition coefficients for Schubert polynomials, and the Schubert structure constants for flag manifolds. This is also achieved in K-theory where we give a direct argument that the decomposition coefficients have alternating signs, based on a theorem of Brion, which then implies that the quiver coefficients have alternating signs. Our identification shows that known combinatorial formulas for the latter two numbers give formulas for the quiver coefficients.

math.CO↗