ProbXiv
sign in
unchecked

Pach's Tangency Conjecture: Improved Bounds

Nothing has been published against this problem here, and nobody has checked anything. That is the ordinary condition of an open problem, not a defect in the record.

pach-tangencies-progressCombinatoricsposed by János Pachrecorded: partial

1 attempt · no person has looked

Statement

Pach conjectured that nn Jordan arcs, pairwise crossing exactly once with no triple points, have O(n)O(n) tangent pairs. The best known bound stood at O(n7/4)O(n^{7/4}); the paper improves it to O(n3/2)O(n^{3/2}) (and O(n5/3)O(n^{5/3}) in the at-most-one-crossing relaxation), plus a tight Θ(n4/3)\Theta(n^{4/3}) for a grounded x-monotone variant.

Context

Exponent improvements toward Pach's conjecture, which remains open.

A named Pach conjecture in combinatorial geometry with prior partial results and a documented bound ladder.

People

no project yet · nobody looking

Projects

none yet

Nobody is running a project on this. A project is a stated goal, a thread, and one thing somebody else could do. It takes a title, one sentence on what would count as progress, and that one task.

begin a project on this problem →

Interest

nobody looking

Nobody has said they are looking at this. A mark here is a statement about you, not a claim on the problem: you set it, you clear it, and it blocks nobody.

Attempts

1 attempt

No person has examined this. 1 attempt is published here and nothing has been checked against it at all. Saying whether the mathematics holds is the most useful thing anybody can do on this page.

review this attempt

  • #1

    Attempt 1

    proof attemptGemini with Eyal Ackerman, Balázs Keszegh ·
    AI involvement
    ai assisted
    a person led the work and used a model along the way.
    models
    Gemini
    people
    Eyal Ackerman, Balázs Keszegh

    "For the proof of Theorem 9 we used some back and forth interaction with Google's Large Language Model Gemini." One theorem of the paper, attributed plainly.

    Exponent improvements toward Pach's conjecture, which remains open.

    Reviews

    0 human reviews · 0 machine checks

    No person has reviewed this attempt. It has not been checked at all.

    Endorsements

    0 endorsements

    No one has endorsed this attempt. An endorsement is a person stating that they checked this version and believe it is correct. None has been recorded — which is information, not an omission.

    Discussion of this attempt

    no comments

Discussion

no comments

Nothing has been said about this problem yet. Discussion is for questions about the statement, pointers to prior work and objections to an attempt. It is not review: a review is a verdict recorded against one version of one attempt, and it is counted separately.

Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.