Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Is the uniform subgroup membership problem decidable for (finitely generated free)-by-cyclic groups? That is, for a fixed group G=F_nrtimes Z, is there an algorithm that, given elements w,h_1,…,h_k∈ G, decides whether or not w belongs to…
Let V be the Lorentzian real vector space of dimension 14 associated with the incidence diagram I_26, let B(V) be its real hyperbolic ball, and let P=P(v∈ V;⟨ v,v⟩<0,⟨ v,e_i⟩≥0 ∀ i∈ I) be the 26-cell, with Weyl point w_0. Let B^∘(L) denote…
Determine the maximum possible perimeter of a convex polygon in the plane with diameter at most 1 when the number of vertices is n=2^s with s≥ 4; equivalently, determine an optimal small 2^s-gon for every s≥ 4.
Let Σ_a be the polar cap and let I^α_1(Σ_a) denote the class of C^1,α isometric embeddings of Σ_a into the relevant codimension-one Euclidean space, with distinguished coordinate functions Y and Z. Criticality conjecture. For any α < 1/2…
Let X be a Kähler manifold, let D⊂ X be a smooth Calabi–Yau hypersurface in the anticanonical linear system, and let π:X∖ D→ B be a reasonable special Lagrangian fibration, assuming that the Kähler metric on X is complete. Let ∂ B denote…
Let G be a simple, undirected connected graph on n vertices. Let bf x be the positive unit eigenvector of its adjacency matrix corresponding to the largest eigenvalue, and define the principal ratio by γ(G):=fracx_maxx_min, where x_min and…
For k∈N, let F_≤ k and F_≥ k denote the continued-fraction sets whose partial quotients are respectively bounded above by k and bounded below by k. Write A+B=a+b:a∈ A,b∈ B and A≡Rmod 1 when A+Z=R. The continued-fraction upper-and-lower…
Let (X,T) be a totally minimal system, and let P(n) be a non-constant integral polynomial. Polynomial recurrence conjecture. There is a dense G_δ subset Ω of X such that, for every x∈Ω, the set T^P(n)(x):n∈ Z is dense in X. The conjecture…
Conjecture There exists a fixed constant c (probably c=1 suffices) so that every graft with minimum T-cut size at least k contains a T-join packing of size at least (2/3)k-c.
A fibered and strongly quasi-positive knot (or a fibered and strongly quasi-negative knot) is a knot having the stated properties; a friend is a knot associated to it by the trace-preserving construction studied in the paper. Fibered…
For each height n, the category of spectra of fp-type n is the thick subcategory generated by the truncated Brown–Peterson spectrum BP⟨ n⟩; equivalently, FP_n=Thick(BP⟨ n⟩), where FP_n denotes the category of spectra of fp-type n.
Let F be a graph. A graph G is F-free if it contains no copy of F; write chi(G) for its chromatic number and let Delta be its maximum degree. Alon–Krivelevich–Sudakov conjecture. For every graph F, there is a constant c_F>0 such that,…
For a finite simple undirected graph G, the degeneracy of G is the least integer d such that every non-empty subgraph of G has a vertex of degree at most d. For a positive integer k, a proper k-colouring of G is a map γ : V(G) → 1,…,k with…
Fix m, and let G^w_0,w_0 denote the big open double Bruhat cell in SL_m. For v∈ S_n, let Imm_v X(R,C) denote the associated dual canonical basis immanant, with R,C∈binom[m]n and the indicated admissibility condition when required.…
Applications to subspace arrangements Can earlier results of Barcelo on the relation between A-theory and subspace arrangements be extended beyond A_1 by showing that the higher A-groups vanish?
Let n≥ 3, and consider the ideals I_h=(x_1^3,…,x_n^3,h_3), I_e=(x_1^3,…,x_n^3,e_3) in ck[x_1,…,x_n], where h_3 and e_3 are respectively the complete homogeneous and elementary symmetric polynomials of degree 3. Betti-number conjecture. The…
Let n=am+1, where a and m are positive integers, and let p be the least prime divisor of m. Primality conjecture. If a<p and m|φ(n), then n is prime. This conjecture would generalize the preceding primality criterion from numbers of the…
Let F be a non-abelian free group of rank n. For every w∈ F, every finite group G, and every subset A⊆ G, define the word measure by P_w(A)=frac|w^-1(A)||G|^n, where w:G^n→ G is the word map induced by w. If w,w'∈ F induce the same word…
A link diagram is alternating when its crossings alternate between overcrossing and undercrossing along every component; an alternating link is one admitting a reduced alternating diagram. For such a link, crossing number is the minimum…
Let G be a connected noncomplete graph with n vertices, where n≥ 5, and let δ(G) denote its minimum degree. Li–Magnant's proper connection conjecture. Then pc(G)=2. This conjecture proposes that the sharp minimum-degree threshold δ(G)≥ n/4…