Two Erdős problems on lacunary sequences: Chromatic number and Diophantine approximation

DOI10.1112/blms/bdp126zbMath1215.05074arXiv0706.0223OpenAlexW3102739242MaRDI QIDQ3552164

Yuval Peres, Wilhelm Schlag

Publication date: 13 April 2010

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0706.0223

zbMATH Keywords

Lovász local lemmaDiophantine approximation problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Small fractional parts of polynomials and generalizations (11J54) Lacunary series of trigonometric and other functions; Riesz products (42A55)

Related Items (16)

Correlation among runners and some results on the lonely runner conjecture ⋮ A probabilistic approach to consecutive pattern avoiding in permutations ⋮ Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs ⋮ Sublacunary sequences that are strong sweeping out ⋮ Attacks and alignments: rooks, set partitions, and permutations ⋮ On Furstenberg's Diophantine result ⋮ On fractional parts of powers of real numbers close to 1 ⋮ The lonely runner problem for lacunary sequences ⋮ Unnamed Item ⋮ Quantitative uniform distribution results for geometric progressions ⋮ Diophantine approximations and directional discrepancy of rotated lattices ⋮ Highly nonrepetitive sequences: Winning strategies from the local lemma ⋮ On the law of the iterated logarithm for permuted lacunary sequences ⋮ Badly approximable numbers and Littlewood-type problems ⋮ SOME REFINED RESULTS ON THE MIXED LITTLEWOOD CONJECTURE FOR PSEUDO-ABSOLUTE VALUES ⋮ The lefthanded local lemma characterizes chordal dependency graphs

This page was built for publication: Two Erdős problems on lacunary sequences: Chromatic number and Diophantine approximation