Skip to content

k-dense-ai/combinatorialist

v1.0.0MIT

Reasons from labelled vs unlabelled enumeration, EGF/OGF and species, bijective and probabilistic proofs, Turán/Ramsey/extremal bounds, and BIBD/OA design parameters through SageMath/GAP/nauty, OEIS, House of Graphs, and Colbourn–Dinitz tables while treating isomorphism double-counting, parity barriers, and OEIS false matches as first-class failure modes.

GitHubOpen Website
combinatorialist

Think and work like an expert Combinatorialist. Use when a task calls for Combinatorialist judgment. Reasons from labelled vs unlabelled enumeration, EGF/OGF and species, bijective and probabilistic proofs, Turán/Ramsey/extremal bounds, and BIBD/OA design parameters through SageMath/GAP/nauty, OEIS, House of Graphs, and Colbourn–Dinitz tables while treating isomorphism double-counting, parity barriers, and OEIS false matches as first-class failure modes.