The boundary of the orbit of the 3-by-3 determinant polynomial

DOI10.1016/J.CRMA.2016.07.002zbMATH Open1352.14031arXiv1512.02437OpenAlexW2193111857MaRDI QIDQ309769FDOQ309769

Authors: Jesko Hüttenhain, Pierre Lairez 

Publication date: 7 September 2016

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Abstract: We consider the 3 by 3 determinant polynomial and we describe the limit points of the set of all polynomials obtained from the determinant polynomial by linear change of variables. This answers a question of J. M. Landsberg.

Full work available at URL: https://arxiv.org/abs/1512.02437

Recommendations

• Geometry of orbits of permanents and determinants
• Limits of PGL(3)-translates of plane curves. II
• A lower bound for the determinantal complexity of a hypersurface
• Binary determinantal complexity
• Limits of PGL(3)-translates of plane curves. I

zbMATH Keywords

computational complexityalgebraic geometrydeterminantgroup actionsgeometric complexity theorystabilizer

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Determinants, permanents, traces, other special matrix functions (15A15) Group actions on varieties or schemes (quotients) (14L30) Geometric invariant theory (14L24) Algebraic geometry methods for problems in mechanics (70G55) Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• Invariant Theory
• Éléments de géométrie algébrique. IV: Étude locale des schémas et des morphismes de schémas (Quatrième partie). Rédigé avec la colloboration de J. Dieudonné
• Vector spaces of matrices of low rank
• Sur une généralisation du groupe orthogonal à quatre variables
• Title not available (Why is that?)
• On matrix spaces with zero determinant
• Hypersurfaces with degenerate duals and the geometric complexity theory program
• Geometric complexity theory: an introduction for geometers
• The Hilbert null-cone on tuples of matrices and bilinear forms
• Geometric complexity theory. I: An approach to the P vs. NP and related problems
• The Geometry of Schemes

Cited In (4)

• On the Symmetries of and Equivalence Test for Design Polynomials.
• Uniform Determinantal Representations
• No occurrence obstructions in geometric complexity theory
• Title not available (Why is that?)

This page was built for publication: The boundary of the orbit of the 3-by-3 determinant polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q309769)