English
Related papers

Related papers: $P$-Schur positive $P$-Grothendieck Polynomials

200 papers

A subgroup H of a reductive group G is horospherical if it contains a maximal unipotent subgroup. We describe the Grothendieck semigroup of invariant subspaces of regular functions on G/H as a semigroup of convex polytopes. From this we…

Algebraic Geometry · Mathematics 2010-07-27 Kiumars Kaveh , A. G. Khovanskii

We prove that every supersymmetric Schur polynomial has a saturated Newton polytope (SNP). Our approach begins with a tableau-theoretic description of the support, which we encode as a polyhedron with a totally unimodular constraint matrix.…

Combinatorics · Mathematics 2025-08-21 Dang Tuan Hiep , Khai-Hoan Nguyen-Dang

In this paper, we establish more identities of generalized multi poly-Euler polynomials with three parameters and obtain a kind of symmetrized generalization of the polynomials. Moreover, generalized multi poly-Bernoulli polynomials are…

Number Theory · Mathematics 2018-07-25 Roberto B. Corcino , Hassan Jolany , Cristina B. Corcino , Takao Komatsu

There is a remarkable formula for the principal specialization of a type A Schubert polynomial as a weighted sum over reduced words. Taking appropriate limits transforms this to an identity for the backstable Schubert polynomials recently…

Combinatorics · Mathematics 2022-01-20 Eric Marberg , Brendan Pawlowski

Left and right "generalized Schur algebras", previously introduced by the author, are defined and analyzed. Filtrations of these algebras lead, in most cases, to parameterizations of the their irreducible representations over fields of…

Rings and Algebras · Mathematics 2016-01-11 Robert D. May

Set-valued tableaux, introduced by Buch to express the tableaux-sum formula for stable Grothendieck polynomials, generalize semistandard tableaux. We provide a new recursive proof that the number of set-valued tableaux of a given shape is…

Combinatorics · Mathematics 2026-02-26 Taikei Fujii , Takahiko Nobukawa , Tatsushi Shimazaki

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…

Combinatorics · Mathematics 2016-04-05 Anatol N. Kirillov

Jacobi-Trudy formula for a generalisation of Schur polynomials related to any sequence of orthogonal polynomials in one variable is given. As a corollary we have Giambelli formula for generalised Schur polynomials.

Representation Theory · Mathematics 2009-06-10 A. N. Sergeev , A. P. Veselov

We create several families of bases for the symmetric polynomials. From these bases we prove that certain Schur symmetric polynomials form a basis for quotients of symmetric polynomials that generalize the cohomology and the quantum…

Combinatorics · Mathematics 2019-11-19 Andrew Weinfeld

We study a family of dissections of flow polytopes arising from the subdivision algebra. To each dissection of a flow polytope, we associate a polynomial, called the left-degree polynomial, which we show is invariant of the dissection…

Combinatorics · Mathematics 2020-06-25 Karola Mészáros , Avery St. Dizier

Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…

Symbolic Computation · Computer Science 2007-05-23 Cyril Brunie , Philippe Saux Picart

We introduce a family of tableaux that simultaneously generalizes the tableaux used to characterize Grothendieck polynomials and k-Schur functions. We prove that the polynomials drawn from these tableaux are the affine Grothendieck…

Combinatorics · Mathematics 2009-07-02 Jennifer Morse

We associate a polynomial to any diagram of unit cells in the first quadrant of the plane using Kohnert's algorithm for moving cells down. In this way, for every weak composition one can choose a cell diagram with corresponding row-counts,…

Combinatorics · Mathematics 2018-08-16 Sami Assaf , Dominic Searles

This publication is an exercise which extends to two variables the Christoffel's construction of orthogonal polynomials for potentials of one variable with external sources. We generalize the construction to biorthogonal polynomials. We…

High Energy Physics - Theory · Physics 2007-05-23 M. C. Bergère

We introduce generalization of famous Macdonald polynomials for the case of super-Young diagrams that contain half-boxes on the equal footing with full boxes. These super-Macdonald polynomials are polynomials of extended set of variables:…

High Energy Physics - Theory · Physics 2024-08-09 Dmitry Galakhov , Alexei Morozov , Nikita Tselousov

We study the class $\mathcal C$ of symmetric functions whose coefficients in the Schur basis can be described by generating functions for sets of tableaux with fixed shape. Included in this class are the Hall-Littlewood polynomials,…

Combinatorics · Mathematics 2011-06-09 Jason Bandlow , Jennifer Morse

In this paper we classify all Schur functions and skew Schur functions that are multiplicity free when expanded in the basis of fundamental quasisymmetric functions, termed F-multiplicity free. Combinatorially, this is equivalent to…

Combinatorics · Mathematics 2014-01-30 Christine Bessenrodt , Stephanie van Willigenburg

Skew stable Grothendieck polynomials are $K$-theoretic analogues of skew Schur polynomials. We give a free-fermionic presentation of skew stable Grothendieck polynomials and their dual symmetric functions. By using our presentation, we…

Combinatorics · Mathematics 2022-04-05 Shinsuke Iwao

For a skew shape $\lambda/\mu$, we define the hybrid Grothendieck polynomial $${G}_{\lambda/\mu}(\textbf{x};\textbf{t};\textbf{w}) =\sum_{T\in \mathrm{SVRPP}(\lambda/\mu)} \textbf{x}^{\mathrm{ircont}(T)}\textbf{t}^{\mathrm{ceq}…

Combinatorics · Mathematics 2025-05-27 Peter L. Guo , Mingyang Kang , Jiaji Liu

We make a systematic study of a new combinatorial construction called a dual equivalence graph. We axiomatize these graphs and prove that their generating functions are symmetric and Schur positive. This provides a universal method for…

Combinatorics · Mathematics 2020-03-05 Sami H. Assaf