An Efficient Version of the Bombieri-Vaaler Lemma
نویسندگان
چکیده
In their celebrated paper On Siegel’s Lemma, Bombieri and Vaaler found an upper bound on the height of integer solutions of systems of linear Diophantine equations. Calculating the bound directly, however, requires exponential time. In this paper, we present the bound in a different form that can be computed in polynomial time. We also give an elementary (and arguably simpler) proof for the bound.
منابع مشابه
Ideal Constructions and Irrationality Measures of Roots of Algebraic Numbers
This paper addresses the problem of determining the best results one can expect using the Thue-Siegel method as developed by Bombieri in his equivariant approach to effective irrationality measures to roots of high order of algebraic numbers, in the non-archimedean setting. As an application, we show that this method, under a nonvanishing assumption for the auxiliary polynomial which replaces t...
متن کاملFuzzy Linear Programming and its Application for a Constructive Proof of a Fuzzy Version of Farkas Lemma
The main aim of this paper is to deal with a fuzzy version of Farkas lemma involving trapezoidal fuzzy numbers. In turns to that the fuzzy linear programming and duality theory on these problems can be used to provide a constructive proof for Farkas lemma. Keywords Farkas Lemma, Fuzzy Linear Programming, Duality, Ranking Functions.
متن کاملEfficient Removal without Efficient Regularity
Obtaining an efficient bound for the triangle removal lemma is one of the most outstanding open problems of extremal combinatorics. Perhaps the main bottleneck for achieving this goal is that triangle-free graphs can be highly unstructured. For example, triangle-free graphs might have only regular partitions (in the sense of Szemerédi) of tower-type size. And indeed, essentially all the graph p...
متن کاملImproved algorithmic versions of the Lovász Local Lemma
The Lovász Local Lemma is a powerful tool in combinatorics and computer science. The original version of the lemma was nonconstructive, and efficient algorithmic versions have been developed by Beck, Alon, Molloy & Reed, et al. In particular, the work of Molloy & Reed lets us automatically extract efficient versions of essentially any application of the symmetric version of the Local Lemma. How...
متن کاملDyson’s lemma with moving parts
In its original form [D], Dyson’s Lemma bounds the order of vanishing of a polynomial in two variables at a finite set of points and was used in studying rational approximations to a fixed algebraic irrational number. Bombieri [B] revived interest in Dyson’s Lemma and subsequently Esnault and Viehweg [EV] and Vojta [V1] vastly extended the scope of the result, to polynomials in several variable...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1707.05941 شماره
صفحات -
تاریخ انتشار 2017