Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
C. Simpson proved that if X is a variety and if ρ_X:π_1^geom(X)→ GL_2( mathbbQ_ℓ) is a representation whose algebraic enveloping contains SL_2, then ρ_X factors through ρ_Y:π_1^geom(Y)→ GL_2( mathbbQ_ℓ), where Y is either a curve or a…
Let R be a Gorenstein order, meaning a finite-rank algebra over Z. Let R^∨=Hom(R,Z) be its dual, and define Yun's zeta function by J_R(s)=∑_M⊆ R^∨[R^∨:M]^-s. Zeta-function identity for Gorenstein orders. One should have…
What are some non-GIT compactifications of M_d^N?
Let n be sufficiently large. Is there some choice of congruence class a_p for all primes 2≤ p≤ n such that every integer in [1,n] satisfies at least two of the congruences ≡ a_ppmodp?
(M. Flach) Find a natural definition of the Weil-´ etale topology so that the cohomology of Z vanishes in degrees greater than 3. Comments: 1) The current definition only vanishes for odd degrees and gives infinitely generated groups in…
If the sum of reciprocals of a set of positive integers diverges, does the set contain arbitrarily long arithmetic progressions?
Explore security of obfuscation constructions that use current candidate multilinear maps.
If 1<k<n-1, must binomnk have a prime divisor smaller than n/2, with the sole exception binom73=5·7?
Let p be a prime, and let I_p denote the number of parameters a for which the functional graph associated with the quadratic polynomial f_a is connected. The computations use the connectedness-testing algorithm described above and the…
- Monotone subsequences conjecture for fractional-part sequences involving the Euler–Gompertz constant
Let δ denote the Euler–Gompertz constant, and let p_k and q_k be the sequences defined earlier in the paper. For the even and odd subsequences, consider δq_2k-p_2k (k=1,2,3,…), and δq_2k-1-p_2k-1 (k=1,2,3,…). Monotone subsequences…
Let Q_0(r) be the quantity associated with the initial polynomial in the Zeroing Algorithm, and let the run-time denote the number of steps taken by that algorithm. Inverse-relationship conjecture. Q_0(r) and the run-time have an inverse…
Does the p-adic regulator of an algebraic number field not vanish?
Fix some constant C>0 and let n be large. Let A⊆ 2,…,n be such that (a,b)=1 for all a eq b∈ A and ∑_n∈ A1/n≤ C. What choice of such an A minimises the number of integers m≤ n not divisible by any a∈ A? Is this minimised by letting n≥…
Let (a_n)_n≥ 0 be a sequence of integers that preserves congruences, meaning that a_n+k≡ a_npmodk for all natural integers n and k. Such a sequence is called a pseudo-polynomial; a sequence of the form (P(n))_n≥ 0 for P∈Z[x] is called a…
For n∈ N, let P(n) mean 2<n and ∀ k∈ N, 0<k ∧ 2^k<n Longrightarrow n-2^k is prime. Is the set of natural numbers n satisfying P(n) infinite?
Let s∈N be square-free, and let P(s) be the set of Δ-primitives with square-free part s. A natural number n has a Δ-primitive decomposition if it can be written as n=α^2m with α∈N and m Δ-primitive. Fixed-square-free-part uniqueness…
Let p be a prime, and let g(p) denote the least primitive root modulo p, equivalently the smallest generator of the multiplicative group of integers modulo p. Vinogradov's conjecture. For every ε>0, for all sufficiently large primes p, one…
Are there infinitely many Wolstenholme primes?
Let k≥ 2 be large and let S(k) be the minimal x such that there is a positive density set of n where n+1,n+2,…,n+k are all divisible by primes ≤ x. Estimate S(k) - in particular, is it true that S(k)≥ k^1-o(1)?
For a real number α>1 and an integer N≥1, define N_α^AP(N)=#(l,m,n)∈N^3:l<m<n≤ N, ⌊ l^α⌋+⌊ n^α⌋=2⌊ m^α⌋. Let I(α) be the function defined by I(α)=α^-3∫_1^2u^3/α-2 du∫_1-1/u^1/u((1-v)v)^1/α-1 dv. Arithmetic-progression asymptotic…