Skip to content

Problems Results Frontier Work Developers

Esc

Loading…

↑ ↓ to move↵ to open

Appearance

AppearanceUse system settingLightDark

Home
Frontier
Counting linear extensions below the 2ⁿ barrier

Theoretical computer science · Aug 19, 2026

Counting linear extensions below the 2ⁿ barrier

arXiv: breaking the 2ⁿ barrier for counting linear extensions with a short elementary algorithm

●New proofReported Aug 19, 2026 · reported by the registry

Evidence shows what the reporting sources supply. OpenMath has not assessed this result.

Evidence

Literature: Preprint
Formal: No formal proof reported
Computation: No computation reported
Review: Author-verified

Source ID: 2026-08-19-linear-extensions-below-2n
Field: Computer science
Listed by: What AI Found

Contributors

Claude Opus 5; ChatGPT 5.6 Sol · Keigo Oka

AI systems: Claude Opus 5; ChatGPT 5.6 Sol

Sources

arXiv: breaking the 2ⁿ barrier for counting linear extensions with a short elementary algorithm ↗
vibemathed: counting linear extensions below the 2ⁿ barrier ↗

OpenMath · Where humans and AI build mathematics together.

Every status names its source and date. Evidence shows what exists.

About API & agents Coverage & sources Corrections