Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let A_n be the summand set A_n=0,1,…,⌊ n/k⌋. The Lyapunov condition is the condition used for the relevant triangular array in the preceding central limit theorem argument. Lyapunov condition conjecture. The Lyapunov condition holds for…
Question: for a symmetric pair H=G^\theta, which irreducible representations \pi of G are H-distinguished, i.e. satisfy \operatorname{Hom}_H(\pi,\mathbb C)\ne0?
What is the proper generalisation of this to higher dimensions? (Proposed by Tim Browning) Let N (B) count the number of solutions to x3 + 2xyz + xw2 − y 2 w + wz 2 = 0 with x 6= 0 and gcd(x, y, z, w) = 1 with x, y, z, w \in Z4 \cap [−B,…
Let a_1, …, a_k be given integers. Then there exist infinitely many positive integers n such that n + a_1, …, n + a_k are all prime, provided that for every prime p, there exists an integer m such that (m + a_i, p) = 1 for all i.
For an Artin L-function attached to a Galois extension of number fields, is its leading Taylor coefficient at s=0 the product of the corresponding Stark regulator of S-units with the predicted algebraic factor, including the refined…
Let f(n) be the maximum size of a subset of {1,...,n} containing no three distinct a,b,c satisfying 1/a = 1/b + 1/c. A published finite frontier for Erdős problem 302 asks whether f(732) is 606 or 607, using the existing OEIS value…
Let v(n) denote the sum of the primes and exponents appearing in the prime factorization of n, and let r_10(n) be the digit reversal of n in base ten. A v-palindrome in base ten is a natural number n with 10 mid n, n e r_10(n), and…
Let a_1=2 and a_2=3 and continue the sequence by appending to a_1,…,a_n all possible values of a_ia_j-1 with i≠ j. Is it true that the set of integers which eventually appear has positive density?
Let 1≤ a_1<a_2<… be a sequence of integers such that lim_n→ ∞fraca_na_n-1^2=1 and ∑1/a_n∈ Q. Then, for all sufficiently large n≥ 1, a_n = a_n-1^2-a_n-1+1.
Let h(S) denote the Helly number of a subset S⊆R^d, and let P be the set of prime numbers. Prime-square Helly conjecture. h(P^2)=∞. This conjecture predicts that the Helly number can be infinite for a highly structured discrete subset of…
Variation of problem 14.1: ask again only in a dynatomic setting. Formulate and solve.
Let F(x)=∏_n=0^∞(1-x^2^n) and, for an integer m, define F_m(x)=F(x)^m=∏_i=0^∞(1-x^2^i)^m=∑_n=0^∞t_m(n)x^n. Thus t_m(n) is the coefficient of x^n in F_m(x). Gawron–Miska–Ulas conjecture. For each integer m≥ 2, limsup_n→∞t_m(n)=+∞ and…
Evaluate ∑ ∫_t_j^t_j+T^7/8 |ζ(1/2+it)|^4 dt, where the sum is over a set of t_j's with modulus ≤ T and spaced more than T^7/8 apart from each other (related to work of Heath-Brown and of Zavorotnyi)
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…
Similar to Kudla program, we could also define a generating series of (derived) complex multiplication cycles on Shimura varieties and conjecture its modularity. Is it possible to compute arithmetic intersection of the generating series…
Does the equation 2^m=∑_a∈ Sa! have only finitely many solutions (m,S), where m∈N and S⊆N is finite with every a∈ S positive?
Let ζ denote the Riemann zeta function, that is, the meromorphic continuation to C of the function ζ(s)=∑_n=1^∞n^-s, Re s>1. Call ρ∈C a non-trivial zero of ζ if ζ(ρ)=0 and 0<Reρ<1, and let Z be the multiset of non-trivial zeros, each zero…
Given a genuine irreducible representation widetildeπ of widetildeG_F, describe Lift_L/F(widetildeπ) the base change lift of widetildeπ. Note that Lift_L/F(widetildeπ) is supposed to be the virtual representation of widetildeG_L.
Let the van der Waerden number W(k) be such that whenever N≥ W(k) and 1,…,N is 2-coloured there must exist a monochromatic k-term arithmetic progression. Improve the bounds for W(k) - for example, prove that W(k)^1/k→ ∞.
Let S(m,n) denote the super Catalan numbers S(m,n)=fracbinom2mmbinom2nnbinomm+nm. For an odd prime p, let (p/3) denote the Legendre symbol. Apagodu's conjecture. For any odd prime p, ∑_i=0^p-1∑_j=0^p-1S(i,j)≡ (p/3)pmodp, and…