Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let n≡ 1pmod4 be a positive integer and let rgeqslant 1. Write (a;q)_k for the q-shifted factorial, [m]=(1-q^m)/(1-q), and let Φ_m(q) denote the mth cyclotomic polynomial. The Dwork-type q-supercongruence. Modulo [n^r]∏_j=1^rΦ_n^j(q)^2,…
For a spherical homogeneous space X=H\backslash G, which irreducible representations \pi occur in L^2(X) according to the Plancherel decomposition, equivalently in the relevant Fell-topology support?
Let r,m∈ N, let f(r,s_1,s_2) be the index bound occurring in the coefficient recursion, and let δ_mn denote the Kronecker delta, with δ_mm=1 and δ_mn=0 for m≠ n. The coefficient sum conjecture. For 0≤ m≤ f(r,s_1,s_2), we conjecture that…
Let γ(t)=(t,t^2,…,t^n) and define Φ(vec t)=∑_i=1^nγ(t_i). For vec t∈[ Z/N Z]^n, let N(vec t;N) be the number of vec s∈[ Z/N Z]^n satisfying Φ(vec s)=Φ(vec t). Use |t_j-t_k| for the least nonnegative representative of the difference's…
Let f(n,m) be minimal such that in (m,m+f(n,m)) there exist distinct integers a_1,…,a_n such that k| a_k for all 1≤ k≤ n. Prove that max_m f(n,m) ≤ n^1+o(1) and that max_m (f(n,m)-f(n,n))→ ∞.
Let r∈Q_>0 and k∈Z_≥ 1. If Tr_Z binomrk_q denotes the integer-exponent part (the integer trace) of the Gaussian binomial coefficient with positive rational upper index, then the Han–Xiong conjecture asserts the coefficientwise inequality…
A pairwise balanced design for 1,…,n is a collection of sets A_1,…,A_m⊆ 1,…,n such that 2≤ lvert A_irvert <n and every pair of distinct elements x,y∈ 1,…,n is contained in exactly one A_i. Is there a constant C>0 and, for all large n, a…
Let widetildef_ℓ,w be a normalized extremal quasimodular form of depth ℓ and weight w, with Fourier expansion widetildef_ℓ,w(z)=∑_n≥ 0a_nq^n. Kaneko–Koike's conjecture. If ℓ≤ 4 and w>2, then every Fourier coefficient a_n is positive.…
Let U_n denote min k : x_1, …, x_k ∈ X, x_1 geqslant n . It seems likely that lim_n U_n - (e-1) n = ∞ but we cannot prove this.
Erdős: Suppose I have a sequence of positive integers whose reciprocals sum to infinity. Must that sequence contain arbitrarily long arithmetic progressions? Apparently very hard, though obnoxiously simple.
Suppose A⊆ 1,…,N is such that if a,b∈ A and a≠ b then a+b mid ab. Can A be 'substantially more' than the odd numbers? What if a,b∈ A with a≠ b implies a+b mid 2ab? Must lvert Arvert=o(N)?
For all n≥ 2k the least prime factor of binomnk is ≤ max(n/k,k), with only finitely many exceptions.
Question 16. Solve the local-global solubility problem for finding lines on a cubic hypersurface. (Wooley) (a) Find an example of a cubic hypersurface over Qp (in as many variables as possible) with no rational line. (b) Find an example of…
Is -1 in the spectrum of a Liouville system? Equivalently, can we show that \begin{equation*} \sum_{n\leq X} (-1)^{n-1} \frac{\lambda(n+h_1) \dots \lambda(n+h_k)}{n} = o(\log X)? \end{equation*}
What is the correct necessary-and-sufficient criterion on rational A, B, and C for the Nahm series F_{A,B,C}(q) to be modular, and how should Nahm's conjectural criterion be repaired?
Let φ(n), ψ(n) and σ(n) denote the Euler totient, Dedekind psi and sum-of-divisors functions, respectively. For integers k≥1 and n≥2, form the three quantities φ^k(n)(ψ^k(n)+σ^k(n)), ψ^k(n)(φ^k(n)+σ^k(n)) and σ^k(n)(φ^k(n)+ψ^k(n)). Fully…
Let A⊂Z_>0, let p^(k)(n) be the generalized partition functions associated with A, and define ρ^(k)(n)=fracp^(k+1)(n)p^(k)(n)=fracp^(k)(n)-p^(k)(n-1)p^(k)(n). Assume that A has properties P_k+1,P_k+2,…. Eventual monotonicity conjecture.…
Is there a set A⊆ N such that, for infinitely many n, all of n-a are prime for all a∈ A with 0<a<n and liminflvert A∩ [1,x]rvert/π(x)>0?
Let Φ_k(d) denote the minimum number of linearly dependent dth powers of binary quadratic forms in a set of k such powers, as defined in the paper. Here k and d are positive integers. Bounded-error conjecture. There is a small constant M…
Is there a p-adic interpolation of L'(π ⊗ σ, 1/2)?