Algorithms for orbit closure separation for invariants and semi-invariants of matrices
Abstract
We consider two group actions on m-tuples of n × n matrices. The first is simultaneous conjugation by GLn and the second is the left-right action of SLn × SLn. We give efficient algorithms to decide if the orbit closures of two points intersect. We also improve the known bounds for the degree of separating invariants in these cases.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.