TL;DR
This paper discusses a specific subclass of tame problems in representation theory, focusing on classifying matrix pairs up to similarity, which helps distinguish between complex wild problems and more manageable tame ones.
Contribution
The paper identifies and analyzes a particular subclass of tame problems within the classification of matrix pairs, clarifying their structure and complexity.
Findings
Identifies a subclass of tame problems in matrix classification.
Provides criteria distinguishing tame from wild problems.
Enhances understanding of problem complexity in representation theory.
Abstract
In representation theory, the problem of classifying pairs of matrices up to simultaneous similarity is used as a measure of complexity; classification problems containing it are called wild problems, and the other are referred to as tame.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Differential Equations and Dynamical Systems · Mathematical and Theoretical Epidemiology and Ecology Models · Artificial Immune Systems Applications