Combinatorial Algorithms for Binary Operations on LR-tableaux with Entries Equal to 1 with Applications to Nilpotent Linear Operators
From MaRDI portal
Publication:5134351
DOI10.3233/FI-2020-1935zbMath1496.05186arXiv2004.10602MaRDI QIDQ5134351
Justyna Kosakowska, Mariusz Kaniecki
Publication date: 16 November 2020
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.10602
partitions; generic extensions; invariant subspaces; Littlewood-Richardson tableaux; combinatorial algorithms; nilpotent linear operators; degeneration partial order; pickets
68W40: Analysis of algorithms
05A15: Exact enumeration problems, generating functions
05A17: Combinatorial aspects of partitions of integers
05E10: Combinatorial aspects of representation theory