Abstract:While the intersection of the Grassmannian Bruhat decompositions for all coordinate flags is an intractable mess, it turns out that the intersection of only the cyclic shifts of one Bruhat decomposition has many of the good properties of the Bruhat and Richardson decompositions. This decomposition coincides with the projection of the Richardson stratification of the flag manifold, studied by Lusztig, Rietsch, Brown-Goodearl-Yakimov and the present authors. However, its cyclic-invariance is hidden in this descr… Show more
“…There are 2n delta functions in total, four of them give the overall momentum conservation while the remaining 2n − 4 constrain the parameters of the C-matrix. The study of Grassmannians is a vast and active topic in the mathematics community ranging, amongst others, from combinatorics to algebraic geometry [50][51][52][53][54][55]. There is a close connection to on-shell diagrams which was simultaneously discovered both by physicists in the context of scattering amplitudes and by mathematicians (in the math literature JHEP11(2016)136 these diagrams are called plabic graphs) in searching for positive parameterizations of Grassmannians.…”
We study on-shell diagrams for gravity theories with any number of supersymmetries and find a compact Grassmannian formula in terms of edge variables of the graphs. Unlike in gauge theory where the analogous form involves only d log-factors, in gravity there is a non-trivial numerator as well as higher degree poles in the edge variables. Based on the structure of the Grassmannian formula for N = 8 supergravity we conjecture that gravity loop amplitudes also possess similar properties. In particular, we find that there are only logarithmic singularities on cuts with finite loop momentum and that poles at infinity are present, in complete agreement with the conjecture presented in [1].
“…There are 2n delta functions in total, four of them give the overall momentum conservation while the remaining 2n − 4 constrain the parameters of the C-matrix. The study of Grassmannians is a vast and active topic in the mathematics community ranging, amongst others, from combinatorics to algebraic geometry [50][51][52][53][54][55]. There is a close connection to on-shell diagrams which was simultaneously discovered both by physicists in the context of scattering amplitudes and by mathematicians (in the math literature JHEP11(2016)136 these diagrams are called plabic graphs) in searching for positive parameterizations of Grassmannians.…”
We study on-shell diagrams for gravity theories with any number of supersymmetries and find a compact Grassmannian formula in terms of edge variables of the graphs. Unlike in gauge theory where the analogous form involves only d log-factors, in gravity there is a non-trivial numerator as well as higher degree poles in the edge variables. Based on the structure of the Grassmannian formula for N = 8 supergravity we conjecture that gravity loop amplitudes also possess similar properties. In particular, we find that there are only logarithmic singularities on cuts with finite loop momentum and that poles at infinity are present, in complete agreement with the conjecture presented in [1].
“…where k is the rank of P. A simple computation (which is spelled out in [7]) shows that #I = nk + n, and we know that d I = l(π ) + n, since we are counting the pairs of intervals in the definition of l(π ) and also counting the pairs (I, I ). So, we are left with…”
Section: Lemma 49 the Connected Components Of A Positroid Form A Nonmentioning
confidence: 99%
“…So, for example, the 3 printed in the fourth row and fourth nonempty column indicates that [4,7] = [4, 1] = {4, 5, 6, 1} has rank 3. The underlined entries are the positions of the 1's in the corresponding affine permutation matrix.…”
Section: Example 46mentioning
confidence: 99%
“…In particular, they are always reduced, irreducible, and Cohen-Macaulay, and unlike general matroid varieties (see Counterexample 2.6) they are always cut out by Plücker variables. Positroids are very well-studied already, and there are several different combinatorial gadgets that have been invented to describe them, some of which are described in [7].…”
Section: Proposition 41 If M Is a Matroid Of Rank K On [N] The Follmentioning
confidence: 99%
“…Counterexample 2.6 Consider the rank-3 matroid A on [7] generated by the conditions that {1, 2, 7}, {3, 4, 7}, and {5, 6, 7} have rank 2. The variety X (A) is not cut out by the ideal ( p 127 , p 347 , p 567 ).…”
Section: Construction 25 Consider the Grassmannian G(k N)mentioning
Matroid varieties are the closures in the Grassmannian of sets of points defined by specifying which Plücker coordinates vanish and which do not. In general these varieties are very ill-behaved, but in many cases one can estimate their codimension by keeping careful track of the conditions imposed by the vanishing of each Plücker coordinates on the columns of the matrix representing a point of the Grassmannian. This paper presents a way to make this procedure precise, producing a number for each matroid variety called its expected codimension that can be computed combinatorially solely from the list of Plücker coordinates that are prescribed to vanish. We prove that for a special, well-studied class of matroid varieties called positroid varieties, the expected codimension coincides with the actual codimension.
Knutson introduced two families of reverse juggling Markov chains (single and multispecies) motivated by the study of random semi‐infinite matrices over Fq. We present natural generalizations of both chains by placing generic weights that still lead to simple combinatorial expressions for the stationary distribution. For permutations, this is a seemingly new multivariate generalization of the inversion polynomial.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.