Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let G be a sufficiently large K_3-divisible graph on n vertices, meaning 3| e(G) and 2| d_G(v) for every vertex v. The girth of a triangle decomposition is the smallest integer g for which it contains g triangles spanning at most g+2…
Let K be a finite algebraic extension of mathbbF_q(X), with constant field exactly F_q, and let g be the genus of K. For A∈GL_n(K_A), let h_A be the additive twisted height and set λ_1(A)=min_ξ∈P^n-1(K)h_A(ξ). Define…
Let ( G,σ) be an irrational T-symplectic abelian group, let W_ G be its associated algebra, and let rm Sp( G) act on W_ G. Assume that the symplectic form σ is diagonalizable and that this action is ergodic, meaning that it has no…
If G is a free-by-cyclic group with exponentially growing monodromy then does it have non-vashing homology torsion growth?
Let X be a curve over bF_q. For rank r, write whatζ_X,r(s)=what Z_X,r(q^-rs) for the non-abelian zeta function of rank-r semistable bundles, and let whatζ^SL_r_X(s) be the zeta function associated to SL_r. The constant c_X,r is independent…
Given a closed orientable 3-manifold M, are there, up to homeomorphism, only finitely many closed orientable 3-manifolds N satisfying the Poincare--Thurston geometrization conjecture for which there is a degree-one map M\to N?
Let K_2d^d be the complete d-uniform hypergraph on 2d vertices, and let overline cr_d(K_2d^d) denote its rectilinear crossing number in d dimensions. Rectilinear crossing-number conjecture. overline cr_d(K_2d^d)=Ω (2^d √d). The paper…
Let (X,G) be a minimal topological dynamical system, where G is an amenable group, and suppose that (X,G) admits no essential K-IT-tuples. Let π_eq:X→ X_eq be the factor map to the maximal equicontinuous factor. Huang–Lian–Shao–Ye's…
Let H be a simple 3-partite hypergraph with sides A, B, and C, where simplicity means that no edge is repeated. Let ν(H) denote the maximum matching size. Generalized Drisko conjecture. If |A|=2n-1, deg(a)≥ n for every a∈ A, deg(v)≤ 2n-1…
Let D be a family of smooth and proper dg categories over an excellent scheme U. For a quasicompact and semiseparated scheme V with a morphism φcolon V→ U, write D_V for the base change of the family and let a V-linear semiorthogonal…
Let G be a planar graph of order n, and let ψ_3(G) denote its 3-path vertex cover number. Planar 3-path vertex cover conjecture. ψ_3(G) ≤ 2/3n. This conjecture was first mentioned by Brešar et al. in 2011. Equality is attained by, for…
Given a (PL) compact connected 4-manifold N, decide whether N is PL homeomorphic to S^4.
Let M be a locally conformal Kähler manifold, meaning that it is a Hermitian manifold whose metric is locally conformally equivalent to Kähler metrics. Suppose that M has the “same topology” as a Kähler manifold. Vaisman's conjecture. The…
A real algebraic variety is a complex variety X defined over the real numbers, with real part X(R) equal to the fixed-point set of complex conjugation. It is an M-variety when ∑_k b_k(X(R))=∑_k b_k(X(C)). For homology with closed support,…
Fix a finite group G. Let O be the categorical Barratt–Eccles operad, with O_n=i^*Map(G,Σ_n). For an indexing system C, let F be its associated sequence of families of subgroups of G×Σ_n, and define O^ F_n=i^*f∈ O_n| Stab(f)∈ F_n.…
For every maximum degree bound \Delta, does there exist n_0 such that for all n\geq n_0, whenever n-vertex graphs F_1,\ldots,F_t are r_i-regular with r_i\leq\Delta and \sum_{i=1}^t r_i=n-1, the complete graph K_n decomposes into…
The paper studies derivations in dRzk, a proof system for synthetic ∞-categories, and the ext-style-hypotheses condition from Definition of the source. The preceding conservativity theorem establishes the result for derivations satisfying…
Let A be a multidimensional (0,1)-matrix, let A(Λ) be the matrix defined by a hyperplane cover Λ, and suppose that A contains a polydiagonal. Polydiagonal-to-diagonal conjecture. Then A contains a diagonal. The source proposes this as a…
Let G be any unweighted directed graph, possibly with loops and bidirected arcs, and let α_1 and α_2 be two jumping constants. For each jumping constant, write π_α_i for the corresponding PageRank vector. Extremal PageRank distance…
For a digraph D, define the balanced degree of a vertex x by σ(x)=d^+(x)-d^-(x). A digraph is strongly locally irregular if σ(x)≠σ(y) for every arc xy, and let slir(D) be the minimum number of colors in an arc coloring whose color classes…