Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. For a real number write for its fractional part, read in . An arc is a nonempty connected subset of , open, closed or half-open, and it is sum-free if for all . Let and be positive integers and , for instance the color classes of a -coloring. Suppose that for each there are a real number and a sum-free arc such that for every . Then
Each set with a sum-free arc is sum-free, so a coloring of this kind has no monochromatic solution to , equal summands allowed. Thus the least such that has no -coloring of this kind is at most .
Covers. The exponential question of Problem 483 for the -colorings of in which each color class lies in a single sum-free Bohr arc : for these colorings the exponential bound holds, since none exists once . The class contains Schur's tripling coloring by colors, of . A -coloring of with and no monochromatic solution therefore has a class lying in no single sum-free Bohr arc. The bound does not apply to general colorings: itself is not bounded by it, and the question whether , with the estimate of and whether tends to a finite limit, remains open.
Standing. L262 is author-recorded at tier 0: an elementary complete argument, a Dirichlet pigeonhole bound with an integer dilation moving each sum-free arc away from zero, using no external theorem, without independent examination or a Lean proof. The constant is not optimized, and no literature search for the observation is recorded. Catalog acceptance is pending.
Depends on. L262 (tier 0), which consumes no other native claim and no external theorem.