Problems

Adjamagbo's positive-characteristic refinement of the Jacobian conjecture asks that a polynomial endomorphism with unit Jacobian determinant whose induced function-field extension has degree prime to the characteristic be an automorphism.…

In the all-heads coin game a player starts with n coins, each showing heads with probability p; each round all remaining coins are flipped, the player must set aside at least one head (losing if none shows), and wins once all coins are set…

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

Let L^nf be the Lagrange interpolation polynomials of a continuous f on the Chebyshev nodes. Prove that, for any closed A⊆ [-1,1], there exists a continuous function f such that A is the set of limit points of L^nf(x).

Let G be a simple connected graph on n≥ 5 vertices. If the maximum over all vertices v of ℓ(v) - the independence number of the subgraph induced by the open neighborhood N(v) - is at most 1, must G be well totally dominated? Answered…

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.

If g_3(n) is the largest size of A ⊆ [1,n] with fewer than three representations of every product a_1 a_2, does its conjectured second-order normalized term converge? The candidate proof gives an explicit limit constant.

Does the conjectured universal formula for normalized alternating syzygy power sums of numerical semigroup rings hold for every index?

Sixteen previously unknown exact values, plus three that confirm the sibling theorem entries' predictions computationally, across five ordered-pattern families (P^alt, S^sc, C^mon, M^nest, K) under dihedral and reflective group actions -…

For every connected graph G, is α(G) ≤ ⌊ b(G) - log(ecc_avg(G)) ⌋, where b(G) is the largest induced-bipartite-subgraph order? An 11-vertex counterexample - a triangle with four leaves on each of two vertices - has α = 9 against bound 8.

For unit-modulus complex numbers z_i, let p_n(z)=∏_i≤ n(z-z_i) and M_n=max_|z|=1|p_n(z)|. Erdős's prize question: is there c>0 with ∑_k≤ n M_k > n^1+c?

For odd k with gcd(n,k) = gcd(n+1,k) = 1, is N_k(n) ≡ ⌊ (k+1)/4 ⌋ pmod 2, where N_k(n) counts pairs 1 ≤ b_i ≤ (k-1)/2 with b_1 + b_2 ≥ (k+1)/2 and b_2 ≡ n b_1 pmod k? Conjectured by Chen and Gendron; its proof removes a conditional step in…

If the power graph of a finite group contains no induced path on four vertices, must it also contain no induced cycle of length at least four - that is, is every cograph power graph chordal?

Let A⊂N be infinite. Must there exist some k≥ 1 such that almost all integers have a divisor of the form a+k for some a∈ A? The question as posed follows negatively from Davenport–Erdős (1951). The AI result settles Tenenbaum's harder…

What is the maximum size of a binary code of given minimum distance? The linear-programming bounds of McEliece, Rodemich, Rumsey and Welch (1977) resisted improvement for half a century. The new upper bounds are exponentially stronger at…

Albertson and Berman conjectured that for every simple planar graph G on n vertices, the largest vertex set inducing a forest has size at least n/2. The standing lower bound since the same year has been Borodin's 2n/5, from his acyclic…

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