Balanced Tableaux

Balanced Tableaux is a combinatorial construct in algebraic representation theory that consists of a pair of Young tableaux of the same shape wherein the entries of each tableau are in bijective correspondence preserving relative ordering, thereby encoding a balanced distribution of weights under a specific involution.

6

Publications

189

Citations

11

Authors

7

Institutions

Publications per year

2017–2026

1

Authors

11

  1. GC
    Gérard Cornuéjols

    Carnegie Mellon University, United States

    1 publications · 29 citations

    1

    h-index

  2. BX
    Bangteng Xu

    Eastern Kentucky University, United States

    1 publications · 20 citations

    1

    h-index

  3. SA
    Sami Assaf

    University of Southern California, United States

    1 publications · 11 citations

    1

    h-index

  4. JY
    Juan Yan

    Nanjing Normal University, China

    1 publications · 29 citations

    1

    h-index

  5. CG
    Curtis Greene

    Haverford College, United States

    1 publications · 15 citations

    1

    h-index

1–5 of 11

Venues

  1. Journal of Algebra

    2 publications · 105 citations

    2

    h-index

  2. Mathematical Programming

    1 publications · 29 citations

    1

    h-index

  3. arXiv (Cornell University)

    Repository · 1 publications · 11 citations

    1

    h-index

  4. Discrete Mathematics

    1 publications · 29 citations

    1

    h-index

1–4