Evaluation properties of invariant polynomials

Xavier Dahan; Éric Schost; Jie Wu

doi:10.1016/j.jsc.2008.12.002

Evaluation properties of invariant polynomials

Xavier Dahan, Éric Schost, Jie Wu

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

A polynomial invariant under the action of a finite group can be rewritten using generators of the invariant ring. We investigate the complexity aspects of this rewriting process; we show that evaluation techniques enable one to reach a polynomial cost.

Original language	English
Pages (from-to)	1592-1604
Number of pages	13
Journal	Journal of Symbolic Computation
Volume	44
Issue number	11
DOIs	https://doi.org/10.1016/j.jsc.2008.12.002
Publication status	Published - 2009 Nov
Externally published	Yes

Keywords

Complexity
Invariant polynomial
Lifting techniques
Straight-line program

ASJC Scopus subject areas

Algebra and Number Theory
Computational Mathematics

Access to Document

10.1016/j.jsc.2008.12.002

Cite this

@article{7f2313930bad453d9333354c99b259cb,

title = "Evaluation properties of invariant polynomials",

abstract = "A polynomial invariant under the action of a finite group can be rewritten using generators of the invariant ring. We investigate the complexity aspects of this rewriting process; we show that evaluation techniques enable one to reach a polynomial cost.",

keywords = "Complexity, Invariant polynomial, Lifting techniques, Straight-line program",

author = "Xavier Dahan and {\'E}ric Schost and Jie Wu",

year = "2009",

month = nov,

doi = "10.1016/j.jsc.2008.12.002",

language = "English",

volume = "44",

pages = "1592--1604",

journal = "Journal of Symbolic Computation",

issn = "0747-7171",

publisher = "Academic Press Inc.",

number = "11",

}

TY - JOUR

T1 - Evaluation properties of invariant polynomials

AU - Dahan, Xavier

AU - Schost, Éric

AU - Wu, Jie

PY - 2009/11

Y1 - 2009/11

N2 - A polynomial invariant under the action of a finite group can be rewritten using generators of the invariant ring. We investigate the complexity aspects of this rewriting process; we show that evaluation techniques enable one to reach a polynomial cost.

AB - A polynomial invariant under the action of a finite group can be rewritten using generators of the invariant ring. We investigate the complexity aspects of this rewriting process; we show that evaluation techniques enable one to reach a polynomial cost.

KW - Complexity

KW - Invariant polynomial

KW - Lifting techniques

KW - Straight-line program

UR - http://www.scopus.com/inward/record.url?scp=68549128598&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=68549128598&partnerID=8YFLogxK

U2 - 10.1016/j.jsc.2008.12.002

DO - 10.1016/j.jsc.2008.12.002

M3 - Article

AN - SCOPUS:68549128598

SN - 0747-7171

VL - 44

SP - 1592

EP - 1604

JO - Journal of Symbolic Computation

JF - Journal of Symbolic Computation

IS - 11

ER -

Evaluation properties of invariant polynomials

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this