Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let ζ(s_1,…,s_r) be a multiple zeta value with s_1>1 and s_2,…,s_r≥1, and let its weight be s_1+…+s_r. For k≥1, define Z_k:=span_ Qζ(s_1,…,s_r):r≥1, s_1>1, s_2,…,s_r≥1, s_1+…+s_r=k and d_k:=dim Z_k. Zagier's dimension conjecture. One has…
Let ρ(q)=∑_n≥ 0r(n)q^n be defined by ρ(q)=∑_m≥ 0fracq^2m(m+1)(1+q+q^2)(1+q^3+q^6)…(1+q^2m+1+q^4m+2). The finite sign law. For every n≥ 0, r(3n)>0, r(3n+1)≤ 0, and r(3n+2)≤ 0. Moreover, the only zeros in the last two families are…
For a pair (G,\rho) and a cuspidal automorphic representation \sigma, there exist nonzero k^\times-invariant linear functionals E_{\sigma,\rho} and E_{\widetilde{\sigma},\rho} such that…
Let R be a commutative ring with unity and let n∈R∖0. A Diophantine quadruple with property D(n) in R is a set of four nonzero elements satisfying a_i a_j+n=x_ij^2 for all distinct indices i,j, with x_ij∈R. Franušić–Jadrijević's…
Say that a set S ⊆ Z has distinct subset sums if distinct subsets of S have distinct sums. Conjecture There exists a fixed constant c so that |S| ≤ log_2(n) + c whenever S ⊆ 1,2,…,n has distinct subset sums.
Can one bypass mod p Galois representations? More precisely, can one construct and characterise mod p automorphic induction? Can one predict the p-adic valuation of Regi (M (O1 ))2/Regi (M (O1 ))2 or of #Hi (M (O1 ), Z)/#Hi (M (O2 ), Z)…
Let G(x) denote the number of primes in the set ⌊ x/n⌋:1≤ n≤ x. Suppose that x=p_1p_2p_3, where p_1,p_2,p_3 are primes satisfying 2<p_1<p_2<p_3. The three-prime floor-function set formula. Then G(x)= G(x-1) if p_1p_2>p_3, G(x-1)+1 if…
Let T be a torus over Q. For a compact open subgroup K_f=K^pK_p of T(A_f), let Γ(K_f)=T(Q)∩(T(R)^∘ K_f), let hatΓ(K_f) be its p-adic completion, and let Δ(T,K_f) be the kernel of the map hatΓ(K_f)→ K_p. Define the Leopoldt defect by…
Fix some constant C>0 and let n be large. Let A⊆ 2,…,n be such that (a,b)=1 for all a≠ b∈ A and ∑_n∈ A1/n≤ C. What choice of such an A minimises the number of integers m≤ n not divisible by any a∈ A? Is this minimised by letting n≥…
Let (a,b,c) be the side lengths of the triangular tile, with angles determined by a,b,c, and let T be a triangle with angles (2α,2β,α+β). Tile-count divisibility conjecture. If T can be tiled by copies of (a,b,c), then the number of tiles…
Definition A set of m positive integers a_1, a_2, …, a_m is called a Diophantine m-tuple if a_i· a_j + 1 is a perfect square for all 1 ≤ i < j ≤ m. Conjecture (1) Diophantine quintuple does not exist. It would follow from the following…
For every integer t≥ 2 and every strictly increasing t-tuple of positive integers a_1<…<a_t, define a set recursively by A_0=a_1,…,a_t and, for each n≥ 0, adjoining the least positive integer that is neither already in A_n nor expressible…
Suppose Γ is non-reflective. After running Vinberg's algorithm to find part of the Coxeter polytope P, we can look for symmetries in the Coxeter diagram and deduce from these some O(q) symmetries of the polytope. Can we use these…
GL(3) Kuznetsov trace formula in the level aspect Develop a Kuznetsov trace formula for automorphic forms for the group Γ_0(N) = lbrace ⋆ ⋆ ⋆ ⋆ ⋆ ⋆ 0 0 ⋆ bmod N rbrace for any integer N≥1. For the purpose of applications, develop a…
Suppose A⊆ N is a Sidon set. How large can limsup_N→ ∞fraclvert A∩ 1,…,NrvertN^1/2 be?
Polignac's conjecture: every positive integer m occurs infinitely often as a gap p_{n+1}-p_n between consecutive primes.
Let K be a number field, let p be a prime, and let R(E/L) denote the fine Selmer group of an elliptic curve E/K over an algebraic extension L/K. Write K^cyc for the cyclotomic Z_p-extension of K, and let K_∞/K be an admissible p-adic Lie…
Let p≠ 3 be a prime number, let P=p or 2p, and let ε=α+β p^1/3+γ p^2/3∈R_>1 be the fundamental unit of Q(P^1/3), where α,β,γ∈(1/3)Z. Shimizu–Hirakawa conjecture. We have βnot≡ 0pmod p. This conjecture would imply that the parameter ι used…
Can one prove the fourth moment formula starting from ∫ ∏_j=1^4 ( ∑_n≤ x_j frac1n^1/2+it+χ(s) ∑_n≤ t/x_j frac1n^1/2-it) dt ?
Are there infinitely many pairs of integers n eq m such that binom2nn and binom2mm have the same set of prime divisors?