Related papers: An effective decomposition theorem for Schubert va…

Let $\mathcal S$ be a single condition Schubert variety with an arbitrary number of strata. Recently, an explicit description of the summands involved in the decomposition theorem applied to such a variety has been obtained in a paper of…

Let $X\subseteq G\slash B$ be a Schubert variety in a flag manifold and let $\pi: \tilde X \rightarrow X$ be a Bott-Samelson resolution of $X$. In this paper we prove an effective version of the decomposition theorem for the derived…

In paper I of this series we gave positive formulae for expanding the product $\mathfrak S^\pi \mathfrak S^\rho$ of two Schubert polynomials, in the case that both $\pi,\rho$ had shared descent set of size $\leq 3$. Here we introduce and…

We give a short and self-contained proof of the Decomposition Theorem for the non-small resolution of a Special Schubert variety. We also provide an explicit description of the perverse cohomology sheaves. As a by-product of our approach,…

We describe and prove correctness of two practical algorithms for finding indecomposable summands of finitely generated modules over a finitely generated k-algebra R. The first algorithm applies in the (multi)graded case, which enables the…

We develop numerical homotopy algorithms for solving systems of polynomial equations arising from the classical Schubert calculus. These homotopies are optimal in that generically no paths diverge. For problems defined by hypersurface…

The expansion of a Schubert polynomial into slide polynomials corresponds to a sum over sub-balls in the subword complex. There has been recent interest in other, coarser, expansions of Schubert polynomials. We extend the methods used in…

In this paper, we introduce Schubert decompositions for quiver Grassmannians and investigate example classes of quiver Grassmannians with a Schubert decomposition into affine spaces. The main theorem puts the cells of a Schubert…

We realise the Bott-Samelson resolutions of type A Schubert varieties as quiver Grassmannians. In order to explicitly describe this isomorphism, we introduce the notion of a \textit{geometrically compatible} decomposition for any…

We prove that twisted versions of Schubert polynomials defined by $\widetilde{\mathfrak S}_{w_0} = x_1^{n-1}x_2^{n-2} \cdots x_{n-1}$ and $\widetilde{\mathfrak S}_{ws_i} = (s_i+\partial_i)\widetilde{\mathfrak S}_w$ are monomial positive and…

We give an elementary approach utilizing only the divided difference formalism for obtaining expansions of Schubert polynomials that are manifestly nonnegative, by studying solutions to the equation $\sum Y_i\partial_i=\mathrm{id}$ on…

Extending the main result of Part 1, in the first part of this paper we show that every quiver Grassmannian of a representation of a quiver of extended Dynkin type $D$ has a decomposition into affine spaces. In the case of real root…

Let $Q$ be a quiver of extended Dynkin type $D$. In this first of two papers, we show that the quiver Grassmannian $Gr_e(M)$ has a decomposition into affine spaces for every dimension vector $e$ and every indecomposable representation $M$…

An important combinatorial result in equivariant cohomology and $K$-theory Schubert calculus is represented by the formulas of Billey and Graham-Willems for the localization of Schubert classes at torus fixed points. These formulas work…

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…

We give a criterion for a collection of polynomials to be a universal Gr\"{o}bner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in $(\mathbb{P}^1)^N$. This criterion can be used to give…

We consider the problem of finding exact sums of squares (SOS) decompositions for certain classes of non-negative multivariate polynomials, relying on semidefinite programming (SDP) solvers. We start by providing a hybrid numeric-symbolic…

We prove decomposition theorems for sparse positive (semi)definite polynomial matrices that can be viewed as sparsity-exploiting versions of the Hilbert--Artin, Reznick, Putinar, and Putinar--Vasilescu Positivstellens\"atze. First, we…

A polynomial-time algorithm is produced which, given generators for a group of permutations on a finite set, returns a direct product decomposition of the group into directly indecomposable subgroups. The process uses bilinear maps and…

We consider the problem of computing exact sums of squares (SOS) decompositions for certain classes of non-negative multivariate polynomials, relying on semidefinite programming (SDP) solvers. We provide a hybrid numeric-symbolic algorithm…