skip to main content

Attention:

The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 5:00 PM ET until 11:00 PM ET on Friday, June 21 due to maintenance. We apologize for the inconvenience.


Title: Lenart's Bijection via Bumpless Pipe Dreams
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 the former two sets. In this note we show for vexillary permutations that the Gao-Huang bijection preserves the associated tableaux, giving a new proof of Lenart's result. Our methods extend to give a recording tableau for any bumpless pipe dream.  more » « less
Award ID(s):
2054423
NSF-PAR ID:
10414452
Author(s) / Creator(s):
;
Date Published:
Journal Name:
The Electronic Journal of Combinatorics
Volume:
30
Issue:
1
ISSN:
1077-8926
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract

    We characterize totally symmetric self-complementary plane partitions (TSSCPP) as bounded compatible sequences satisfying a Yamanouchi-like condition. As such, they are in bijection with certain pipe dreams. Using this characterization and the recent bijection of Gao–Huang between reduced pipe dreams and reduced bumpless pipe dreams, we give a bijection between alternating sign matrices and TSSCPP in the reduced, 1432-avoiding case. We also give a different bijection in the 1432- and 2143-avoiding case that preserves natural poset structures on the associated pipe dreams and bumpless pipe dreams.

     
    more » « less
  2. Abstract

    We say that two permutations $\pi $ and $\rho $ have separated descents at position $k$ if $\pi $ has no descents before position $k$ and $\rho $ has no descents after position $k$. We give a counting formula, in terms of reduced word tableaux, for computing the structure constants of products of Schubert polynomials indexed by permutations with separated descents, and recognize that these structure constants are certain Edelman–Greene coefficients. Our approach uses generalizations of Schützenberger’s jeu de taquin algorithm and the Edelman–Greene correspondence via bumpless pipe dreams.

     
    more » « less
  3. Abstract We present a direct bijection between reduced pipe dreams and reduced bumpless pipe dreams (BPDs) by interpreting reduced compatible sequences on BPDs and show that this is the unique bijection preserving bijective realizations of Monk’s formula, establishing its canonical nature. 
    more » « less
  4. null (Ed.)
    We give bijective proofs of Monk’s rule for Schubert and double Schubert polynomials computed with bumpless pipe dreams. In particular, they specialize to bijective proofs of transition and cotransition formulas of Schubert and double Schubert polynomials, which can be used to establish bijections with ordinary pipe dreams. 
    more » « less
  5. We give bijective proofs of Monk's rule for Schubert and double Schubert polynomials computed with bumpless pipe dreams. In particular, they specialize to bijective proofs of transition and cotransition formulas of Schubert and double Schubert polynomials, which can be used to establish bijections with ordinary pipe dreams. 
    more » « less