Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Does there exist a polynomial f(x)∈Z[x] such that all the sums f(a)+f(b) with a<b nonnegative integers are distinct?
For α>0 and k∈ N, define C_k(α) as the normalized limiting variance of the k-fold divisor function in short intervals, and let γ_k(α) be the corresponding piecewise-polynomial function. Divisor variance conjecture. For k≥1 and α>0,…
Eta-products and root systems and holomorphic anomaly equation As it turns out mock modular forms (such as eta-products) do not satisfy the holomorphic anaomaly equation. Do they satisfy other differential equations?
Let f(n) be the minimal integer m such that n is the sum of the k smallest divisors of m for some k≥ 1. Is it true that f(n)=o(n)? Or is this true only for almost all n, and limsup f(n)/n=∞?
For each integer r≥ 1, let T(r) denote the set of r-arithmetic triples. Nonemptiness conjecture. The set T(r) is nonempty for all r≥ 1. The preceding computations give nonempty sets for every r≤ 15, but no general proof or convincing…
(D. Ulmer) 2) Two relevant references for this problem are i) de Jong, Johan; Noot, Rutger. Jacobians with complex multiplication. Arith-metic algebraic geometry (Texel, 1989), 177-192, Progr. Math., 89, Birkhuser Boston, Boston, MA, 1991.…
Let (c_n) be the coefficient sequence in the orthorecursive expansion of unity. There are real constants δ, φ, A, and P, and a constant ε>0. Logarithmic-phase asymptotic conjecture. For all n>0, c_n=A/n^δsin(Pln n+φ)+O(n^-δ-ε). This gives…
Conjecture Suppose k runners having distinct constant speeds start at a common point and run laps on a circular track with circumference 1. Then for any given runner, there is a time at which that runner is distance at least 1/k (along the…
Is -1 in the spectrum of a Liouville system? Equivalently, can we show that ∑_n≤ X (-1)^n-1 λ(n+h_1) … λ(n+h_k)/n = o(log X)?
New Mersenne conjecture: for any odd natural number p, if any two of the three conditions p = 2^k ± 1 or p = 4^k ± 3, 2^p - 1 is prime, and (2^p + 1)/3 is prime are true, then the third condition is also true.
An extended Fermat prime is a prime p such that p-1 = ∏_i=1^ℓ p_i^a_i where, for 1 ≤ i ≤ ℓ, p_i - 1 = ∏_j=1^i-1p_j^a_i. Extended Fermat prime infinitude conjecture. There exists an extended Fermat prime p such that (p-1)p^k+1 is an…
Call a polynomial p ∈ Q[x] rationally derived if all roots of p and the nonzero derivatives of p are rational. Conjecture There does not exist a quartic rationally derived polynomial p ∈ Q[x] with four distinct roots.
Let Z denote the ring of integers and Q the field of rational numbers. A subset of Q is Diophantine if it is defined by the existence of solutions to a polynomial equation over Q. The non-Diophantineness conjecture. There is no Diophantine…
Let p≥ 3 be prime and set N_p=2^p-1. Write ω(N_p) for the number of distinct prime factors of N_p. The distinct-factor bound conjecture. There exists p_0 such that, for every prime p>p_0, ω(N_p)<1.36log p. This is motivated by sieve…
For coprime integers a, b, c with a + b = c, is c usually not much larger than the product of distinct primes dividing abc?
Classify the finite orbits of T_g,n on the character varieties M(Σ_g,n, r).
Are there global applications of the trace formula, automorphic forms, Whittaker models, the Langlands-Shahidi method for widetildeG ? -- Classify automorphic representations of covers of split tori.
Let σ be a weakly consecutive sequence, meaning a permutation of 1,…,k such that if d divides σ(i), then d also divides σ(i± d) wherever these terms are defined. Endpoint-1 conjecture. Any WCS either begins or ends with the term 1;…
Let N(H) denote the number of nontrivial ideal degree-three Prouhet–Tarry–Escott solutions of size four and height at most H, counted up to permutations within each multiset and interchange of the two multisets, with distinct integer…
Conjecture There is a finite upper bound on the multiplicities of entries in Pascal's triangle, other than the number 1. The number 2 appears once in Pascal's triangle, 3 appears twice, 6 appears three times, and 10 appears 4 times. There…