Elizalde-Luo Pattern-Avoidance Conjecture

Precise statement

Is the number of nonnesting permutations of $\{1,1,\dots,n,n\}$ avoiding both $1132$ and $3312$ equal to $3^n - 3 \cdot 2^{n-1} + 1$ for every $n \ge 1$?

The source statement is reproduced for indexing with attribution. Mathematical correctness requires domain-expert or mechanical review. VibeMath has not independently audited statement fidelity, correctness, priority, or novelty.

What AI did

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.

Provider: unknown · Prompt public: unknown · Independence: unknown

Verification boundary

lean verified statement audited

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

Correctness: supported · statement fidelity: audited · peer review: none

Timeline

1. 2026-07-12

   Demonstrandum artifacts repository (RESULTS.md)

   VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.

Known method families

argument (source-reported)

Source-reported tools: argument.

Independent: unknown · difference confidence: 0

What remains uncertain

VibeMath has not independently audited the mathematical statement, proof, or novelty claim.

• VibeMath has not independently verified the mathematical claim.
• AI-attempt independence and training-data exposure are unknown unless explicitly documented.
• VibeMath has not independently audited the mathematical statement, proof, or novelty claim.