Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Is it true that for infinitely many n, d_n = p_n+1 - p_n > c ln n ln ln n ln ln ln ln n / (ln ln ln n)^2 for arbitrarily large constant c?
Let f(n) be the product of the decimal digits of n, let Xi(n) be the smallest nonnegative integer k such that f^k(n)≤ 9, and let Δ(n) be the resulting one-digit target. Multiplicative persistence conjecture. For every n∈N, Ξ(n)≤ 11. This…
Let l≥ 1, let F∈C[x_0,…,x_l-1], and let A_n_n≥ 0 be a recurrence sequence satisfying A_n+l=F(A_n,…,A_n+l-1) for all n≥ 0. The nonlinear Skolem–Mahler–Lech conjecture. The zero set n≥ 0| A_n=0 is a union of at most finitely many arithmetic…
Let f(x) be a nonzero polynomial with integer coefficients and let S=s_i_i=1^∞ be an infinite sequence of positive integers, not necessarily increasing or distinct. For each n, write S_n=(s_1,…,s_n), and for 1≤ k≤ n define…
Overview We have discussed how hyperspherical dual pairs induce boundary theories (at dimension 2) by defining period and L-sheaves. Now we discuss numerical conjec- tures coming out of the framework, which bears the shape: “M -period of…
With N(X,δ) defined as the largest number of points in a disk of radius X whose pairwise distances remain at least δ from every integer, does some fixed δ>0 satisfy N(X,δ)→∞?
Can the Kronecker-Weber theorem on abelian extensions of Q be extended to any base number field?
Let (h_n)_n∈N be the sequence studied in the paper, and define a(n)=⌊frac|h_n||h_n-1|⌋. Automaticity conjecture. The sequence (a(n))_n∈N is 2-automatic. The paper establishes that a(n)∈0,1,2,3,4, while the stronger automaticity assertion…
The Gaussian-limit theorem for normalized cusp-form and divisor-function values in arithmetic progressions should remain valid when its auxiliary function satisfies only \Phi(x)=O_{\varepsilon}(x^{1-\varepsilon}) for some \varepsilon>0.
In the same function-field setting, do there exist universal constants C and \delta>0 such that, for every y\in D^{\times}(\mathbb A_{\mathbb F_q(t)}), f(y)=\int_{D^{\times}(\mathbb F_q(t))\backslash D^{\times}(\mathbb A_{\mathbb…
Artin’s primitive-root conjecture predicts that the set S = {p prime : 2 is a primitive root modulo p} has a natural density C = 0.3739… among the primes.
For any α,β ∈ ℝ, is lim inf_{n→∞} n·||nα||·||nβ|| = 0?
Let m,n∈N_+ with n>2m and define F_m,n(t)=A_n-m(1,t)^2-4A_n-2m(1,t)A_n(1,t). Squarefreeness conjecture. The polynomial F_m,n has no multiple roots. This conjecture concerns the discriminant-type polynomials arising in the study of…
Let T be a (not necessary split) torus over a p--adic field. Construct widetildeT 1 longrightarrow μ_F longrightarrow widetildeT longrightarrow T longrightarrow 1 explicitly within Brylinski-Deligne framework.
Let U(n) be the maximum number of unordered pairs of points at Euclidean distance 1 among any set of n points in the plane, that is, U(n)=max_P⊆R^2, |P|=n#p,q⊆ P:|p-q|=1. The conjecture asks whether U(n)=n^1+o(1), equivalently, whether for…
Let L_k be the sets of k-Lehmer numbers, and define C_k(x):=#n∈ L_k:n≤ x. Asymptotic independence conjecture. For every k>1, the asymptotic behavior of C_k does not depend on k and, in particular, C_k(x)∈O(x/loglog x). The conjecture…
Let k≥ 3 and g_k(N) be minimal such that if A⊆ 1,…,2N has lvert Arvert ≥ N+g_k(N) then there exist integers b_1,…,b_k such that all binomk2 pairwise sums are in A (but the b_i themselves need not be in A). Estimate g_k(N).
Let F_k(N) be the largest size of a subset A⊆1,…,N containing no k distinct elements whose product is a square. For odd k≥5, is F_k(N)=(1-o(1))N?
Given n distinct points A⊂R^2 must there be a point x∈ A such that # d(x,y) : y ∈ A ≫ n^1-o(1)? Or even ≫ n/√log n?
Let g(N) be the largest size of A⊆1,…,N for which all products of distinct subsets of A are different. Is g(N)≤π(N)+π(√ N)+o( √ N/log N)?