Related papers: Constructing Maximal Bumpless Pipedreams for Doubl…
We give a new proof that three families of polynomials coincide: the double Schubert polynomials of Lascoux and Sch\"utzenberger defined by divided difference operators, the pipe dream polynomials of Bergeron and Billey, and the equivariant…
We introduce flag positroid pipe dreams (FPPs), whose role in the study of complete flag positroids is analogous to the role of Le-diagrams in the study of positroids. We develop the combinatorics of these diagrams and highlight some of…
We prove a formula for double Schubert and Grothendieck polynomials specialized to two rearrangements of the same set of variables. Our formula generalizes the usual formulas for Schubert and Grothendieck polynomials in terms of RC-graphs,…
A bilevel program is an optimization problem whose constraints involve another optimization problem. This paper studies bilevel polynomial programs (BPPs), i.e., all the functions are polynomials. We reformulate BPPs equivalently as…
The geometric naturality of Schubert polynomials and their combinatorial pipe dream representations was established by Knutson and Miller (2005) via antidiagonal Gr\"obner degeneration of matrix Schubert varieties. We consider instead…
In recent work, Hamaker, Pechenik, Speyer, and Weigandt showed that a certain differential operator $\nabla$ expands positively in the basis of Schubert polynomials. For $\pi$ a dominant permutation, Gaetz and Tung showed an analogous…
The Circuit diameter of polytopes was introduced by Borgwardt, Finhold and Hemmecke as a fundamental tool for the study of circuit augmentation schemes for linear programming and for estimating combinatorial diameters. Determining the…
Kazhdan-Lusztig ideals, a family of generalized determinantal ideals investigated in [Woo-Yong '08], provide an explicit choice of coordinates and equations encoding a neighbourhood of a torus-fixed point of a Schubert variety on a type A…
Coverings of the Riemann sphere by itself, ramified over two points, are given by so-called Shabat polynomials. The correspondence between Grothendieck's dessins d'enfants and Belyi maps then implies a bijection between Shabat polynomials…
Fink, M\'esz\'aros and St.Dizier showed that the Schubert polynomial $\mathfrak{S}_w(x)$ is zero-one if and only if $w$ avoids twelve permutation patterns. In this paper, we prove that the Grothendieck polynomial $\mathfrak{G}_w(x)$ is…
A great variety of fundamental optimization and counting problems arising in computer science, mathematics and physics can be reduced to one of the following computational tasks involving polynomials and set systems: given an $m$-variate…
We study consequences and applications of the folklore statement that every double complex over a field decomposes into so-called squares and zigzags. This result makes questions about the associated cohomology groups and spectral sequences…
The classical Grothendieck inequality is viewed as a statement about representations of functions of two variables over discrete domains by integrals of two-fold products of functions of one variable. An analogous statement is proved,…
Let $(R,\mm)$ be a Noetherian local ring and $M$ a finitely generated $R$-module. We say $M$ has maximal depth if there is an associated prime $\pp$ of $M$ such that $\depth M=\dim R/\pp$. In this paper we study squarefree monomial ideals…
We give combinatorial proofs of two types of duality for Grothendieck polynomials by constructing a unified combinatorial framework incorporating set-valued tableaux, musltiset-valued tableaux, reverse plane partitions and valued-set…
We show that maximal 0-1-fillings of moon polynomials with restricted chain lengths can be identified with certain rc-graphs, also known as pipe dreams. In particular, this exhibits a connection between maximal 0-1-fillings of Ferrers…
We construct double Grothendieck polynomials of classical types which are essentially equivalent to but simpler than the polynomials defined by A.N.Kirillov in arXiv:1504.01469 and identify them with the polynomials defined by T.Ikeda and…
The odd-red bipartite perfect matching problem asks to find a perfect matching containing an odd number of red edges in a given red-blue edge-colored bipartite graph. While this problem lies in $\mathsf{P}$, its polyhedral structure remains…
We achieve new results on skew polynomial rings and their quotients, including the first explicit example of a skew polynomial ring where the ratio of the degree of a skew polynomial to the degree of its bound is not extremal. These methods…
The fact that Schubert polynomials are the weighted counting functions for reduced RC-graphs, also known as reduced pipe dreams, was established using their generating functions inside an appropriate Demazure algebra. Here we investigate…