AI Chat AI Image Generator AI Video Text to Speech

Algorithms for orbit closure separation for invariants and semi-invariants of matrices

01/06/2018

∙

by Harm Derksen, et al.

∙

∙

We consider two group actions on m-tuples of n × n matrices. The first is simultaneous conjugation by GL_n and the second is the left-right action of SL_n ×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.

Harm Derksen
11 publications
Visu Makam
15 publications

page 1

page 2

page 3

page 4

research

∙ 06/01/2021

Porous Invariants

We introduce the notion of porous invariants for multipath (or branching...

0 Engel Lefaucheux, et al. ∙

research

∙ 02/15/2021

Polynomial time algorithms in invariant theory for torus actions

An action of a group on a vector space partitions the latter into a set ...

0 Peter Bürgisser, et al. ∙

research

∙ 05/05/2022

Low Dimensional Invariant Embeddings for Universal Geometric Learning

This paper studies separating invariants: mappings on d-dimensional semi...

0 Nadav Dym, et al. ∙

research

∙ 02/27/2019

An exponential lower bound for the degrees of invariants of cubic forms and tensor actions

Using the Grosshans Principle, we develop a method for proving lower bou...

0 Harm Derksen, et al. ∙

research

∙ 01/22/2002

Structure from Motion: Theoretical Foundations of a Novel Approach Using Custom Built Invariants

We rephrase the problem of 3D reconstruction from images in terms of int...

0 Pierre-Louis Bazin, et al. ∙

research

∙ 07/31/2017

Rational invariants of ternary forms under the orthogonal group

In this article we determine a generating set of rational invariants of ...

0 Paul Görlach, et al. ∙

research

∙ 07/31/2017

Rational invariants of even ternary forms under the orthogonal group

In this article we determine a generating set of rational invariants of ...

0 Paul Görlach, et al. ∙