Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
For each integer k≥ 0, let (2^k)_3 denote the ternary expansion of 2^k. Eventual zero-digit conjecture. There is a positive integer k_0 such that for all k≥ k_0, the ternary expansion of 2^k cannot omit the digit 0. This is a weaker form…
Let S be a Collatz sequence containing the trivial cycle, and, disregarding that cycle, let e(m_k) and o(m_k) denote respectively the numbers of even and odd terms in the sequence beginning at m_k, counting m_k but not 1. Define the…
Conjecture 2. If m is non-Eisenstein, then the map \pi1∗ + \pi2∗ : H d (XK , Fℓ )m ⊕2 \to H d (XK0 (p) , Fℓ )m is injective. This is (a generalisation of) Ihara’s lemma. When d = 0, it can be proved using strong approximation. When d = 1…
Fix a base b≥ 2. Write every u≥ 1 uniquely as a tower of powers of b ending in 0<ω≤ 1, and let ht(u) be the height of this tower. Let K(n) denote the smallest number with exactly n generators in base b. Generalized Kaprekar height…
Let T=(t_n)_n≥0 be the steering word considered in the paper, and let p_T(k) denote the number of distinct factors of length k occurring in T. Exact complexity conjecture. p_T(k)=3^ k+1-2^ k+1 for every k≥1. The formula agrees with the…
Let T(n) be the set of ternary partitions of n, meaning partitions whose parts are powers of 3, and define s(n)=num_ T(n,-1). Ternary-partition evaluation conjecture. One has s(1)=s(2)=1 and, for every relevant integer n,…
Let E=(e_k)_k≥ 1 be the sequence of extremal prime numbers, listed in increasing order. Reciprocal-series conjecture. The series ∑_k=1^∞1/e_k is convergent. Numerical data give ∑_k=1^20001/e_k≅ 1,090.., but convergence of the full series…
Let G be a finite cyclic group of order |G|, and let S be a sequence over G. Write S=(n_1g)·…·(n_kg), where g generates G, and define ind(S)=minfracn_1+…+n_kord(g): g∈ G, ⟨ g⟩=G. A sequence is minimal zero-sum if it has sum zero and no…
Let A be an abelian variety over a number field k, let S_A be the set of primes of good reduction for A, and let u∈(0,1). Here an integer is B^u-smooth if every prime divisor of it is at most B^u. Poonen's smoothness conjecture. One has…
Let a(n) and b(n) be the previously defined sums associated with the even and odd numbers, respectively. Bounds conjecture. For every n∈N, 4/5leqa(n)/b(n)≤ 2, and for every n≥5, 4/5leqa(n)/b(n)<1. The paper introduces these inequalities as…
Assume the most optimistic bounds on unstable cohomology. can we get the full ratios conjecture without a limitation on the size of q. I.e. can we get it for fixed q instead of taking a limit as q → ∞?
Let n_1<n_2<… be a lacunary sequence of integers, and let f∈ L^2([0,1]). Let f_n be the nth partial sum of the Fourier series of f(x). Is there an absolute constant C>0 such that, if | f-f_n|_2 ≪ frac1(logloglog n)^C then lim_N→∞1/N∑_k≤…
Let d_n=p_n+1-p_n. The set of n such that d_n+1≥ d_n has density 1/2, and similarly for d_n+1≤ d_n. Furthermore, there are infinitely many n such that d_n+1=d_n.
\begin{enumerate}[label=\alph*)] \item Relate tr(T(m,n)) to rings of quasi-invariants and to A. Wilson's conjecture on ∇_p_1^n. \item Describe H^*(Hilb(x^nd=y^n)) as a module over rational Double Affine Hecke algebra (DAHA) and relate it…
Let d_n=p_n+1-p_n, where p_n is the nth prime. Prove that ∑_1≤ n≤ Nd_n^2 ≪ N(log N)^2.
Fix distinct prime numbers p, ℓ. Let E be a finite extension of Qp , and G a quasi-split reductive group over E. The most refined form of the categorical local Langlands conjecture has been proposed in the work of Fargues–Scholze [5,…
Let α be a cyclotomic integer, meaning an algebraic integer expressible as a sum of roots of unity. Let l(α) be the smallest number of roots of unity occurring in any such representation, and let c(α) be the smallest positive integer such…
Let A_R(λ_j) denote the normalized quantities attached to the cyclically ordered lattice points, and let A_∞(r,θ) be their limiting random model. For k≥1, consider the random vectors (A_R(λ_j),A_R(λ_j+k))_1≤ j≤ K. Strengthened vanishing…
Open Problems It would be interesting (and probably not too difficult) to extend the proof of Theorem 3 to other families of simple and almost simple groups. Is the set S finite or infinite? More- over, is there an infinite family of…
Let t(N) be the largest size of a set A⊆1,…,N for which no nonempty subset of A has square sum. Determine the order of growth of t(N).