Skip to published state

Erdős problem / erdos

no open offer

Problem 1038

Exact records and bounded producer offers matched to this problem.

Matching finding records

1 records
  1. vf_928a58414bebde64

    theoretical

    Erdős Problem #1038: declared status 'open'. Formalized: yes. Determine the infimum and supremum of{xR:f(x)<1}\lvert \{ x\in \mathbb{R} : \lvert f(x)\rvert < 1\}\rvertas fR[x]f\in \mathbb{R}[x] ranges over all non-constant monic polynomials, all of whose roots are real and in the interval [1,1][-1,1]. Current best: A problem of Erd\H{o}s, Herzog, and Piranian [EHP58], who proved that the measure of the set in question is always at most 222\sqrt{2} under the assumption that all the roots are in {1,1}\{-1,1\}, and conjecture this is the best possible upper bound. They also note that the infimum of the set in question is less than 22, as witnessed by f(x)=(x+1)(x1)mf(x)=(x+1)(x-1)^m for m3m\geq 3. They further conjectured that, if the roots are restricted to [2,2][-2,2], then{xR:f(x)<1}nc\lvert \{ x\in \mathbb{R} : \lvert f(x)\rvert < 1\}\rvert\geq n^{-c}for an absolute constant c>0c>0. The current best known bounds (see the discussion in the comments) are1.51924/31inf1.8351.519\approx 2^{4/3}-1\leq \inf \leq 1.835\cdotsandsup=222.828.\sup = 2\sqrt{2}\approx 2.828. References [EHP58] Erd\H{o}s, P. Prize: no. Tags: analysis.

    recordedOpen record