Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let k=k(n,m) be minimal such that any directed graph on k vertices must contain either an independent set of size n or a transitive tournament of size m. Determine k(n,m).
For m∈N, let A_m=k(m-k):1≤ k≤⌊ m/2⌋. Can the size of A_m∩ A_n be arbitrarily large as m,n vary? Equivalently, is it true that for every s∈N there exist m,n∈N with n<m and s≤ |A_n∩ A_m|? Also, for every ε>0, does there exist n_0∈N such that…
Conjecture: in the preceding formal-degree setting, the orthogonal root-number ratio satisfies \frac{\omega(\operatorname{Ad}G\circ\phi)}{\omega(\operatorname{Ad}G\circ\phi{\operatorname{prin}})}=\chi\phi(z_{\operatorname{Ad}G}), where…
Let k be a positive integer, and let a,b be coprime positive integers with mina,b>1. Consider the equation (ak)^x+(bk)^y=((a+b)k)^z, x,y,z∈N. The solution (x,y,z)=(1,1,1) is always present, and any solution different from it is called…
Let (u_n)_n≥ 0 be the Lucas sequence associated to integers a and b with |a|≥ 3 and b=-1, so that u_0=0, u_1=1, and u_n+1=a u_n+b u_n-1. Pairwise coprimality conjecture. For any two different primes p and q, the terms u_p and u_q are…
Let f be a holomorphic or Hecke--Maass cusp form of level 1 and χ be a Dirichlet character of level p. For fixed f, a level aspect Burgess-type bound for L(f×χ, 1/2) can be obtained by (among many others) these two methods:…
Is there A⊆ N such that lim_n→ ∞1_A* 1_A(n)/log n exists and is ≠ 0?
Let n be a speed vector with gcd(n)=1, and let a suitable time mean a time at which the speeds in n form a lonely runner instance. Let k and n_1 be the parameters appearing in the speed vector, let m be a natural number, and let ⌈·⌉ denote…
Let p_1,…,p_k be k≥ 2 different odd prime numbers. For each i∈ 1,…,k , set B_i= 0,…,(p_i-1)/2 . Define s=∑_i=1^klog #B_i/log p_i=∑_i=1^klog(p_i+1)-log 2/log p_i. Here N_p_1,…,p_k^B_1,…,B_k denotes the set of nonnegative integers whose…
Let f∈Z[x_1,…,x_n] be a polynomial of degree d>1. Let f_d be its homogeneous degree-d part, and let s be the dimension of the critical locus of f_d, namely the solution set in C^n of ∂ f_d/∂ x_1(x)=…=∂ f_d/∂ x_n(x)=0. For a positive…
Let B_m denote the mth Bernoulli number, and let h∈Q[x_3,x_5,…,x_2n+1] be a nonzero homogeneous polynomial with deg(x_2k+1)=2k+1. Zhao's conjecture. For every positive integer n and every such polynomial h, there exist infinitely many…
Suppose G is a countable amenable group and A⊆ G has positive Banach density. Are there infinite B,C⊆ G such that B· C⊆ A?
Given a finite map f:X→ Y (over a number field), how are δ(X/k) and δ(Y/k) related? Are there examples showing that the obvious relations are sharp?
Is there a mock version of skew holomorphic Jacobi forms?
Let s+1/2>h≥ 0. For each quadratic Dirichlet character χ_d with modulus d≤ N, let L(s,χ_d) be its Dirichlet L-function, and let N^* denote the number of such characters. Define a_s=∏_p primefrac(1-1/p)^s(s+1)/21+1/p(1/p+1/2((1+1/√…
Let S(t, α) = (s_1, s_2, …) with s_n = [tα^n]. For what values of t and α is S(t, α) complete? ... It seems likely that S(t, α) is complete for all 1 < α < frac1 + √52 and all t > 0. There seems to be little hope of proving this at present…
Let n be an integer greater than 4, and consider the central binomial coefficient binom2nn. Divisibility conjecture. The central binomial coefficient binom2nn is divisible by 4 or 9 for every n>4 except n=64 and n=256. This is the paper's…
Rado: Is it true that, for every n, there is an integer M(n), so that whenever a linear homogeneous equation in n variables is Ramsey (in the positive integers) for M(n)-colors, it is Ramsey for any number of colors?
Call a set S⊆ 1,…,n admissible if (a,b)=1 for all a≠ b∈ S. Let G(n) = max_S⊆ 1,…,n ∑_a∈ Sa and H(n)=∑_p<np+ nπ(n^1/2). Is it true that G(n) >H(n)-n^1+o(1)? Is it true that, for every k≥ 2, if n is sufficiently large then the admissible set…
Let a and b be integers with 2≤ a<b, and consider the equation a^n+b^n=z^2. Here (z,n) denotes a solution of the equation. Cohn's conjecture. Every solution (z,n) satisfies n≤ 4. The conjecture was proposed by J. H. E. Cohn in 2002 and…