Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let E/Q be a non-CM elliptic curve, and let ρ_E,ℓ denote its mod-ℓ Galois representation. Serre–Sutherland–Zywina conjecture. If ℓ>37, then ρ_E,ℓ is surjective. This refines Serre's question about a uniform bound for exceptional primes and…
Could we formulate and prove arithmetic (resp. higher) Siegel--Weil formulas on Shimura varieties (resp. moduli of Shtukas) for exceptional groups?
For every natural number n≥ 1 and every natural number k, if each of n+1,n+2,…,n+k is composite, do there exist a family of k distinct natural primes p_0,…,p_k-1 such that p_i| n+i+1 for every i<k?
Let a∈N∖1, and let b,c,d∈N with c| b+d. The modulus is 4lcm(b,d). Least-common-multiple formulation. For every a∈N∖1, there exist b,c,d∈N with c| b+d such that a≡-(b/c+d/c)pmod4lcm(b,d). The paper states that this formulation is equivalent…
What is the least positive odd number not of the form ± p^a ± 2^b, where p is an odd prime?
Call a positive integer m powerful if for every prime p with p | m one also has p^2 | m; equivalently, m is powerful if and only if m = a^2b^3 for some positive integers a, b. Writing the prime factorization as m=∏_i p_i^α_i, this says…
Let G be a chordal graph on n vertices - that is, G has no induced cycles of length greater than 3. Can the edges of G be partitioned into n^2/6+O(n) many cliques?
Let f(n) be maximal such that if A⊆N has lvert Arvert=n then ∏_a eq b∈ A(a+b) has at least f(n) distinct prime factors. Is it true that f(n)/log n→∞?
Fix some integer n and define a decreasing sequence in [1,n) by a_1=n-1 and, for k≥ 2, letting a_k be the greatest integer in [1,a_k-1) such that all of the prime factors of a_k are >n-a_k. Is it true that, for sufficiently large n, not…
Let p be a prime number and k a natural number. Consider the Ramanujan-type polynomial R_2k+1,p(z) and the polynomial (pz)^2k-1. Common-root conjecture. If 2| k, then the only common roots of R_2k+1,p(z) and (pz)^2k-1 are z=± i/p; if 2nmid…
Assume that the Riemann zeta-function ζ(s) satisfies the Riemann Hypothesis. Let the positive ordinates of the non-trivial zeros of ζ(s) be counted with their distinct values. The Linear Independence Conjecture. The positive ordinates of…
Let O be the integral closure of Z in overlineQ, and let F:Z^nlongrightarrowZ^n be a Keller map such that the scalar extension F⊗O is injective. Injectivity conjecture. Then F is an isomorphism. The paper says this statement motivated the…
(C. Hall) 2) If we start with any surface S over Fq we can, via Lefschetz fibration, make it into a curve over Fq(T ). Typically (since the rank of H2 is even), one has two Tate classes. One of these is given by hyperplane sections; can we…
Let s_t(n) be the t-smooth component of n - that is, the product of all primes p (with multiplicity) dividing n such that p<t. Let f(n,t) count the number of distinct possible values for s_t(m) for m∈ [n+1,n+t]. Is it true that f(n,t)≫ t…
Are there infinitely many primes of the form n^2 + 1?
Let m be an infinite cardinal and G be a graph with chromatic number m. Let r≥ 1. Must G contain a subgraph of chromatic number m which does not contain any odd cycle of length ≤ r?
Let SPP(n)=(|A+A|,|AA|):A⊆ N, |A|=n, where A+A=a+b:a,b∈ A, AA=ab:a,b∈ A. Small-representative conjecture. If (i,j)∈SPP(n), then there is a set A⊆ N with |A|=n, |A+A|=i, |AA|=j, and max A≤ 2^⌊(3n-4)/2⌋. This conjecture bounds the largest…
Let textscSquares denote the set of perfect squares in Z. Finite-translate perfect-squares conjecture. There exists a positive integer k such that there are no sets X,Y⊂ Z with |X|=|Y|=k satisfying x+y∈textscSquares for all x∈ X and y∈ Y.…
For every prime p≥ 3, there exist distinct primes p_1 and p_2 such that p=2p_1-p_2; equivalently, ∀ p∈P (p≥ 3⇒∃ p_1,p_2∈P (p_1≠ p_2∧ p=2p_1-p_2)), where P denotes the set of primes.
Does the Sarnak conjecture hold uniformly in x ∈ X in the case of horocycle flows? It is known that the uniform Sarnak conjecture follows from the Sarnak conjecture, but we don't know that it follows case by case.