Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let p>q≥ 2 be two coprime integers. We call n representable if it is the sum of integers of the form p^kq^l, none of which divide each other. If p,q eq 2,3 then what can be said about the density of non-representable numbers? Are there…
Let f∈Z[x] be a non-constant polynomial in n variables. For each α∈C^n, let σ_α(f) denote the log canonical threshold at α of the hypersurface f(x)-f(α)=0, and define S_f(p,m):=frac1p^mn∑_x∈0,…,p^m-1^nexp(2πif(x)/p^m). Cluckers–Veys…
In the recent work of Li--Rapoport--Zhang on arithmetic fundamental lemma conjecture for spherical Hecke algebras, there is a conjecture on commutativity of certain Hecke operators on Grothendieck groups of coherent sheaves on unitary…
Erdős–Moser problem: is 1^1 + 2^1 = 3^1 the only solution to the Erdős–Moser equation?
Question 10 (Melanie Matchett Wood). Look at complete intersections, and some examples with a moving target space.
Let a≥ 2 and let f=± a(1+x^n-1)+x^n∈ Z[x]. Harrington's conjecture. The polynomial f is irreducible unless f=x^2+4x+4. The paper states that Zhang and Yuan provide an alternative proof using the Newton polygon technique, so the conjecture…
Is ∃ Th( F_p(t)), in the language of rings without a name for t, decidable?
Let C≥ 0. Is there an infinite sequence of n_i such that lim_i→ ∞fracp_n_i+1-p_n_ilog n_i=C?
Let k be the length of the vector vecc=(c_1,…,c_k), and let the algorithm in the proof of Theorem main be the conversion algorithm for vecc-representations. A vector is weakly decreasing if c_i+1≤ c_i for every 1≤ i<k. Termination…
Problem 5. Harari: The following question is due to Borovoi: Consider weak approximation for X = SL n /G over Q, where G is a finite group scheme that is not necessarily constant. For example, is X(Q) dense in X(R)? If G is constant, this…
Let bM be chosen uniformly at random from all symmetric n× n matrices with entries in 0,1, and let ζ be an independent random vector uniformly distributed on 0,1^n. Define the walk matrix bW=[ζ,bMζ,…,bM^n-1ζ]. Square-freeness frequency…
Let T(i)=frac12 i(i+1) be the i-th triangular number, let i≤_ Tj mean that T(i) divides T(j), and let μ_ T be the Möbius function of the poset ( N,≤_ T). Growth conjecture. There is a positive constant C such that ∑_i=1^nμ_ T(i)≤-Cn for…
For each n∈N, prime p, and α∈(Z∪±∞)∖0, let Z^(p,α)_n be the Q-vector space generated by the p-adic multiple zeta values ζ_p,α(w) of weight n, with Z^(p,α)_0=Q generated by ζ_p,α(∅)=1. The conjectural p-adic multiple-zeta-value structure.…
Let p≠ 3 be a prime number, let P=p or 2p, and let ε=fracα+β p^1/3+γ p^2/33∈R_>1 be the fundamental unit of Q(P^1/3), where α,β,γ∈Z. The cubic analogue of the Ankeny–Artin–Chowla–Mordell conjecture. Then βnot≡ 0pmod p. The authors verified…
Let f(n) denote the minimal m≥ 1 such that n! = a_1… a_t with a_1<… <a_t=a_1+m. What is the behaviour of f(n)?
Let p be an odd prime. Define the truncated double sum S_p= ∑_k=0^p-1(-1)^k/8^k∑_j=0^k 2jchoose j2k-2jchoose k-j(6j+1)(6k-6j+1). The first supercongruence conjecture. For every odd prime p, S_p≡ -p/2pmodp^2. This conjecture concerns a…
For all t∈N and sufficiently large n, g_t(n)<frac1(log n)^log log n.
Let (a_n) be the recursively defined sequence considered in the paper. For positive integers x and m, let d_x,m denote the limiting density of indices n for which a_n≡ xpmod m. Density conjecture. If x and m are positive integers and 32…
Erdős: Suppose that S is a set of positive integers with the property that no element is the sum of a nonempty set of other elements. Such a set is called "sum-free." Let R(S) be the sum of the reciprocals of S. How large can R(S) be?…
Does the set n+φ(n):n∈N have positive lower density?