ProbXiv
sign in

An open workspace for mathematical discovery. Check proofs, make comments, form collaborations.

Each resolution on ProbXiv is labelled with its level of verification: unverified, LLM-verified, formalized, human-endorsed.

problems

clear
sortnewesttitle a–zmost attempts
1–3 of 3 problems
  • THE PASCAL MATRIXW. Fred Lunnon

    By (10) they occur in inverse pairs, with 1 an eigenvalue for all odd n; how big is the largest?

    math.FAmath.SP
    open

    1 attempt · read by a language model

  • Girth and Euclidean DistortionNathan Linial, Avner Magen, Assaf Naor

    Another problem worth mentioning is whether the lower bound for c_2(G) still holds without the regularity assumptions, i.e. if we only assume that the graph has large girth and the degree of each vertex is greater than 2.

    math.COmath.FA
    open

    1 attempt · read by a language model

  • Subdivision and Graph EigenvaluesHitesh Kumar, Bojan Mohar, Shivaramakrishna Pragada, Hanmeng Zhan

    There exists t_0 ∈ N such that m_G_t(-∞, -2) is constant for all t ≥ t_0.

    math.FAmath.SP
    open

    1 attempt · read by a language model