Source authenticated

Elizalde-Luo Pattern-Avoidance Conjecture

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$?

Exact FrontierDelta

Prior state unknownproved

Scope and record

Occurred: Jul 12, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: lean-verified. Publication: announcement. AI contribution: ai-discovered. Imported under CC BY 4.0.

Canonical aliases: Elizalde-Luo Pattern-Avoidance Conjecture · Elizalde-Luo

Confidence: Not scored

Registry verification: lean verified · announcement · resolved

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

Demonstrandum multi-agent pipeline
model · ai model contributor

Lineage and corrections

This event attributed to Demonstrandum multi-agent pipeline

Act on this frontier

Verify, challenge, or extend the result.

Elizalde-Luo Pattern-Avoidance Conjecture — Mathematical Frontier Network