English
Related papers

Related papers: Permutations with only reduced co-BPDs

200 papers

Lascoux and Sch\"utzenberger introduced Schubert and Grothendieck polynomials to study the cohomology and K-theory of the complete flag variety. We present explicit combinatorial rules for expressing Grothendieck polynomials in the basis of…

Combinatorics · Mathematics 2025-06-10 Anna Weigandt

Schubert polynomials are distinguished representatives of Schubert cycles in the cohomology of the flag variety. In the spirit of Bergeron and Sottile, we use the Bruhat order to give $(n-1)!$ different combinatorial formulas for the…

Combinatorics · Mathematics 2024-07-09 Tianyi Yu

We construct a bijection between marked bumpless pipedreams with reverse compatible pairs, which are in bijection with not-necessarily-reduced pipedreams. This directly unifies various formulas for Grothendieck polynomials in the…

Combinatorics · Mathematics 2024-07-26 Daoji Huang , Mark Shimozono , Tianyi Yu

In their study of infinite flag varieties, Lam, Lee, and Shimozono (2021) introduced bumpless pipe dreams in a new combinatorial formula for double Schubert polynomials. These polynomials are the TxT-equivariant cohomology classes of matrix…

Combinatorics · Mathematics 2025-09-03 Patricia Klein , Anna Weigandt

Pipedreams and bumpless pipedreams are two combinatorial models that compute double Grothendieck polynomials. While studying matrix Schubert varieties, Pechenik, Speyer, and Weigandt defined a permutation statistic$\mathsf{rajcode}(\cdot)$…

Combinatorics · Mathematics 2026-05-26 Xuanying Han , Sophie C. C. Sun

Knutson and Miller (2005) established a connection between the anti-diagonal Gr\"obner degenerations of matrix Schubert varieties and the pre-existing combinatorics of pipe dreams. They used this correspondence to give a…

Commutative Algebra · Mathematics 2023-01-19 Patricia Klein

In their work on the infinite flag variety, Lam, Lee, and Shimozono (2018) introduced objects called bumpless pipe dreams and used them to give a formula for double Schubert polynomials. We extend this formula to the setting of K-theory,…

Combinatorics · Mathematics 2020-03-17 Anna Weigandt

Schubert polynomials are polynomial representatives of Schubert classes in the cohomology of the complete flag variety and have a combinatorial formulation in terms of bumpless pipe dreams. Quantum double Schubert polynomials are polynomial…

Combinatorics · Mathematics 2025-02-12 Tuong Le , Shuge Ouyang , Leo Tao , Joseph Restivo , Angelina Zhang

We present computational results on principal specializations $\mathfrak{S}_w(1^n)$ of Schubert polynomials, which count reduced pipe dreams and reduced bumpless pipe dreams (RBPD). We find the first counterexample, at $n=17$, to the…

Combinatorics · Mathematics 2026-03-23 David Anderson , Greta Panova , Leonid Petrov

We introduce analogs of left and right RSK insertion for Schubert calculus of complete flag varieties. The objects being inserted are certain biwords, the insertion objects are bumpless pipe dreams, and the recording objects are decorated…

Combinatorics · Mathematics 2022-06-30 Daoji Huang , Pavlo Pylyavskyy

Weighted enumeration of reduced pipe dreams (or rc-graphs) results in a combinatorial expression for Schubert polynomials. The duality between the set of reduced pipe dreams and certain antidiagonals has important geometric implications [A.…

Combinatorics · Mathematics 2008-05-27 Ning Jia , Ezra Miller

We study random permutations arising from reduced pipe dreams. Our main model is motivated by Grothendieck polynomials with parameter $\beta=1$ arising in K-theory of the flag variety. The probability weight of a permutation is proportional…

Probability · Mathematics 2025-04-17 Alejandro H. Morales , Greta Panova , Leonid Petrov , Damir Yeliussizov

Knutson and Zinn-Justin recently found a puzzle rule for the expansion of the product $\mathfrak{G}_{u}(x,t)\cdot \mathfrak{G}_{v}(x,t)$ of two double Grothendieck polynomials indexed by permutations with separated descents. We establish…

Combinatorics · Mathematics 2025-10-15 Neil J. Y. Fan , Peter L. Guo , Rui Xiong

We construct an integrable colored six-vertex model whose partition function is a double Grothendieck polynomial. This gives an integrable systems interpretation of bumpless pipe dreams and recent results of Weigandt [arXiv:2003.07342]…

Combinatorics · Mathematics 2021-01-05 Valentin Buciumas , Travis Scrimshaw

We study the factorization of Schubert polynomials into elementary symmetric polynomials. We conjecture that this occurs when the permutation corresponding to the Schubert polynomial does not contain the patterns $1432$, $1423$, $4132$, and…

Combinatorics · Mathematics 2025-11-21 Oma Makhija

In [KU23] were introduced hybrid pipe dreams interpolating between classic and bumpless pipe dreams, each hybridization giving a different formula for double Schubert polynomials. A bijective proof was given (following [GH23]) of the…

Combinatorics · Mathematics 2025-09-03 Allen Knutson , Paul Zinn-Justin

Pipe dreams and bumpless pipe dreams for vexillary permutations are each known to be in bijection with certain semistandard tableaux via maps due to Lenart and Weigandt, respectively. Recently, Gao and Huang have defined a bijection between…

Combinatorics · Mathematics 2022-07-04 Adam Gregory , Zachary Hamaker

Recent work of Pechenik, Speyer, and Weigandt proved a formula for the degree of any Grothendieck polynomial. A distinct formula for the degree of vexillary Grothendieck polynomials was proven by Rajchgot, Robichaux, and Weigandt. We give a…

Combinatorics · Mathematics 2022-09-15 Elena S. Hafner

In our previous work we have introduced an analogue of Robinson-Schensted-Knuth correspondence for Schubert calculus of the complete flag varieties. The objects inserted are certain biwords, the outcomes of insertion are bumpless pipe…

Combinatorics · Mathematics 2023-04-17 Daoji Huang , Pavlo Pylyavskyy

Pseudo-Boolean constraints are omnipresent in practical applications, and thus a significant effort has been devoted to the development of good SAT encoding techniques for them. Some of these encodings first construct a Binary Decision…

Artificial Intelligence · Computer Science 2014-01-24 Ignasi Abío , Robert Nieuwenhuis , Albert Oliveras , Enric Rodriguez-Carbonell , Valentin Mayer-Eichberger
‹ Prev 1 2 3 10 Next ›