Related papers: Slide multiplicity free key polynomials

We give a pattern-avoidance characterization of $w \in S_n$ such that the Schubert polynomial $\mathfrak{S}_w$ is a standard elementary monomial. This characterization tells us which quantum Schubert polynomials are easiest to compute. We…

We introduce an insertion algorithm on Kohnert's combinatorial model for Demazure characters, generalizing Robinson--Schensted--Knuth insertion on tableaux. Our new insertion yields an explicit, nonnegative formula expressing the product of…

We present a Hilbert space geometric approach to the problem of characterizing the positive bivariate trigonometric polynomials that can be represented as the square of a two variable polynomial possessing a certain stability requirement,…

We prove that if $\sigma \in S_m$ is a pattern of $w \in S_n$, then we can express the Schubert polynomial $\mathfrak{S}_w$ as a monomial times $\mathfrak{S}_\sigma$ (in reindexed variables) plus a polynomial with nonnegative coefficients.…

The interplay among the time-evolution of the coefficients and the zeros of a generic time-dependent (monic) polynomial provides a convenient tool to identify certain classes of solvable dynamical systems. Recently this tool has been…

Regarding non-unique factorization of integer-valued polynomials over a discrete valuation domain $(R,M)$ with finite residue field, it is known that there exist absolutely irreducible elements, that is, irreducible elements all of whose…

The orbits of the symplectic group acting on the type A flag variety are indexed by the fixed-point-free involutions in a finite symmetric group. The cohomology classes of the closures of these orbits have polynomial representatives…

We study the back stable Schubert calculus of the infinite flag variety. Our main results are: 1) a formula for back stable (double) Schubert classes expressing them in terms of a symmetric function part and a finite part; 2) a novel…

We generalize Sylvester single sums to multisets (sets with repeated elements), and show that these sums compute subresultants of two univariate polyomials as a function of their roots independently of their multiplicity structure. This is…

Given a symmetric variety Y defined over the rationals and a non-zero polynomial with integer coefficients, we use techniques from homogeneous dynamics to establish conditions under which the polynomial can be made r-free for a Zariski…

We present a variant of the Peskine--Szpiro Acyclicity Lemma, and hence a way to certify exactness of a complex of finite modules over a large class of (possibly) noncommutative rings. Specifically, over the class of Auslander regular…

In our previous work arXiv:1305.3543, we employed the approach to Schubert polynomials by Fomin, Stanley, and Kirillov to obtain simple, uniform proofs that the double Schubert polynomials of Lascoux and Schutzenberger and Ikeda, Mihalcea,…

The classical Hilbert specialization property is a field-theoretic tool ensuring that polynomial irreducibility over a field is preserved under specialization of some of the variables. We develop an integral counterpart by introducing the…

We suggest an efficient algorithm for the selection of sparse subsets of a set of influence for the numerical discretization of differential operators on irregular nodes with polynomial consistency of a given order with the help of the QR…

The Schubert vanishing problem asks whether Schubert structure constants are zero. We give a complete solution of the problem from an algorithmic point of view, by showing that Schubert vanishing can be decided in probabilistic polynomial…

In this paper a higher-order mixed finite element method for elastoplasticity with linear kinematic hardening is analyzed. Thereby, the non-differentiability of the involved plasticity functional is resolved by a Lagrange multiplier leading…

The relationship between nonnegative polynomials and sums of squares is a classical topic in real algebraic geometry. We study \emph{stubborn polynomials} $f$ on a real variety $X$, which are polynomials nonnegative on $X$, such that no odd…

For each sequence of polynomials, P=(p_1(t),p_2(t),...), we define a characteristic series of groups, called the derived series localized at P. Given a knot K in S^3, such a sequence of polynomials arises naturally as the orders of certain…

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…