Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
What do the methods for computing moments of L function give if one tries to compute moments of derivatives. Even in the random matrix theory setting computing the distribution of derivatives is difficult. What can recent methods tell us…
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 ?
Let t(n) be the largest possible a_1 among factorizations n!=a_1… a_n with a_1≤…≤ a_n. Determine the second-order behavior of t(n): in particular, beyond t(n)/n→1/e, is t(n)≤ n/e-cn/log n infinitely often for some c>0?
Is it true that, for all sufficiently large n, there exists some k such that p(n+k)>k^2+1, where p(m) denotes the least prime factor of m? Can one prove this is false if we replace k^2+1 by e^(1+ε)√k+C_ε, for all ε>0, where C_ε>0 is some…
For all ε > 0, does ζ(1/2 + it) = o(t^ε) as t → ∞?
Let Z_A^(1) be the Q-vector space of ordinary finite multiple zeta values, and let ζ_A^(2)(k_1,…,k_r) denote a level-two finite multiple zeta value. Odd-index basis conjecture. If all k_i are greater than 1, then…
Jaeger: If F is a finite field with at least 4 elements and A is an invertible n by n matrix over F, then there are vectors x, y in F^(n) which haveall nonzero coordinates so that Ax = y. See this.
Let s(n):=∑_d| n, d<nd be the sum-of-proper-divisors function. Fix k≥ 2, and call a positive integer k-free if it is not divisible by the kth power of any integer greater than 1. Powerfree preservation conjecture. On a set of integers n of…
Call an integer p a perfect power if p = x^n for some integers x ≥ 1 and n ≥ 2, and let p_1 < p_2 < p_3 < … be the increasing enumeration of the perfect powers ≥ 1. Then lim_k → ∞ (p_k+1 - p_k) = ∞; equivalently, every positive integer is…
Can you give a quadratic presentation of the Maltsev completion of hyperelliptic Torelli using the computation from Bergstrom-Diaconu-Petersen-Westerland?
Let p be a prime. Corollary 12 gives the asymptotic formula for a_p(n) stated earlier in the paper. Extension conjecture. Corollary 12 also holds for primes p>23. The conjecture is motivated by numerical experiments, since the condition…
Develop a heuristic for moments of L-functions of automorphic forms.
Erdős-Turán: Suppose that S is a set of positive integers with the property that S+S -- that is, all sums of the form s_(1)+s_(2) for s_(1), s_(2) in S -- contains all sufficiently large integers. (Then S is called an "additive basis".) Is…
Let ⌊ x⌋ be the largest integer less than or equal to x, and let frac(x)=x-⌊ x⌋ for x∈ R. Define Δ(x)= x/2 if frac(x)<frac12, [4px]3x+1/2 if frac(x)≥frac12. For a seed u_0∈ R, define its Δ-sequence by u_n=Δ^n(u_0). The fractional 3n+1…
Let p,q,r,s denote primes. For a prime q, construct a tree T(q) rooted at q by linking each prime power p^e exactly dividing q-1 to q, and recursively linking each p^e to the prime powers r^b exactly dividing p-1. Let f(q) be the largest…
Let A,B⊆ N be two infinite sets. How dense can A+B be if all elements of A+B are pairwise relatively prime?
Let p and q be distinct odd primes. Let n be a positive odd integer, and let m be a positive integer that is not an n-th root of any rational integer. Consider the imaginary quadratic fields of the form Q(√p^2-mq^n). The authors'…
Let n be the initial number of copies of F_1 in the Ordered Zeckendorf game, and let the Long Game Strategy (LGS) be the priority-based strategy that performs switch moves, combines adjacent ones from the left, performs split moves from…
For fixed q congruent to 1 modulo 4 and the family H_{2g+1} of monic square-free polynomials of degree 2g+1 over F_q, does the conjectured asymptotic formula sum_{D in H_{2g+1}} L(1/2,chi_D)^k = q^{2g+1}P_k(2g+1)+o(1) hold as g tends to…
Conjecture: If pₙ is the nth prime, then the normalized prime gaps (pₙ₊₁−pₙ)/log pₙ are asymptotically distributed like an exponential random variable with density e⁻ˣ on [0,∞).