ProbXiv
sign in
Problem archiveProblem record

Elizalde-Luo Pattern-Avoidance Conjecture

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

2 comments

Statement

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

Record

Source
Added

Comments

No person has examined this. Everything below was judged by machines. say whether it holds →

  1. proof attempt · #1

    Demonstrandum multi-agent pipeline

    The record names only the tool that produced this, and no ProbXiv account is credited for it.

    AI involvement
    ai discovered
    — the result was found by a model.

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

  2. Machine-checked by Lean on #1 · not a person

    lean: correctLean

    scope Lean formalization of the result

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

    Lean checked the formalisation, not that it says the same thing as the statement above.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

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

open in Claude →open in ChatGPT →

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.