Bit-size estimates for triangular sets in positive dimension

Details Bit-size estimates for triangular sets in positive dimension Bit-size estimates for triangular sets in positive dimension

2010-08-20

arxiv.org/abs/1008.3459v1

Computer Science

Symbolic Computation

37 pages

Scientific paper

We give bit-size estimates for the coefficients appearing in triangular sets describing positive-dimensional algebraic sets defined over Q. These estimates are worst case upper bounds; they depend only on the degree and height of the underlying algebraic sets. We illustrate the use of these results in the context of a modular algorithm. This extends results by the first and last author, which were confined to the case of dimension 0. Our strategy is to get back to dimension 0 by evaluation and inter- polation techniques. Even though the main tool (height theory) remains the same, new difficulties arise to control the growth of the coefficients during the interpolation process.

Affiliated with

Also associated with

No associations

Rating

Bit-size estimates for triangular sets in positive dimension 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 Bit-size estimates for triangular sets in positive dimension, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bit-size estimates for triangular sets in positive dimension will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-80633