Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
A finite set A⊂ R^n is called Ramsey if, for any k≥ 1, there exists some d=d(A,k) such that in any k-colouring of R^d there exists a monochromatic copy of A. Characterise the Ramsey sets in R^n.
(J. Ellenberg, D. Ulmer) Let X be a modular curve, which paramterizes elliptic curves with some level structure, and let E be the universal family of elliptic curves over X. This defines an elliptic surface, typically over Q. It often…
Are there infinitely many primes p such that p=2^kq+1 for some prime q and k≥ 0? Or p=2^k3^lq+1?
Let G be a reductive group over Q, S a finite set of primes, and \pi an irreducible cuspidal automorphic representation with K-invariants that is not S-CAP. Then there exists an S-multiplier \mu_\pi such that for every test function f, the…
Let p be an odd prime, and define E_p,2: Y^2=X^3-432p^2, E_p,4: Y^2=X^3-432p^4. Let P=(X,Y) be a generator of one of these curves, and let k be a positive integer such that Q=kP=(u/d^2,v/d^3) for integers u,v,d, with p| d. EC-AAC. If P…
Let S=4,5,7,12,23,229,562. A natural number is square-free if no perfect square other than 1 divides it. Prime factorization conjecture for factorials plus one. For every n∈ N∖ S, the number n!+1 is square-free. The conjecture predicts…
For an integer k≥ 2, let p^k(n) denote the number of partitions of n into perfect k-th powers. Define N_k to be the smallest index such that the sequence p^k(n) is log-concave for all n>N_k. Initial log-concavity threshold conjecture. For…
Let a_1=1 and a_2=2 and for k≥ 3 choose a_k to be the least integer >a_k-1 which is the sum of at least two consecutive terms of the sequence. What is the asymptotic behaviour of this sequence?
Let a,b,c,d∈N satisfy a^2+b^2+c^2+d^2≠0. Finite restriction conjecture. There exists a finite set S⊆N such that every sufficiently large integer can be written as x^2+y^2+z^2+2w^2 with x,y,z,w∈Z and ax+by+cz+dw∈S. This conjecture asks…
\begin{enumerate} \item What can you say about inertia subgroups of Galois groups in towers of fields generated by f^-n(α) for f PCF? \item What happens to decomposition groups? \end{enumerate}
In mathematics, the Hardy–Littlewood zeta function conjectures, named after Godfrey Harold Hardy and John Edensor Littlewood, are two conjectures concerning the distances between zeros and the density of zeros of the Riemann zeta function.
Are there infinitely many n such that if n(n+1) = ∏_i p_i^k_i is the factorisation into distinct primes then all exponents k_i are distinct?
Let f∈Z[x,y] and, for each prime p, let C_p be the curve of points modulo p defined by f(x,y)≡ 0pmod p. For a k-tuple P=((r_1,s_1),…,(r_k,s_k)) of element-wise distinct points on C_p, define B_k(P)= f_x(r_1,s_1) f_y(r_1,s_1) f(r_1,s_1)/p ⋮…
Question 3. Let f1(x0,..., x n) = 0, f2(x0,..., x n) = 0 define the smooth com-plete intersection of two quadrics X2,2 ⊂ Pn over k a number field. For simplicity, assume k = Q. If n ≥ 8, X(R) 6 = ∅ implies X(Q) 6 = ∅. (Sansuc,…
Let k≥ 2 and q(n,k) denote the least prime which does not divide ∏_1≤ i≤ k(n+i). Is it true that, if k is fixed and n is sufficiently large, we have q(n,k)<(1+o(1))log n?
Dudeney: Is it possible to choose 2n points in an n by n grid in the plane so that no three are collinear? Conjecture: no. In fact, it is conjectured that the answer is still "no" unless 2 is changed to something less than Ŕ/3 =…
A digital anomaly is a quadruple (x,y,B,k) satisfying the paper's definition. In the case k=2, the conjecture concerns the complete list of such quadruples. Digital-anomaly conjecture for k=2. The only digital anomalies (x,y,B,k) with k=2…
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?
Let p be an odd prime integer, and let a,b be positive integers coprime to p. The associated q-deformed rational-number polynomials are denoted by S_a/p(q) and S_b/p(q). Arithmetic conjecture. One has S_a/p(q)=S_b/p(q) if and only if ab≡…
Problem Let A ⊆ N be a set of n positive integers and set m(A) = - min_x ∑_a ∈ A cos(ax). What is m(n) = min_A m(A)?