Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
What do different 4-manifold gauge theories see?
Conjecture: If a non-negatively curved, non-flat polyhedral manifold M has irreducible holonomy and b_2(M)>0, then M has a natural holomorphic structure, is biholomorphic to \mathbb{CP}^n, and its metric is a singular Kähler metric;…
Conjecture 6.4. Any simple digraph with no loops or digons has a vertex v such that |N +2 (v)| + |N+(v)| ≥ 2|N −(v)|.Notes: Recall, for comparison, SSN can be written as |N +2 (v)| + |N +(v)| ≥ 2|N +(v)|. To see how
Question 27 (1st Tue speaker). Ramanujan sums cq(x):= ∑ a<q, (a,q )=1 exp 2 πi (a/q )x can write Λ in terms of cq(X) and other arithmetic functions too. How do these look in the function field setting? 2
A more precise question was asked by Shafarevich [3, IX.4.3]: is the universal cover X̃ of a smooth projective complex variety X always holomorphically convex, i.e. does X̃ admit a proper holomorphic map to a Stein space? Constructing…
The famous no-three-in-line problem raised by Dudeney [6] in 1917: Is it true that one can select 2n points in [n]2 such that no three are collinear? Variation of no-three-in-line problem Ji Zeng (joint work with Andrew Suk, Yaobin Chen,…
Implementation of group-based cryptography In general very little work exists on efficient implementation of group-based protocols; over time we would like to build up a software library of such implementations.
Prove A_2 is universally optimal. Or find magic function for the sphere packing poblem in R^2.
Let G be a graph on at most ℵ_1 vertices which contains no K_4 and no K_ℵ_0,ℵ_0 (the complete bipartite graph with ℵ_0 vertices in each class). Is it true that ω_1^2 → (ω_1ω, G)^2? What about finite G?
Let H≅ℓ²(N), let C be a MASA of B(H) isomorphic to L∞(0,1), and let (C⊗1)^c denote its relative commutant in B(H)⊗max C_r(F₂). Is (C⊗1)^c equal to C⊗C_r(F₂)?
If K is a hyperbolic L-space knot, show that its branched cover Σ_2(K) is not an L-space.
Local Weak Cosmic Censorship Conjecture: for generic spacetimes arising from charged spherical collapse, the center endpoint \widehat{\Gamma} is not a locally naked singularity.
Do there exist any odd perfect numbers? (A perfect number equals the sum of its proper divisors.)
For N(x,y)=#{n\le x:k(n)\le y}, where k(n) is the squarefree kernel, determine the asymptotic behavior of N(x,y) outside H_{\varepsilon}={(x,y):\exp((\log\log x)^{\varepsilon})\le y\le x}, apart from the small-y range.
If E_epsilon[u_epsilon] is at most C epsilon^{N-m} and the concentration set is connected, is its limiting concentration set m-dimensional; and what is the optimal bound on the number of solutions as epsilon tends to zero?
Is there a bounded sequence a(n) such that each a(n) is computable in time O(log^A n) for some fixed A > 0 and such that \begin{equation*} \left| \sum_{n \leq X} \lambda(n) a(n) \right| > \epsilon X \end{equation*} for all X and some fixed…
Find an algorithm to compute the distance d(φ) of an arbitrary element φ∈M. We note that an algorithm to compute shortest paths between fixed vertices v,w in the curve complex has been presented by Shackleton in [45]. That problem is a…
State and prove the volume conjecture for the Gukov-Manolescu invariant.
Every bridgeless graph has a cycle double cover: a collection of cycles that covers each edge exactly twice.
Problem 3.7 (Brought by B. Green and T. Tao). Take a finite subset of the squares of integers, |A| = N. What lower bound can you get on A + A? One can get better than cN via Freiman's theorem. B. Green comments: I am not sure who posed…