English
Related papers

Related papers: Multiplicity-free key polynomials

200 papers

Schubert polynomials are refined by the key polynomials of Lascoux-Sch\"{u}tzenberger, which in turn are refined by the fundamental slide polynomials of Assaf-Searles. In this paper we determine which fundamental slide polynomial…

Combinatorics · Mathematics 2022-01-11 Soojin Cho , Stephanie van Willigenburg

Demazure characters of type A, which are equivalent to key polynomials, have been decomposed by Lascoux and Sch\"{u}tzenberger into standard bases. We prove that the resulting polynomials, which we call Demazure atoms, can be obtained from…

Combinatorics · Mathematics 2009-04-02 Sarah Mason

We provide a non-recursive, combinatorial classification of multiplicity-free skew Schur polynomials. These polynomials are $GL_n$, and $SL_n$, characters of the skew Schur modules. Our result extends work of H. Thomas--A. Yong, and C.…

Combinatorics · Mathematics 2020-10-29 Shiliang Gao , Reuven Hodges , Gidon Orelowitz

Lock polynomials and lock Kohnert tableaux are natural analogues to key polynomials and key Kohnert tableaux, respectively. In this paper, we compare lock polynomials to the much-studied key polynomials and show that the difference of a key…

Combinatorics · Mathematics 2020-01-29 George Wang

We introduce two new bases of the ring of polynomials and study their relations to known bases. The first basis is the quasiLascoux basis, which is simultaneously both a $K$-theoretic deformation of the quasikey basis and also a lift of the…

Combinatorics · Mathematics 2021-01-20 Cara Monical , Oliver Pechenik , Dominic Searles

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…

Combinatorics · Mathematics 2015-07-30 Colleen Ross , Alexander Yong

A-polynomials were introduced by Meyn and play an important role in the iterative construction of high degree self-reciprocal irreducible polynomials over the field F_2, since they constitute the starting point of the iteration. The exact…

Number Theory · Mathematics 2019-05-22 Alp Bassa , Ricardo Menares

We establish a poset structure on combinatorial bases of multivariate polynomials defined by positive expansions, and study properties common to bases in this poset. Included are the well-studied bases of Schubert polynomials, Demazure…

Combinatorics · Mathematics 2018-08-09 Dominic Searles

We introduce shifted analogues of key polynomials related to symplectic and orthogonal orbit closures in the complete flag variety. Our definitions are given by applying isobaric divided difference operators to the analogues of Schubert…

Combinatorics · Mathematics 2024-09-09 Eric Marberg , Travis Scrimshaw

Let $\iota:K\hookrightarrow L\cong K(x)$ be a simple transcendental extension of valued fields, where $K$ is equipped with a valuation $\nu$ of rank 1. That is, we assume given a rank 1 valuation $\nu$ of $K$ and its extension $\nu'$ to…

Algebraic Geometry · Mathematics 2022-06-30 F. J. Herrera Govantes , W. Mahboub , M. A. Olalla Acosta , M. Spivakovsky

Enriched versions of type A Schubert polynomials are constructed with coefficients in a polynomial ring in variables $c_1, c_2, \ldots$. Specializing these variables to $0$ recovers the double Schubert polynomials of Lascoux and…

Combinatorics · Mathematics 2021-02-12 David Anderson , William Fulton

The notion of key polynomials was first introduced in 1936 by S. Maclane in the case of discrete rank 1 valuations. . Let K -> L be a field extension and {\nu} a valuation of K. The original motivation for introducing key polynomials was…

Algebraic Geometry · Mathematics 2012-08-18 Wael Mahboub

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.

Combinatorics · Mathematics 2011-10-19 Hugh Thomas , Alexander Yong

Let R be a local ring and A a connected differential graded algebra over R which is free as a graded R-module. Using homological perturbation theory techniques, we construct a minimal free multi model for A having properties similar to that…

Algebraic Topology · Mathematics 2007-05-23 Johannes Huebschmann

In this work, multiplicities of zeros of skew polynomials are studied. Two distinct definitions are considered: First, $ a $ is said to be a zero of $ F $ of multiplicity $ r $ if $ (x-a)^r $ divides $ F $ on the right; second, $ a $ is…

Rings and Algebras · Mathematics 2022-05-19 Umberto Martínez-Peñas

We classify the discriminantly separable polynomials of degree two in each of three variables, defined by a property that all the discriminants as polynomials of two variables are factorized as products of two polynomials of one variable…

Dynamical Systems · Mathematics 2014-10-02 Vladimir Dragovic , Katarina Kukic

We investigate the longstanding problem of finding a combinatorial rule for the Schubert structure constants in the $K$-theory of flag varieties (in type $A$). The Grothendieck polynomials of A. Lascoux-M.-P. Sch\"{u}tzenberger (1982) serve…

Combinatorics · Mathematics 2019-10-23 Oliver Pechenik , Dominic Searles

We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure…

Combinatorics · Mathematics 2018-09-26 Per Alexandersson

A basis of quasi-invariant module over invariants is explicitly constructed for the two-dimensional Coxeter systems with arbitrary multiplicities. It is proved that this basis consists of $m$-harmonic polynomials, thus the earlier results…

Mathematical Physics · Physics 2007-05-23 M. Feigin

Polynomial Systems, or at least their algorithms, have the reputation of being doubly-exponential in the number of variables [Mayr and Mayer, 1982], [Davenport and Heintz, 1988]. Nevertheless, the Bezout bound tells us that that number of…

Symbolic Computation · Computer Science 2016-07-19 James H. Davenport , Matthew England
‹ Prev 1 2 3 10 Next ›