Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
A graph G is nearly bipartite if every subset S⊆ V(G) has an independent set of size ⌊ |S|/2⌋. Nearly bipartite deletion conjecture. A nearly bipartite graph can be made bipartite by deleting at most 5 vertices. The source presents this as…
Let A be a unital C*-algebra with the invariant basis number property or let A be a W*-algebra. For d∈N, consider unit inner product frames in the standard module A^d, with 1/d+1-equiangularity meaning that mutual inner-product products…
Let C_m(R^3) and the symplectic determinant D_S:C_m(R^3)→C be defined from the Hopf-lift polynomials p_α using the order 1<bar1<…<m<barm. Symplectic determinant conjecture. For every x∈C_m(R^3), |D_S(x)|≥1. This is the symplectic analogue…
Determine the linear stability of the Lagrangian elliptic equilateral-triangle homographic solutions of the classical planar three-body problem as a function of the mass parameter β=27m_1m_2+m_2m_3+m_3m_1/(m_1+m_2+m_3)^2∈[0,9] and…
Let g be of type A_2n-1, let barπ be the induced homomorphism from the Grothendieck ring of finite-dimensional representations of the non-twisted quantum affine algebra U_q(hatg) to that of the twisted algebra U_q(hatg^σ), and restrict to…
Let H be a planar graph and let k be a positive integer. A graph is kH-free if it contains no k pairwise non-adjacent independent H-minor models. MIS denotes the Maximum Independent Set problem. Independent-planar-minor MIS conjecture. For…
For each n≥ 1, let a_n^1,3(σ) count length-n permutations avoiding the pattern σ whose cycle lengths belong to 1,3, and let a_n^1,2,3(σ) count length-n permutations avoiding σ whose cycle lengths belong to 1,2,3. Pattern-avoidance…
Consider a one-parameter family of D-dimensional Anti-de Sitter metrics g_μν(Λ) arising as quantum-gravity low-energy effective theories, labelled by their cosmological constant Λ. Let M_Λ~R_- be the corresponding moduli space. AdS…
Under the constant-parameter model Y_i,n=[1mσ W_i/n+τε_i,nu001b[0m, i=1,…,n, where (W_t) is standard Brownian motion, ε_i,nstackreli.i.d.~N(0,1), the noise is independent of the Brownian motion, and σ,τ>0, the report states that for every…
Is every rank-one convex function f:R^2× 2→R quasiconvex?
Let G be a bridgeless graph, and let Φ_G(Q) denote its flow polynomial. Welsh's conjecture. For any bridgeless graph G, Φ_G(Q)>0 for Q∈(4,∞). The conjecture parallels the Birkhoff–Lewis result for chromatic roots, but the source reports an…
Let (a,b,c) be the side lengths of the triangular tile, with angles determined by a,b,c, and let T be a triangle with angles (2α,2β,α+β). Tile-count divisibility conjecture. If T can be tiled by copies of (a,b,c), then the number of tiles…
For odd characteristic p, the superblocks of the twisted group algebras S(n)=KwidehatS_n/(z+1) corresponding to weight spaces of the basic representation V(-Λ_0) whose weights lie in the same Weyl-group W-orbit are derived superequivalent.
Let G be a balanced bipartite graph with 2n vertices, and write δ(G) for its minimum degree. Heinig's conjecture. If n is sufficiently large and δ(G) ≥ n/2+1, then G is Hamilton-generated, meaning that its cycle space is generated by its…
Let S be a closed piecewise-linear surface, and let (G_S^⋆, p) be its coned framework: the framework has the vertices and edges of S, together with a cone vertex p_⋆ joined to every vertex of S. A first-order flex is an infinitesimal…
Let X be a smooth projective variety and let L be a big and nef Q-divisor on X. A rational curve deforming to cover X is a rational curve whose deformations cover X. Rational-curve conjecture. If K_X+L is not pseudo-effective, then there…
Let X be a finite CW complex of dimension 2d, and let α∈Br(X). Antieau-Williams' conjecture. ind(α)|per(α)^d-1. This is the proposed topological analogue of the period-index conjecture for fields; the factor 2d reflects that a complex…
Conjecture: If G is a transitive permutation group on a finite set Ω, then for any distinct α,β∈Ω there is an element g∈ G with α^g=β whose number of fixed points is different from 1.
Let (T,σ,M) be a primitive substitution tiling system of R^d with finite local complexity. Call it conservation-forced when it satisfies the conservation-law conditions defined earlier in the paper. Let λ_PF(M) denote the Perron–Frobenius…
Let G be a graph on n vertices. A path separating system of G is a collection of paths in G such that, for every ordered pair of distinct edges (e,f), some path contains e but not f. Balogh et al.'s conjecture. Every graph of order n…