An Efficient Version of the Bombieri-Vaaler Lemma

07/19/2017
by   Jun Zhang, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/20/2018

Sub-exponential Upper Bound for #XSAT of some CNF Classes

We derive an upper bound on the number of models for exact satisfiabilit...
research
06/30/2019

Dimension is polynomial in height for posets with planar cover graphs

We show that height h posets that have planar cover graphs have dimensio...
research
02/22/2019

Characterizing PSPACE with shallow non-confluent P systems

In P systems with active membranes, the question of understanding the po...
research
03/20/2019

Identifying Maximal Non-Redundant Integer Cone Generators

A non-redundant integer cone generator (NICG) of dimension d is a set S ...
research
08/17/2022

Algorithmic reconstruction of discrete dynamics

Functional graphs (FG) allow to model under graph structures the behavio...
research
10/19/2020

Optimal Descartes' Rule of Signs for Circuits

We present an optimal version of Descartes' rule of signs to bound the n...
research
08/09/2021

Linear equations for unordered data vectors in [D]^k→Z^d

Following a recently considered generalisation of linear equations to un...

Please sign up or login with your details

Forgot password? Click here to reset