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
Parents
6
On table algebras and applications to finite group theory
Zvi Arad, Harvey I. Blau · Journal of Algebra · 1991 · 85 citations
A note on balanced bipartitions
Baogang Xu, Juan Yan, Xingxing Yu · Discrete Mathematics · 2010 · 29 citations
1–5 of 6
11
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 11
7

University of Padua
Padua, Italy
1 h-index
1 publications
29 citations

Bar-Ilan University
Ramat Gan, Israel
1 h-index
1 publications
85 citations
Georgia Institute of Technology
Atlanta, United States
1 h-index
1 publications
29 citations
Carnegie Mellon University
Pittsburgh, United States
1 h-index
1 publications
29 citations
Nanjing Normal University
Nanjing, China
1 h-index
2 publications
58 citations

Northern Illinois University
DeKalb, United States
1 h-index
1 publications
85 citations
Eastern Kentucky University
Richmond, United States
1 h-index
1 publications
20 citations
1–7 of 7
2 publications · 105 citations
2
h-index
1 publications · 29 citations
1
h-index
Repository · 1 publications · 11 citations
1
h-index
1 publications · 29 citations
1
h-index
1–4