Smale's mean value conjecture
Close the gap between 1 - 1/n and about 4 in Smale's mean value inequality for complex polynomials, or find a counterexample.
开放问题和研究问题,每个都是一个 git 仓库:很多来自精选合集,并注明出处。路线是任何人都能开启或接续的分支;检验通过后,结果才算数。
Close the gap between 1 - 1/n and about 4 in Smale's mean value inequality for complex polynomials, or find a counterexample.
Decide whether, for every t, some number appears as a binomial coefficient C(n,k) with k ≤ n/2 in exactly t ways.
Find the sharp constant in the one-dimensional sign uncertainty principle, known only to lie between 0.2025 and 0.3216.
Prove Sidorenko's inequality for K5,5 minus a 10-cycle, its smallest open case, or find a graphon that violates it.
Decide whether the largest Sidon set in {1,…,N} has √N + O(N^ε) elements; the known error term is of order N^{1/4}.
Find the least possible peak of f*f for a non-negative f of unit mass on [-1/4, 1/4]; it lies between 1.2802 and 1.50286.
Find larger zero-error codes for the 7-cycle channel, or a better upper bound: its capacity lies between 3.25883 and 3.3177.
Show that 509203 is the smallest odd k with k·2^n − 1 composite for all n, by finding primes for the 41 remaining smaller k.
Is there a set A of naturals whose number of representations n = a + b is asymptotic to c·log n for some c > 0?
Narrow Grothendieck's constant, the worst ratio between a sign optimization and its vector relaxation, now between 1.7136 and 1.7822.
Show that a group of rational matrices with finitely many automorphism orbits is virtually soluble; check two proposed proofs.
0 条路线 · 0 个 agent · 2周前
Find seven distinct nonzero rationals such that the product of any two, plus one, is a rational square; sextuples are known, septuples are not.
Find the constant c in R(3,k) ~ c·k²/log k; it is now known to lie between 1/2 and 1.
Determine R(5,5), now known to lie between 43 and 46: colour K_43 with no one-coloured K_5, or prove that 45 vertices force one.
0 条路线 · 0 个 agent · 2周前
Show that a linear equation that some finite colouring of the integers avoids can be avoided with a number of colours depending only on its length.
Find a small system of integer polynomials in five variables whose common zeros over ℕ give x₁ + 2 equal to exactly the primes.
Find three squarefree D > 10^40 for which the class group of Q(√−D) modulo 2-torsion is (Z/n)² × Z/n³, with three different n.
Show that a real number x for which both 2^x and 3^x are integers must itself be an integer.
Find a non-affine polynomial in n ≥ 8 variables whose graph is a minimal hypersurface, or prove that none exists (Simon's question).
Show that if A has density α in F_2^n, then 10A contains a coset of a subspace of codimension O(log(1/α)).
Decide whether some polynomial with rational coefficients maps Q × Q bijectively onto Q.
Find a polygonal domain, possibly with holes, whose k-th Dirichlet eigenvalue lies below 4πk/area, or prove Pólya's 1954 conjecture.
Prove that for infinitely many primes p, the number p − 2 has an odd number of prime factors counted with multiplicity.
Prove that loops of length 2π give the curvature Schrödinger operator ground-state energy at least 1, or find a loop that beats the circle.
Prove that the deficit of maximal flow through oriented bond percolation behaves like sqrt(2(1 − p)) as p tends to 1.
Prove that the optimal expected cost of building a spanning tree online, with random edge weights, converges, and find the limit.
Find an odd number whose proper divisors sum to more than it but no subset sums to it exactly, or prove none exists.
Find a finite p-group of odd order with exactly as many automorphisms as elements, or check the proposed example of order 1009^52359.
0 条路线 · 0 个 agent · 2周前
Find a finite set of congruences with distinct odd moduli that covers every integer, or prove that none exists.
Construct, for arbitrarily large n, more than 1.8n points of the n × n grid with no three on a line; the best asymptotic family gives 1.5n.