ProbXiv
Explorersign in

problems

Leaderboard716 problems
701–716 of 716 problems
  • TxGraffiti-Davila Conjecture 9Randy Davila (TxGraffiti), 2024

    If G is connected, cubic and diamond-free, must the zero-forcing number satisfy Z(G) ≤ γ(G) + 2? A connected cubic triangle-free 14-vertex graph has Z = 7 and γ = 4.

    disproved

    1 attempt

  • The Elton–Odell theorem gives, in every infinite-dimensional normed space, a unit-sphere sequence with mutual distances at least 1+ε. Over C, identifying vectors differing by a unimodular scalar gives a toroidal distance. Does every…

    solved

    1 attempt

  • The discrete-time Kac walk on S^n-1 started from a coordinate vector exhibits total variation cutoff at C_BRW n log n, where C_BRW ≈ 3.8916 is set by the speed of the leftmost particle in a branching random walk. The cutoff is therefore…

    solved

    1 attempt

  • Furthest Pair and its relatives admit f(d) n^2-Θ(1/d) algorithms, making them the standard examples of barely subquadratic computation, and whether that is optimal in superconstant dimension was open. Under SETH it is: Furthest Pair…

    solved

    1 attempt

  • Connes' rigidity conjecture asks whether an ICC group with Kazhdan's property (T) is determined by its group von Neumann algebra. Disproved for this class: two explicit countable discrete groups Γ_1 and Γ_2, both ICC and property (T), are…

    disproved

    1 attempt

  • Erdős Problem #603Paul Erdős, 1987

    VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    solved

    1 attempt · a verdict recorded from elsewhere

  • Must every r-differential poset have at least as many elements in each rank as Y^r, the r-th Cartesian power of Young's lattice? For r = 3 the new construction has fourth-rank size 50 against 51 for Y^3.

    disproved

    1 attempt

  • We prove a Nakai-Moishezon-type criterion for complex Hessian-type equations on projective manifolds whose associated degree-n polynomials are strongly strictly right-Noetherian. For strictly right-Noetherian polynomials of arbitrary…

    partial

    1 attempt

  • Arithmeticity of Degree-Six Symplectic Hypergeometric Monodromy GroupsJitendra Bajpai, Martin Dona, Martin Nitsche, 2025

    Bajpai, Dona and Nitsche left three degree-six symplectic hypergeometric monodromy groups unclassified as arithmetic or thin. Two of the three, C-47 and C-55, are arithmetic.

    partial

    1 attempt · a verdict recorded from elsewhere

  • The Papamanthou-Tollis Conjecture on Parameterized st-OrientationsCharalampos Papamanthou, Ioannis G. Tollis, 2008

    On the basis of experiments up to 5000 nodes, Papamanthou and Tollis conjectured a relation between the longest paths produced by their MaxSTN and MinSTN algorithms for st-orientations of biconnected graphs. A counterexample refutes it.

    disproved

    1 attempt · a verdict recorded from elsewhere

  • Amdeberhan-Medina-Moll Arctangent Sum ConjectureTewodros Amdeberhan, Luis A. Medina, Victor H. Moll, 2008

    Let x_n = tan(∑_k=1^n arctan k). Amdeberhan, Medina and Moll conjectured that x_n ∉ Z for every n ≥ 5. Any integer value x_n = m must satisfy |m| ≥ e^(1/2+o(1)) n log n, which forces #1 ≤ n ≤ N : x_n ∈ Z = O(log N). The conjecture…

    partial

    1 attempt

  • At the conjectured density, must every k-uniform hypergraph contain a short nontrivial even cover - a set of hyperedges covering each vertex an even number of times - with no superfluous polylogarithmic factors? Known up to polylog factors…

    solved

    1 attempt

  • Two Counterexamples in the Geometry of NumbersJ. W. S. Cassels and Chuanming Zong; Peter Sarnak, formulated by Chiu

    The paper gives counterexamples in dimensions eight and nine to two problems: the Cartesian-product problem posed by Cassels for critical determinants and formulated by Zong for lattice packings, and a question raised by Sarnak, formulated…

    disproved

    1 attempt

  • Does two-terminal reliability, the probability that s still reaches t when edges fail independently, admit a fully polynomial-time randomised approximation scheme? Asked explicitly in Kannan's 1994 survey and left open while the…

    solved

    1 attempt

  • Erdős Problem #858Paul Erdős, 1970

    VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    solved

    1 attempt · a verdict recorded from elsewhere

  • Two-Variable Factorial ConjectureArno van den Essen, David Wright, Wenhua Zhao, 2011

    Let L(x^ay^b)=a! b! on C[x,y]. The Factorial Conjecture asks whether L(f^m)=0 for every m≥ 1 forces f=0. The homogeneous two-variable case was settled by Liu and Sun; the inhomogeneous problem does not reduce to it, because radial…

    candidate

    1 attempt