The separating variety for 2x2 matrix invariants
Jonathan Elmer

TL;DR
This paper investigates the minimal size of separating sets for invariants of 2x2 matrix tuples under group actions, establishing lower bounds and existence of smaller separating sets for larger n.
Contribution
It proves lower bounds on the size of separating sets for matrix invariants and shows that minimal generating sets are not always minimal as separating sets for n ≥ 4.
Findings
Any separating set has at least 5n-5 elements for n ≥ 3.
No separating set of size 4n-3 exists for n ≥ 3.
For n=3, the known minimal generating set is also minimal as a separating set.
Abstract
Let be a linear algebraic group acting linearly on a -variety , and let be the corresponding algebra of invariant polynomial functions. A separating set is a set of polynomials with the property that for all , if there exists separating and , then there exists separating and . In this article we consider the action of on the variety of -tuples of matrices by simultaneous conjugation. Minimal generating sets of are well-known, and . In recent work, Kaygorodov, Lopatin and Popov showed that for all , is a minimal separating set by inclusion, i.e. that no proper subset of is a separating set. This…
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
Topicsgraph theory and CDMA systems · Advanced Differential Equations and Dynamical Systems · Coding theory and cryptography
