Related papers: Mitosis algorithm for Grothendieck polynomials

We establish the formula for multiplication by the class of a special Schubert variety in the integral cohomology ring of the flag manifold. This formula also describes the multiplication of a Schubert polynomial by either an elementary…

In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…

We propose an approach to constructing iterative methods for finding polynomial roots simultaneously. One feature of this approach is using the fundamental theorem of symmetric polynomials. Within this framework, we reconstruct many of the…

We present combinatorial rules (one theorem and two conjectures) concerning three bases of Z[x1,x2,....]. First, we prove a "splitting" rule for the basis of key polynomials [Demazure '74], thereby establishing a new positivity theorem…

We introduce common generalization of (double) Schubert, Grothendieck, Demazure, dual and stable Grothendieck polynomials, and Di Francesco-Zinn-Justin polynomials. Our approach is based on the study of algebraic and combinatorial…

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…

An approach to Schubert calculus is to realize Schubert classes as concrete combinatorial objects such as Schubert polynomials. Using the polytope ring of the Gelfand-Tsetlin polytopes, Kiritchenko-Smirnov-Timorin realized each Schubert…

We prove an extension of the Bourgain-Sarnak-Ziegler theorem and then apply it to bound certain polynomial exponential sums with modular coefficients.

We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…

Grothendieck polynomials, introduced by Lascoux and Sch\"utzenberger, are certain $K$-theory representatives for Schubert varieties. Symplectic Grothendieck polynomials, described more recently by Wyser and Yong, represent the $K$-theory…

Grothendieck point residue is considered in the context of computational complex analysis. A new effective method is proposed for computing Grothendieck point residues mappings and residues. Basic ideas of our approach are the use of…

In this paper, an efficient method is presented for solving three dimensional Volterra integral equations of the second kind with continuous kernel. Shifted Chebyshev polynomial is applied to approximate a solution for these integral…

This article is about a decoding algorithm for error-correcting subspace codes. A version of this algorithm was previously described by Rosenthal, Silberstein and Trautmann. The decoding algorithm requires the code to be defined as the…

Symmetric Grothendieck polynomials are analogues of Schur polynomials in the K-theory of Grassmannians. We build dual families of symmetric Grothendieck polynomials using Schur operators. With this approach we prove skew Cauchy identity and…

We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.

In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational field extension (which in particular includes the zero characteristic case). One of the main tools is Groebner…

By applying a Gr\"{o}bner-Shirshov basis of the symmetric group $S_{n}$, we give two formulas for Schubert polynomials, either of which involves only nonnegative monomials. We also prove some combinatorial properties of Schubert…

A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the…

Motivated by the question of whether Chow polynomials of matroids have only real roots, this article revisits the known relationship between Eulerian polynomials and the Hilbert series of Chow rings of permutohedral varieties. This is done…

Let T(x) in k[x] be a monic non-constant polynomial and write R=k[x] / (T) the quotient ring. Consider two bivariate polynomials a(x, y), b(x, y) in R[y]. In a first part, T = p^e is assumed to be the power of an irreducible polynomial p. A…