Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Determine the reverse-mathematical strength of Alexandroff's one-point compactification theorem for countably based MF spaces.
Assume the Ultrapower Axiom, the Ground Axiom, and that there exists a supercompact cardinal. Ultimate L conjecture. Then V=Ultimate L. This conjecture proposes that the Ultrapower Axiom, together with the Ground Axiom and a supercompact…
Let T be one of ACA_0, ATR_0, Π^1_1mathchar`-CA_0. An ultrafilter U is a P-point if, for every partition N=S_0∪ S_1∪… with S_n∉U for every n, there is an A∈U such that A∩ S_n is finite for every n. It is Ramsey if under the same hypothesis…
Let X be a regular Hausdorff space. A space is hereditarily separable if every subspace is separable, and hereditarily Lindelöf if every subspace is Lindelöf. Hajnal–Juhász basis conjecture. The following are equivalent: X is hereditarily…
Are the following decidable? \begin{enumerate}[a.] \item Given a finite set of tiles in mathbbZ^n, is there a continuous tiling of F(2^ mathbbZ^n) with those tiles? \item Same as a, but where we are given that there is a (not necessarily…
Let G be a Schreier graph of a free pmp (probability measure preserving) action of a finitely generated group Γ. \begin{enumerate}[a.] \item If Γ is non-amenable, does G admit a measurable perfect matching? \item What if Γ is just non-two…
Is the complement of the finite spectrum of every first-order sentence also a finite spectrum? Equivalently, is NE=coNE?
Is the measurable arboricity of a Borel graph always equal to its actual arboricity?
\begin{enumerate} \item Is C[t_1,…, t_n] definable in C(t_1,…, t_n)? \item Is there a diophantine definition? \end{enumerate}
Without assuming the axiom of choice, can a nontrivial elementary embedding V→V exist?
Under a given analog of PFA for ℵ_2, how many cofinal types of directed sets of cardinality ℵ_2 are there?
Let F be a countable field, and let diamondsuit(ω^ω,=^∞) denote the parameterized diamond principle appearing in the source. Diamond principle conjecture. If diamondsuit(ω^ω,=^∞) holds, then there is a mad family of block subspaces of…
Question 5 (Koenigsmann). Given Q∗ ⊆ Q∗∗, both elementary equivalent to Q (in the language of rings). Does it imply that ( Q∗)alg ∩ Q∗∗ = Q∗ (i.e. is Q∗ relatively algebraically closed inside Q∗∗ )? If the answer is "NO" in some case, then…
\begin{enumerate} \item Does Con(ZFC) imply Con(MM for posets of size ℵ_1)? \item Is there a stationary set preserving poset of size ℵ_1 which is not semiproper? \end{enumerate}
The problem concerns the extension of Monadic Second Order Logic (over a binary relation representing the edge relation) with the following atomic formulas: " Card(X) = Card(Y) " " Card(X) belongs to A " where A is a fixed recursive set of…
In ZF, let a cardinal number be defined as an equivalence class under equinumerosity. For a graph, its chromatic index is the least cardinal number of colours in a proper edge-colouring; its distinguishing number is the least cardinal…
Let T be a complete superstable metric theory, let σ be a new symbol for a unitary function and let Tσ be the theory T ∪ "σ is an automorphism". Assume that TA, the model companion of Tσ exists. Is TA supersimple up to perturba-tions of…
Let n≥ 1 be a number. Let Δ_n be the graph on R^n connecting points of rational Euclidean distance. The adjacent distance-graph consistency conjecture. The statement that the chromatic number of Δ_n is countable while that of Δ_n+1 is not…
Question 15 (Rojas). What is the smallest n such that Hilbert's Tenth Problem over Z restricted to one polynomial in n variables is undecidable? Minimal n is known to be 2 ≤ n ≤ 22 by Matijaseviˇ c, and probably 2 ≤ n ≤ 11 by some Chinese.…
Question 5 (Pheidas). An additive polynomial in Fp[Z] is a polynomial of the form F (Z) = α0Z + α1Zp + α2Zp2 · · · + αnZpn (αi ∈ Fp) These are the polynomials that satisfy f (A + B) = f (A) + f (B) for all A, B ∈ Fp[Z]. Can we…