1 / 20

Some Progress on The Sweep Map Guoce Xin Capital Normal University (CNU)

Some Progress on The Sweep Map Guoce Xin Capital Normal University (CNU). Joint work with Adriano Garsia (UCSD) Joint work with Yingrui Zhang (CNU). Computer Algebra in Combinatorics Nov. 13-17, 2017. Outline. Human linear inverting algorithm for the sweep map on Fuss Dyck paths.

ksutherland
Download Presentation

Some Progress on The Sweep Map Guoce Xin Capital Normal University (CNU)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Some Progress on The Sweep Map Guoce Xin Capital Normal University (CNU) Joint work with Adriano Garsia (UCSD) Joint work with Yingrui Zhang (CNU) Computer Algebra in Combinatorics Nov. 13-17, 2017

  2. Outline • Human linear inverting algorithm for the sweep map on Fuss Dyck paths. • Standard Tableaux • About the sweep map on (m,n)-Dyck paths. • An extension of the Human algorithm. • An example using Tableaux

  3. 1 1 1 1 1 2 2 8 4 0 9 5 4 0 9 0

  4. 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 4 3 2 4 5 1 5 5 1 2 3 0 2 4 5 0 1 3 3 4 1 0 2 6 6 3 2 6 6 9 9 1 3 6 9 3 4 8 2 5 8 5 7 4 7 1 2 6 9 2 5 8 3 4 8 4 7 5 7

  5. 1 2 1 1 1 1 1 1 2 1 1 1 2 1 1 1 1 1 1 2 1 1 1 7 5 3 0 9 1 6 8 4 0 5 3 1 4 1 9 0 8 6 1 7 0 2 2 1 9 8 7 3 1 2 5 4 6 1 7 8 5 3 9 6 4 2 6

  6. 2 1 1 1 1 1 2 1 1 1 1 1 2 1 1 1 1 1 1 1 1 2 7 1 7 6 5 0 4 3 5 3 7 9 0 4 6 8 1 1 0 2 9 6 4 2 1 1 7 8 5 1 8 5 3 3 9 7

  7. 1 1 1 1 1 1 1 2 2 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 1 1 1 1 1 1 1 1 1 1 1 1 5 7 3 5 0 1 2 4 7 6 4 1 8 0 9 6 3 3 5 7 1 5 7 3 0 2 4 9 0 1 6 8 9 4 8 6 0 1 1 1 2 2 0 0 2 9 6 4 2 1 1 1 1 7 8 5 7 3 1 8 9 5 3 3 8 5 9 6 4 2 7 4 1 7 6 9 3 5 8

  8. 1 2 1 2 1 1 1 1 1 2 1 1 1 1 1 1 1 2 1 1 1 1 1 7 5 3 0 8 0 6 1 4 9 1 9 1 4 3 7 5 1 8 0 6 2 0 2 7 1 1 7 3 8 5 1 3 9 6 4 2 9 2 5 8 4 6

  9. Text Text Text Text Text Text Text Text Text Text Text Text

  10. Text Text

  11. Sweep map for (m,n)-Dyck paths:An example D A (7,5)-Dyck path Its sweep map image

  12. Known Results about the Sweep Map • The sweep map takes (m,n)-Dyck paths to (m,n)-Dyck paths. • The sweep map takes dinv to area, and area to bounce*. • Sweep map also appears in other context, such as core partitions. • ex-conjecture (over 10 years): the sweep map is a bijection (known for Fuss case), and the conjecture is extended. • Thomas-Williams proved the (general) conjecture for modulo sweep map. • Garsia-Xin give a geometric proof for (m,n)-Dyck paths.

  13. Problems on the sweep map • What is the combinatorial meaning of the bounce statistic, i.e. area of the preimage. • Is there a simple algorithm to invert the sweep map as for the Fuss case. • The bi-statistic (dinv,area) is joint symmetric, i.e., • Can we give a bijective proof? The joint symmetry property is only prove for the classical case. It is a consequence of the (m,n)-Shuffle conjecture, which is claimed to be proved. • Can we generalize the joint symmetry property.

  14. A puzzling (and frustrating) specialization

  15. Human linear algorithm extendsfor Dyck paths from (0,0) to (n,n) with steps How to Sweep Rank: add k after Sk, subtract 1 after W Dyck---nonnegative ranks Sort: small to large, right first for ties. 0 2 1 0 3 8 7 6 8 7 6 5 4 3 2 1 2 6 4 1 8 16 14 12 15 13 11 10 9 7 5 3

  16. How to invert the sweep map Filling rule: similar abcd condition Ranking rule Column: +1 First row: r(i)=r(i-1) 2 12 1 8 6 3 0 0 1 1 4 7 9 14 3 4 2 8 2 5 16 5 10 6 3 6 11 7 7 13 8 15

  17. Filling rule: similar abcd condition Ranking rule Column: +1 First row: r(i)=r(i-1) 12 2 1 8 3 6 0 0 1 1 7 4 9 14 3 4 2 2 5 8 16 5 6 10 3 6 11 7 7 13 8 15 Walking rule: same rank use large label 4 16 14 12 15 13 11 10 9 7 5 2 6 1 8 3

More Related