Bounds for Heights of Integer Polynomial Factors
نویسندگان
چکیده
We d escribe new methods for the e s t imation of the b o u nds of the coeecients of proper divisors of integer polynomials in one v ariable. There exist classes of poly-nomials for which our estimates are better than those obtained using t he polynomial measure or the 2-weighted norm.
منابع مشابه
Global optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملExtension Complexity Lower Bounds for Mixed-Integer Extended Formulations
We prove that any mixed-integer linear extended formulation for the matching polytope of the complete graph on n vertices, with a polynomial number of constraints, requires Ω( √ n/logn) many integer variables. By known reductions, this result extends to the traveling salesman polytope. This lower bound has various implications regarding the existence of small mixed-integer mathematical formulat...
متن کاملExplicit Bounds for the Solutions of Elliptic Equations with Rational Coefficients
In this paper we give new, improved explicit upper bounds for the absolute values of the integer solutions and for the heights of S-integer solutions of elliptic equations over Q.
متن کاملINTEGERS 11 A ( 2011 ) Proceedings of Integers Conference 2009 HEIGHTS OF DIVISORS OF X n − 1
The height of a polynomial with integer coefficients is the largest coefficient in absolute value. Many papers have been written on the subject of bounding heights of cyclotomic polynomials. One result, due to H. Maier, gives a best possible upper bound of nψ(n) for almost all n, where ψ(n) is any function that approaches infinity as n → ∞. We will discuss the related problem of bounding the ma...
متن کاملFinding Bounds on Ehrhart Quasi-Polynomials
Numerous problems in program analysis, can be reduced to finding bounds on the number of integer points in a convex set, or the solution of a more general polyhedral counting problem. For a large class of applications the solution of such a counting problem can be expressed as a piecewise Ehrhart quasi-polynomial in the parameters. This work presentsmethods to find bounds on quasi-polynomials o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. UCS
دوره 1 شماره
صفحات -
تاریخ انتشار 1995