Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let (a_n)_n≥ 0∈Z^N be a primary pseudo-polynomial, meaning that for every integer n≥ 0 and every prime number p, a_n+p≡ a_n pmod p. Its generating series is f_a(x)=∑_n=0^∞a_nx^n. A series is the diagonal of a rational fraction if it has…
Let sat(k) be the sequence defined in the paper, and let ⟨sat(k)⟩ denote its associated word over the alphabet 1,2. The digit-frequency conjecture. The proportion of digits “1” in the word ⟨sat(k)⟩ tends to 1/2 as k tends to infinity. This…
Is there c > 0 such that whenever A ⊂ [N] has size N^1-c, the difference set A - A contains a nonzero square?
Conjecture (Langlands functoriality and twisting): for a holomorphic cuspidal representation π of GL₂ over a number field K and each m, the mth symmetric-power L-function should arise from an automorphic representation Sym^m(π) on…
Does there exist a constant c such that for every prime p>c the only rational points on the modular curve X_{\mathrm{ns}}(p) over \mathbb{Q} are CM points?
Define the Gleason polynomials as the polynomials in c such that f_c(x) = x^2+c is post-critically finite. Are the Gleason polynomials irreducible?
Begin to classify those f for which Gal(K_f/K) does not have finite index in the thing it's supposed to. Ask this question again for K_f'=K(all periodic points of f)
Let k≥ 3 and A be an additive basis of order k. Does there exist a constant c=c(k)>0 such that if r(n)≥ clog n for all large n then A must contain a minimal basis of order k? (Here r(n) counts the number of representations of n as the sum…
Let d_n=p_n+1-p_n, where p_n is the nth prime. Prove that ∑_1≤ n≤ Nd_n^2 ≪ N(log N)^2.
Is it true that |(A − A) \cap [1, n]| = (1 − o(1))n? Is it true that for any B \subseteq {1, . . . , n} with |B| \geq ǫn X 1B (a − b) ≫ǫ n2 ? a,b\inA Note that, since dim Sk (N ) ≍k N 1+o(1) , the length of the sum is essentially as short…
Let E be the set of extremal prime numbers and define its counting function by π_ε(x)=∑_p∈ E, p≤ x1. Positive-exponent conjecture. There exists an infimum infα>0:π_ε(x)=o(x^α) and it is positive. The paper reports that numerical data place…
For k≥0, let gb_k=(fracB_p-kkpmod p)_p>k be the calA_1-Bernoulli numbers, and for k≥2 let q_k=(frack^p-1-1ppmod p)_p>k be the kth calA_1-Fermat quotient. Set gb_1=1. Suppose n_1,…,n_r∈N and log n_1,…,log n_r are Q-linearly independent.…
If τ(n) counts the divisors of n then let f(n)=∑_1≤ k≤ nτ(2^k-1). Does f(2n)/f(n) tend to a limit?
Let T_R:Z→Z be defined by T_R(n)= 3n/4, n≡ 0pmod 4, [2pt]n-2/4, n≡ 2pmod 4, [2pt]3n+1/2, n≡ 1pmod 2. For k≥ 0, define T_R^0(n)=n and T_R^k+1(n)=T_R(T_R^k(n)), and call (T_R^k(n))_k≥ 0 the T_R-trajectory of n. The refined 3x+1 conjecture.…
Which subset of \operatorname{Irr}_{p\prime}(G), if it exists, corresponds under a McKay bijection to \operatorname{Irr}(N_G(P)/P), and what is the analogous answer for groups of Lie type?
For a positive integer n, let [j-k+δ_jk]_1leqslant j,kleqslant n denote the n× n matrix whose (j,k) entry is j-k+δ_jk, where δ_jk is the Kronecker delta, and let per(M) denote the permanent of a matrix M. Congruence conjecture. For any…
The binary Goldbach conjecture asserts that every even integer greater than 2 is the sum of two primes: ∀ n∈Z, (n>2∧ 2| n)⇒∃ primes p,q such that n=p+q. The ternary Goldbach conjecture asserts that every odd integer greater than 5 is the…
The formal-degree and Plancherel-density conjectures hold whenever H is a symplectic group or an even special orthogonal group, subject to the stated local Langlands framework.
Let 1≤ m≤ k and f_k,m(x) denote the number of integers ≤ x which are the sum of m many nonnegative kth powers. Is it true that f_k,k(x) ≫_ε x^1-ε for all ε>0? Is it true that if m<k then f_k,m(x) ≫ x^m/k for sufficiently large x?
Let h(n) be minimal such that 2^n-1,3^n-1,…,h(n)^n-1 are mutually coprime. Does, for every prime p, the density δ_p of integers with h(n)=p exist? Does liminf h(n)=∞? Is it true that if p is the greatest prime such that p-1| n and p>n^ε…