Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let (A,H,D) be a p-summable odd spectral triple and let F=D|D|^{-1}. Can the Chern–Connes character of its Fredholm module be constructed using only D and commutators [D,a] with elements a of A?
{\bf Definition:} Γ is almost treable if it admits a free action on probability space such that the equivalence relation associated to this action is almost treeable, i.e., it is an increasing union of treeable subequivalence relations.…
Extending illposedness for SQG to QG
For nontrivial elements g_1,\ldots,g_n\in G of distinct finite orders, do [p_{g_1}],\ldots,[p_{g_n}] generate a rank-n subgroup of K_0^{\mathrm{fin}}(C^*(G)), with every nonzero element outside the assembly-map image?
For a Fano contact manifold X with b_2(X)=1, is the contact structure uniquely determined by its rational contact lines, equivalently by the variety of minimal rational tangents?
Compare recursions for q,t-Catalan numbers C_n(q,t) with the recursions for HHH.
Open problem: Signings in the subtour polytope Michel Goemans Consider the subtour polytope P of the TSP on G = (V, E) (where we have dropped the degree constraints, without loss of generality, for the question below): P = {x \in RE :…
For symmetric g in L1(R) of norm 1, determine the infimum of the L1 norm of g*g-g, and decide whether it is attained.
Why measure it? (What are the real-world applications?)
Witsenhausen’s problem [6] asks for the largest measurable set on a unit sphere such that no two points in the set are orthogonal. More precisely, let S n−1 = {x \in Rn : kxk = 1} be the n-dimensional unit sphere, \omega be the standard…
(a) Khovanov and Rozansky [KR08b] used braid presentations to define a triply graded link homology theory whose Euler characteristic is the HOM- FLYPT polynomial. Find a description of this homology in terms of arbi- trary planar diagrams…
Call a graph an (ℵ_0,ℵ_1)-graph if it has a bipartition (A,B) so that every vertex in A has degree ℵ_0 and every vertex in B has degree ℵ_1. Problem Characterize the (ℵ_0,ℵ_1)-graphs.
Develop rigorous computer assisted methods for computing the Evans function in two dimensions.
Let X∈R^d× d be a symmetric matrix with (otherwise) independent gaussian entries. Prove (or disprove): E |X| lesssimE max_k |Xe_k|_2
For the higher-order correlation measures of the random Schrödinger model, determine the behavior of the density near and on the coincident planes E_j = E_k for j ≠ k.
Find families of examples of free-by-cyclic groups G such that b_1(G) > 2 and the BNS invariant of G has many components (up to the action of Out(G)).
In a graph G=(V,E) with a root node r, two spanning trees T_1 and T_2 are called r-independent if for any node x in V-r, the unique paths between r and x in T_1 and T_2 are internally node disjoint. Is it true that if G is k-connected then…
Is the monodromy homomorphism H^1(F) \to H^1(F) of the Milnor fiber determined by the arrangement data d_A?
Is C(G)\not\subseteq\mathbb{Q} equivalent to \mathbb{Z}/p\wr\mathbb{Z}\subseteq G for some prime p? More generally, is it equivalent to \mathbb{Z}/p\wr K\subseteq G for some prime p and some infinite finitely generated group K?
What happens when we allow X 530 Oberwolfach Report 8/2026 to be infinite countable? Is there a coarse variant of the Buneman graph that can model this data, allowing us to compute medians up to controlled error? Problem 3. Coarse median…