Evaluation properties of invariant polynomials

DOI10.1016/J.JSC.2008.12.002zbMATH Open1174.13006OpenAlexW1972071236MaRDI QIDQ731933FDOQ731933

Authors: Xavier Dahan, Éric Schost, J. Wu 

Publication date: 9 October 2009

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2008.12.002

Recommendations

• On invariants of polynomial functions
• Invariant Polynomials and Related Tests
• Polynomial invariants are polynomial
• Invariant sets for polynomials
• A note on invariant polynomials
• Invariant polynomials and Molien functions
• EVALUATION PROPERTIES OF SYMMETRIC POLYNOMIALS
• scientific article; zbMATH DE number 3884282
• On the existence and number of invariant polynomials
• Polynomial invariants by linear algebra

zbMATH Keywords

complexityinvariant polynomialstraight-line programlifting techniques

Mathematics Subject Classification ID

Actions of groups on commutative rings; invariant theory (13A50) Computational aspects and applications of commutative rings (13P99)

Cites Work

• Computational invariant theory
• Straight-line programs in geometric elimination theory
• Title not available (Why is that?)
• A Gröbner free alternative for polynomial system solving
• Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• On computing the determinant in small parallel time using a small number of processors
• Algorithms in invariant theory
• Greatest common divisors of polynomials given by straight-line programs
• Zeros of equivariant vector fields: Algorithms for an invariant approach
• Lower bounds for diophantine approximations
• Title not available (Why is that?)
• Deformation techniques for efficient polynomial equation solving.
• Advances in Cryptology - EUROCRYPT 2004
• Title not available (Why is that?)
• Computing combinatorial decompositions of rings
• On the stability of Gröbner bases under specializations
• EVALUATION PROPERTIES OF SYMMETRIC POLYNOMIALS
• Solving a system of algebraic equations with symmetries
• Semi-invariants, equivariants and algorithms

Cited In (3)

• Minimal generating sets of non-modular invariant rings of finite groups
• A rewriting technique for universal polynomial invariants
• Title not available (Why is that?)

Uses Software

• Kronecker

This page was built for publication: Evaluation properties of invariant polynomials

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