Evaluation properties of invariant polynomials

DOI10.1016/J.JSC.2008.12.002MaRDI QIDQ731933zbMATHOpenAlexFDO

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

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)

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
• Publication:3218224
• On the existence and number of invariant polynomials
• Polynomial invariants by linear algebra

Cites work

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

Cited in

(3)

• scientific article; zbMATH DE number 7559090 (Why is no real title available?)
• A rewriting technique for universal polynomial invariants
• Minimal generating sets of non-modular invariant rings of finite groups

Describes a project that uses

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)