2000 character limit reached
Algorithms for orbit closure separation for invariants and semi-invariants of matrices
Published 6 Jan 2018 in math.RA, cs.CC, and math.AC | (1801.02043v2)
Abstract: We consider two group actions on $m$-tuples of $n \times n$ matrices. The first is simultaneous conjugation by $\operatorname{GL}_n$ and the second is the left-right action of $\operatorname{SL}_n \times \operatorname{SL}_n$. 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.