加载中…
The Littlewood conjecture, proven by Konyagin and McGehee-Pigno-Smith in the 1980s, states that if is a finite set of integers with then for some absolute constant . We explore what structure must have if for some constant . Under such an assumption we prove, for instance, that contains a subset with such that . As a consequence, for any , if is sufficiently large depending on and , then must contain an arithmetic progression of length . A byproduct of our analysis is a (slightly) improved bound for the constant .

生成讲解博客的中文版本

生成AI智能校验的中文版本