ProbXiv
sign in

The Leading Constant for Large-Order Davenport-Schinzel Sequences

Combinatorics · posed by Stated as open by Wellman and Pettie · solved

1 attempt

Statement

Wellman and Pettie noted that the true leading constant for large-order Davenport-Schinzel sequences was known only to lie in an interval. The paper improves the Roselle-Stanton lower bound to match the pigeonhole upper bound in the leading term, resolving the constant to exactly 1/2.

Context

Davenport-Schinzel sequences are classical extremal combinatorics (Agarwal-Sharir-Shor lineage), and the large-order leading constant was an explicitly stated gap in the Wellman-Pettie survey.

People

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 attemptClaude 4.6, GPT 5.2 with Jesse Geneson ·
    AI involvement
    ai assisted
    a person led the work and used a model along the way.
    models
    Claude 4.6, GPT 5.2
    people
    Jesse Geneson

    "Claude 4.6 and GPT 5.2 were used for proof development, exposition, and revision." No individual step is attributed, so the lower tier applies per the methodology.

    Reviews

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

    Discussion of this attempt

    no comments

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.

Discussion

no comments

Nothing has been said about this problem yet.

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