Polynomial Bounds for Invariant Functions Separating Orbits

Details Polynomial Bounds for Invariant Functions Separating Orbits Polynomial Bounds for Invariant Functions Separating Orbits

2010-05-18

arxiv.org/abs/1005.3082v2

Mathematics

Representation Theory

Clarified proofs, algorithms, and notation. Corrected typos

Scientific paper

Consider the representations of an algebraic group G. In general, polynomial invariant functions may fail to separate orbits. The invariant subring may not be finitely generated, or the number and complexity of the generators may grow rapidly with the size of the representation. We instead study "constructible" functions defined by straight line programs in the polynomial ring, with a new "quasi-inverse" that computes the inverse of a function where defined. We write straight line programs defining constructible functions that separate the orbits of G. The number of these programs and their length have polynomial bounds in the parameters of the representation.

Affiliated with

Also associated with

No associations

Rating

Polynomial Bounds for Invariant Functions Separating Orbits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Polynomial Bounds for Invariant Functions Separating Orbits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polynomial Bounds for Invariant Functions Separating Orbits will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-57330