کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4608947 | 1338392 | 2012 | 27 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Bit-size estimates for triangular sets in positive dimension
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
آنالیز ریاضی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
We give bit-size estimates for the coefficients appearing in triangular sets describing positive-dimensional algebraic sets defined over QQ. 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 the results by the first and the last author, which were confined to the case of dimension 0. Our strategy is to get back to dimension 0 by evaluation and interpolation 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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Complexity - Volume 28, Issue 1, February 2012, Pages 109–135
Journal: Journal of Complexity - Volume 28, Issue 1, February 2012, Pages 109–135
نویسندگان
Xavier Dahan, Abdulilah Kadri, Éric Schost,