Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
If I and A/I are graph C*-algebras, when is A a graph C*-algebra, and can the obstructions be described using K-theoretic data?
Does there exist a group G that contains a family (G_n)_n∈ N of finite-index subgroups such that for every n there is a homomorphism f_n:G_n→ Z whose kernel is of type F_n, but not of type F_n+1?
Let I=[0,b] with b≤ 1, and let t_M(I) denote the monic integer transfinite diameter. Define n=max(2,⌈1/b⌉), which is the smallest integer n≥ 2 such that 1/n≤ b. Zero-endpoint interval conjecture. One has t_M(I)=1/n. This is presented as an…
If M is rationally inessential, then it is macroscopically small.
Let G^c be a 2-connected c-edge-colored multigraph on n vertices, where n≥ 10 and c≥ 3. Let rd(G^c) denote its rainbow degree and let m be its number of edges. Proper Hamiltonian cycle conjecture. If rd(G^c)=c and m≥ cbinomn-22+4c+1, then…
Does there exist a bounded pseudoconvex domain \Omega\subset\mathbb{C}^2 with C^2 (or C^\infty) boundary and a Stein neighborhood basis that is not 1-H-convex?
Let K_n be the complete graph on n vertices, let A be the achievement graph, and let E^r and E^g be the precolored red and green edge sets. Achievement-game tractability conjecture. Graph Ramsey achievement games played on (K_n,A,E^r,E^g)…
Let V and W be potentials on [?]R^n satisfying the following assumptions: |V(x)|+|x| |DV(x)|+|x|^2|D^2V(x)|≤ c; liminf_|x|→∞V(x)>0; τ_0:=-liminf_|x|→∞x·∇ V(x)/4V(x)<frac12; W=W_1+W_2, where W_1∈ L^n/2( R^n)+L^(n+1)/2( R^n) and…
Let D⊆ C(z) be a Diophantine set. For each integer n≥ 0, write C[z]_n=C^n+1 for the polynomials of degree at most n. Kollár's conjecture. If, for infinitely many integers n≥ 0, the set D contains a Zariski open subset of C[z]_n, then…
Let X be a normal projective complex variety admitting a non-invertible polarized endomorphism f: X longrightarrow X. Suppose that X has a log canonical model μ: Y longrightarrow X. Broustet–Höring's conjecture. The morphism μ is an…
An arithmetic progression of twin primes with l terms is a sequence a+kb, for k=0,1,…,l-1, whose terms are first members of twin-prime pairs, where a and b are positive integers. Twin-prime progression conjecture. For every natural number…
Hempel’s distance function was chosen so that it would capture the geometry, and indeed it does that very well, yet in some ways it feels unnatural. The Hatcher-Thurston complex HT(S) seems much more natural to us, since and pairs of…
Let X_n_n be a matrix sequence with spectral symbol f, written X_n_n~_λ f. Assume that the imaginary parts satisfy |Im(X_n)|_1=o(n). Real-part spectral-symbol conjecture. Is it true that Re(X_n)_n~_λ f? The question asks whether a matrix…
Let G_λ be the group associated with a Young diagram λ, and let dimλ denote the dimension of the corresponding representation. Consider the diagrams λ∈(4,2^2),(6,3),(4^2,1), for which the computed order of G_λ is (dimλ)!/2.…
Let C_n,k(q,p) be the q,p-Catalan triangle, and let S'_n,k(312) denote the set of 312-avoiding permutations represented in the triangle. For a permutation π, write inv(π) and coinv(π) for its inversion and coinversion statistics. Bivariate…
Let e be a positive integer, and let Z be a locally complete intersection variety of pure dimension over a number field K. Define κ(Z)=dim(Z)+min_P∈ Z(overline K)moi^aloc_K(P),P(Z). Here moi^aloc_K(P),P(Z) is the local motivic oscillation…
Let C,c>0 be fixed constants. Let G be an n-vertex C-Ramsey graph, meaning that G has no clique or independent set of size Clog n. Let k satisfy cn≤ k≤ (1-c)n, and let X be the number of edges induced by a uniformly random k-vertex subset…
Let (W,S) and (W',S') be Coxeter systems with Bruhat orders ≤ and ≤', respectively. For x,y i W and x',y' i W', suppose that the intervals ([x,y],≤) and ([x',y'],≤') are isomorphic as posets. Their associated Kazhdan–Lusztig polynomials…
Let n≥2 and let s,t satisfy 0<s≤ t. Let L(P) be the likelihood function defined in the source by equation (newLP). Alternative likelihood conjecture. The matrix P= 2s/n^2(s+t) frac1n^2 … frac1n^2 2t/n^2(s+t) frac1n^2 frac1n^2 … frac1n^2…
Let k≥ 3 be an integer. Let P be a set of n points in the plane and let L be a set of n lines in the plane. Define the incidence set and incidence graph by I=I(P,L)=(p,ℓ)∈ P×L:p∈ℓ, G=(P∪L,I). The incidence graph has vertex parts P and L,…