Displaying similar documents to “Automated proofs of upper bounds on the running time of splitting algorithms.”

Lower Bounds on the Directed Sweepwidth of Planar Shapes

Markov, Minko, Haralampiev, Vladislav, Georgiev, Georgi (2015)

Serdica Journal of Computing

Similarity:

We investigate a recently introduced width measure of planar shapes called sweepwidth and prove a lower bound theorem on the sweepwidth.

Heights, regulators and Schinzel's determinant inequality

Shabnam Akhtari, Jeffrey D. Vaaler (2016)

Acta Arithmetica

Similarity:

We prove inequalities that compare the size of an S-regulator with a product of heights of multiplicatively independent S-units. Our upper bound for the S-regulator follows from a general upper bound for the determinant of a real matrix proved by Schinzel. The lower bound for the S-regulator follows from Minkowski's theorem on successive minima and a volume formula proved by Meyer and Pajor. We establish similar upper bounds for the relative regulator of an extension l/k of number fields. ...