From Tarski's Plank Problem to Simultaneous Approximation. Issue 6 (1st June 2017)

• Record Type: Journal Article
• Authors: Kupavskii, Andrey; Pach, János
• Is Part Of: American Mathematical Monthly. Volume 124:Issue 6(2017)
• Page Start: 494
• Page End: 505
• Publication Date: 2017-06-01
• Subjects: Mathematics -- Periodicals; 510.5
• DOI: 10.4169/amer.math.monthly.124.6.494
• Languages: English
• ISSNs: 0002-9890

Abstract

Abstract: A slab (or plank) is the part of the d -dimensional Euclidean space that lies between two parallel hyperplanes. The distance between the these hyperplanes is called the width of the slab. It is conjectured that the members of any infinite family of slabs with divergent total width can be translated so that the translates together cover the whole d -dimensional space. We prove a slightly weaker version of this conjecture, which can be regarded as a converse of Bang's theorem, also known as Tarski's plank problem. This result enables us to settle an old conjecture of Makai and Pach on simultaneous approximation of polynomials. We say that an infinite sequence S of positive numbers controls all polynomials of degree at most d if there exists a sequence of points in the plane whose x -coordinates form the sequence S, such that the graph of every polynomial of degree at most d passes within vertical distance 1 from at least one of the points. We prove that a sequence S has this property if and only if the sum of the reciprocals of the d th powers of its elements is divergent.