Polynomial bounds for rings of invariants

DOI10.1090/S0002-9939-00-05698-7zbMath0969.13003OpenAlexW1666394328MaRDI QIDQ2701610

H. G. J. Derksen

Publication date: 19 February 2001

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-00-05698-7

zbMATH Keywords

reductive groupsdegree boundsinvariant rings of linearly reductive groups

Mathematics Subject Classification ID

Actions of groups on commutative rings; invariant theory (13A50)

Related Items (28)

On the centralizer of \(K\) in \(U(\mathfrak g)\) ⋮ Constructive non-commutative rank computation is in deterministic polynomial time ⋮ Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. ⋮ Degree bound for toric envelope of a linear algebraic group ⋮ Combinatorics, transvectants and superalgebras. An elementary constructive approach to Hilbert's finiteness theorem ⋮ Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory ⋮ Degree bounds for syzygies of invariants ⋮ Non-commutative Edmonds' problem and matrix semi-invariants ⋮ An exponential lower bound for the degrees of invariants of cubic forms and tensor actions ⋮ On the generalized Davenport constant and the Noether number ⋮ Generating invariant rings of quivers in arbitrary characteristic ⋮ Zero-separating invariants for finite groups ⋮ Stability of the Levi-Civita tensors and an Alon-Tarsi type theorem ⋮ Estimation under group actions: recovering orbits from invariants ⋮ Zero-Separating Invariants for Linear Algebraic Groups ⋮ Algorithms for orbit closure separation for invariants and semi-invariants of matrices ⋮ Degree bounds for semi-invariant rings of quivers ⋮ Polynomial degree bounds for matrix semi-invariants ⋮ Polynomial bounds for invariant functions separating orbits ⋮ The Hilbert series of measures of entanglement for 4 qubits ⋮ Constructive noncommmutative invariant theory ⋮ Operator scaling: theory and applications ⋮ Geometric complexity theory V: Efficient algorithms for Noether normalization ⋮ Weyl's polarization theorem in positive characteristic ⋮ From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces ⋮ Using SAGBI bases to compute invariants ⋮ Polystability in positive characteristic and degree lower bounds for invariant rings ⋮ Membership in Moment Polytopes is in NP and coNP

Uses Software

• INVAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Der kanonische Modul eines Invariantenrings. (The canonical module of a ring of invariants)
• Linear free resolutions and minimal multiplicity
• Groupe de Picard et nombres caractéristiques des variétés sphériques. (Picard group and characteristic numbers of spheric varieties.)
• The Hochster-Roberts theorem of invariant theory
• Computation of invariants for reductive groups
• Constructive invariant theory for tori
• Rings of invariants of reductive groups acting on regular rings are Cohen-Macaulay
• Semi-invariants, equivariants and algorithms
• Calculating invariant rings of finite groups over arbitrary fields
• THE CONSTRUCTIVE THEORY OF INVARIANTS
• Algorithms in invariant theory

This page was built for publication: Polynomial bounds for rings of invariants