English

Folding rotationally symmetrical tableaux via webs

Combinatorics 2022-07-08 v2

Abstract

Rectangular standard Young tableaux with 2 or 3 rows are in bijection with Uq(sl2)U_q(\mathfrak{sl}_2)-webs and Uq(sl3)U_q(\mathfrak{sl}_3)-webs respectively. When WW is a web with a reflection symmetry, the corresponding tableau TWT_W has a rotational symmetry. Folding TWT_W transforms it into a domino tableau DWD_W. We study the relationships between these correspondences. For 2-row tableaux, folding a rotationally symmetric tableau corresponds to "literally folding" the web along its axis of symmetry. For 33-row tableaux, we give simple algorithms, which provide direct bijective maps between symmetrical webs and domino tableaux (in both directions). These details of these algorithms reflect the intuitive idea that DWD_W corresponds to "WW modulo symmetry".

Keywords

Cite

@article{arxiv.2206.10003,
  title  = {Folding rotationally symmetrical tableaux via webs},
  author = {Kevin Purbhoo and Shelley Wu},
  journal= {arXiv preprint arXiv:2206.10003},
  year   = {2022}
}

Comments

30 pages, 20 figures, minor corrections (references and typographical errors)

R2 v1 2026-06-24T11:57:44.911Z