ProbXiv
sign in

Elizalde-Luo Pattern-Avoidance Conjecture

Combinatorics · posed by Sergi Elizalde & Luo, 2025 · solved

1 attempt · 1 machine check

Statement

Is the number of nonnesting permutations of {1,1,,n,n}\{1,1,\dots,n,n\} avoiding both 11321132 and 33123312 equal to 3n32n1+13^n - 3 \cdot 2^{n-1} + 1 for every n1n \ge 1?

Context

A recent conjecture from a single combinatorics paper.

People

Attempts

1 attempt

No person has examined this. There is 1 attempt here and 1 machine check recorded against it. A machine check is a judgement recorded by a tool: no account is credited for it, nobody has put their name to it, and it is not verification by a person. Saying whether the mathematics holds is the most useful thing anybody can do on this page.

review this attempt

  • #1

    Attempt 1

    proof attemptDemonstrandum multi-agent pipeline ·
    AI involvement
    ai discovered
    the result was found by a model.
    models
    Demonstrandum multi-agent pipeline

    Found by the Demonstrandum multi-agent pipeline; every refutation ships a finite certificate, a mutation-tested checker, and an independent clean-room recomputation.

    Reviews

    1 machine check

    No person has reviewed this attempt. 1 machine check below — a machine check is not human verification.

    • Machine check · not human verification

      machine: correct

      Recorded from Lean ·

      scope Lean formalization of the result

      Proved and Lean-checked end to end; not externally refereed.

      No ProbXiv account is credited for this check. Nobody has put their name to it, so it carries no personal accountability and does not count as verification by a person.

    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.