ProbXiv
sign in

Fulek's Question on the Extremal Function of L_3

Combinatorics · posed by Radoslav Fulek, 2009 · solved

1 attempt

Statement

Fulek defined a weight-five three-row 00-11 matrix L3L_3 and asked whether ex(n,L3)=O(n)\mathrm{ex}(n, L_3) = O(n). It is: every r×sr \times s matrix avoiding L3L_3 has at most 27r+2s27r + 2s ones, so 6n8ex(n,L3)29n6n - 8 \le \mathrm{ex}(n,L_3) \le 29n for n5n \ge 5. The same argument covers an infinite family of light three-row patterns, verifying a conjecture of Pettie and Tardos on linear light patterns for that family.

Context

the companion pattern Fulek proposed alongside L_3 is not covered by this method

A named question from a 2009 Discrete Mathematics paper, and the previously unresolved weight-five case of the Pettie-Tardos linear light pattern conjecture.

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 attemptCodex (GPT-5.6), Claude Code (Fable 5) with Jesse Geneson ·
    AI involvement
    ai assisted
    a person led the work and used a model along the way.
    models
    Codex (GPT-5.6), Claude Code (Fable 5)
    people
    Jesse Geneson

    The acknowledgement says the two systems were used for proof exploration, proof criticism, exposition and revision, with no specific step attributed, so the lowest tier applies.

    the companion pattern Fulek proposed alongside L_3 is not covered by this method

    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.