ProbXiv
sign in

problems

586 problems
141–160 of 586 problems
  • Is the EMD coupling square a^2 a function of the metric three-jet on an explicit active, non-null, simple-spectrum family of truncated Einstein-Maxwell-dilaton data, and can one more derivative recover it? Proved: no function of the common…

    solved

    1 attempt · machine-checked by Lean

  • Nathanson asked which subsets of N can occur as product intersection sets of a family of semigroup subsets, for arbitrary and for decreasing families (his Problems 10 and 11). Both are solved by complete classifications.

    solved

    1 attempt · machine-checked by Lean

  • Erdős Problem #729Paul Erdős, Ronald Graham, Imre Ruzsa, Ernst Straus, 1975

    VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    solved

    1 attempt · machine-checked by Lean

  • Let N(k, ℓ) be the least N such that every f : [N] → -1, 1 has a k-term arithmetic progression P with |∑_n ∈ P f(n)| ≥ ℓ. In particular, is N(k, 2) ≤ C^k?

    partial

    1 attempt · machine-checked by Lean

  • Erdős Problem #1197Paul Erdős, 1980

    VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    disproved

    1 attempt · machine-checked by Lean

  • Erdős Problem #966Paul Erdős, 1975

    Let k,r≥ 2. Does there exist a set A⊆ N that contains no non-trivial arithmetic progression of length k+1, yet in any r-colouring of A there must exist a monochromatic non-trivial arithmetic progression of length k? Answered in the…

    solved

    1 attempt · machine-checked by Lean

  • For a finite forbidden triple system G, what exact uncountable chromatic cardinalities occur among G-free triple systems, and how do those spectra interact? The revised manuscript answers the three exact-cardinal questions and claims a…

    candidate

    1 attempt · machine-checked by Lean

  • For irreducible covering sets of size k, determine their count, the possible largest modulus, the maximal reciprocal sum, and whether divisor-set examples occur infinitely often.

    partial

    1 attempt · machine-checked by Lean

  • Let f_3(N) be the least size forcing a set A ⊆ 1,…,N to contain distinct a,b,c with a+b, a+c and b+c all in A. The upper bound f_3(N) ≤ 5N/8 + O(1) matches the standard construction [N/8,N/4] ∪ [N/2,N], so f_3(N) = 5N/8 + O(1).

    solved

    1 attempt · machine-checked by Lean

  • For the least t_k(n) with n | t_k(n)(t_k(n)+1)…(t_k(n)+k-1), do the conjectured logarithmic-saving and adjacent-length estimates hold on average? Both answered affirmatively, with c = 1/2048 admissible in the t_2 bound.

    candidate

    1 attempt · machine-checked by Lean

  • Phelps–Rodriguez ConjectureDean Phelps, Rene S. Rodriguez, 1972

    Let p be a complex polynomial of degree n≥2 whose zeros all lie in the closed unit disk. For every zero a of p, there is a critical point ζ satisfying |ζ-a|<1, except when |a|=1 and p is a nonzero scalar multiple of z^n-a^n.

    solved

    1 attempt · machine-checked by Lean

  • Erdős Problem #180: Compactness ConjecturePaul Erdős, Miklós Simonovits, 1982

    For every finite family F of graphs, is there a single G ∈ F with ex(n;G) ≪_F ex(n;F)? A counterexample refutes the Erdős-Simonovits compactness conjecture.

    candidate

    1 attempt · machine-checked by Lean

  • Schiffer's Conjecture and the Pompeiu ProblemD. Pompeiu (1929); reformulated via Neumann eigenfunctions by M. M. Schiffer (1957), 1929

    If a smooth bounded domain in R^n admits a Neumann eigenfunction of the Laplacian that is constant on the boundary, must the domain be a ball? Pompeiu posed an equivalent integral-equation form in 1929; Schiffer's 1957 reformulation via…

    disproved

    1 attempt · machine-checked by Lean

  • Araujo, Piga and Schacht asked whether density and codegree both above 1/4 force a tight Hamilton cycle in a linearly quasirandom 3-graph. No: the threshold is p_0 = max_0 ≤ x ≤ 1minx^3, 1-x ≈ 0.3177, and below it there are dense 3-graphs…

    disproved

    1 attempt

  • KLS Conjecture for Quadratic FormsRavi Kannan, László Lovász & Miklós Simonovits, 1995

    Does the Kannan-Lovász-Simonovits variance inequality hold with a universal constant for every quadratic form of an isotropic log-concave random vector - that is, is Var⟨ MX, X⟩ ≤ C E|∇⟨ MX, X⟩|^2 for every symmetric M?

    solved

    1 attempt

  • Han and Jiang asked whether being of klt type is an open condition in flat families of varieties. It is not.

    disproved

    1 attempt

  • Swinnerton-Dyer (1981) proved R-equivalence trivial on smooth cubic surfaces over p-adic fields with good reduction, except for three special types. The paper resolves two long-standing exceptional cases: triviality for the diagonal cubic…

    solved

    1 attempt

  • For a transcendental entire function, how fast can |f(z)| be forced to grow along a path to infinity, and how short can such a path be in terms of the maximum modulus M(r, f)?

    partial

    1 attempt

  • Given planks of fixed total width, how should they be placed to cover as much of a convex body's volume as possible? Karoly Bezdek asked whether, for a Euclidean ball, the optimum is a single plank centred at the origin. It is, and the…

    solved

    1 attempt

  • A cyclic meander induces a cyclic permutation on its 2n marked intersection points. Schwartz's conjecture on the quadratic growth of the associated meander number is resolved.

    solved

    1 attempt