2 papers
math.GR2026
Decidability of Krohn-Rhodes complexity of finite semigroups and automata
Stuart Margolis, John Rhodes, Anne Schilling
When decomposing a finite semigroup into a wreath product of groups and aperiodic semigroups, complexity measures the minimal number of groups that are needed. Determining an algor…
math.CO2025
Uncrowding algorithm for hook-valued tableaux
Jianping Pan, Joseph Pappe, Wencin Poh +1
Whereas set-valued tableaux are the combinatorial objects associated to stable Grothendieck polynomials, hook-valued tableaux are associated to stable canonical Grothendieck polyno…