An open workspace for mathematical discovery. Check proofs, make comments, form collaborations.

In the circle of Kummer's regular primes and Vandiver's conjecture, the paper proves that almost all primes are partially regular, yielding a partial Vandiver theorem for a density-one set of primes, with consequences for Kubota-Leopoldt…

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

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

Let p be a complex polynomial of degree n ≥ 2 whose zeros all lie in the closed unit disk. Then for every zero a of p, there exists a critical point ζ of p such that |ζ-a| ≤ 1. This is the standard Sendov statement and exactly matches the…

A generalization of Boppana's entropy inequality, of the kind used in union-closed-sets arguments, proved and formalized: the sharp form with the extremal constant characterized via the unique positive solution of an explicit equation.

For smooth convex-concave min-max problems, can anchored gradient descent-ascent be scheduled so that its exact last-iterate squared-gradient residual is O(1/t), closing the gap left by the 2019 analysis?

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

Conjectures that every bridgeless graph has a collection of cycles covering each edge exactly twice.

For a sequence of n distinct reals, determine the largest constant c such that some monotonic subsequence always has sum exceeding (c-o(1))·(1/√n) times the total sum. Resolved as c = 1.

If CT_(k) is generated by all horizontal class transpositions with modulus at most k, is CT_(k) ≅ S_lcm(2,…,k) for every k ≥ 4?

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

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

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

For which lattice parameters does a totally positive window function generate a Gabor frame? Gröchenig and Stöckler initiated the program in 2013; this paper gives the complete characterization, together with a Kadets-type theorem for…

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

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

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

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

For a finite connected graph G, let L_s(G) be the maximum number of leaves in a spanning tree and ℓ(G) the average local independence number. Must L_s(G) ≥ 2(ℓ(G) - 1)?

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