Polystability in positive characteristic and degree lower bounds for invariant rings
From MaRDI portal
Publication:2102173
DOI10.4171/JCA/66MaRDI QIDQ2102173
Publication date: 28 November 2022
Published in: Journal of Combinatorial Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.06838
Symbolic computation and algebraic computation (68W30) Combinatorial aspects of representation theory (05E10) Geometric invariant theory (14L24) Actions of groups on commutative rings; invariant theory (13A50)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial degree bounds for matrix semi-invariants
- Polar representations
- Reductive groups are geometrically reductive
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Instability in invariant theory
- Constructive invariant theory for tori
- Lower bounds on arithmetic circuits via partial derivatives
- Constructive non-commutative rank computation is in deterministic polynomial time
- Polynomial bound for the nilpotency index of finitely generated nil algebras
- Generating invariant rings of quivers in arbitrary characteristic
- Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling
- Degree bounds for semi-invariant rings of quivers
- Singular tuples of matrices is not a null cone (and the symmetries of algebraic varieties)
- An exponential lower bound for the degrees of invariants of cubic forms and tensor actions
- Algorithms for orbit closure separation for invariants and semi-invariants of matrices
- Orbit closures and invariants
- Two orbits: when is one in the closure of the other?
- Tripartite-to-bipartite entanglement transformation by stochastic local operations and classical communication and the structure of matrix spaces
- Invariants of a group in an affine ring
- Applications of matrix methods to the theory of lower bounds in computational complexity
- Polynomial bounds for rings of invariants
- Geometric complexity theory V: Efficient algorithms for Noether normalization
- Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing
- CLOSED ORBITS OF BOREL SUBGROUPS
- Polarization of Separating Invariants
- Observable Groups and Hilbert's Fourteenth Problem
- Geometric Invariant Theory
- Maximum Likelihood Estimation for Matrix Normal Models via Quiver Representations
- Maximum likelihood estimation for tensor normal models via castling transforms
- Regular and positive noncommutative rational functions
- Geometric complexity theory and tensor rank
- The Degree Formula for the Skew-Representations of the Symmetric Group
- XXVI.—The Monomial Expansion of Determinantal Symmetric Functions
This page was built for publication: Polystability in positive characteristic and degree lower bounds for invariant rings