OpenSkillIndex← back to search
claude-codescience

Babysitter combinatorial-enumeration

Combinatorial object generation and counting

install
source · Clone the upstream repo
git clone https://github.com/a5c-ai/babysitter
Claude Code · Install into ~/.claude/skills/
T=$(mktemp -d) && git clone --depth=1 https://github.com/a5c-ai/babysitter "$T" && mkdir -p ~/.claude/skills && cp -r "$T/library/specializations/domains/science/mathematics/skills/combinatorial-enumeration" ~/.claude/skills/a5c-ai-babysitter-combinatorial-enumeration && rm -rf "$T"
manifest: library/specializations/domains/science/mathematics/skills/combinatorial-enumeration/SKILL.md
tags
#combinatorics#permutation-generation#combination-counting#oeis-lookup#mathematics
source content

Combinatorial Enumeration

Purpose

Provides combinatorial object generation and counting capabilities for discrete mathematics.

Capabilities

  • Permutation and combination generation
  • Partition enumeration
  • Generating function computation
  • OEIS sequence lookup
  • Polya enumeration
  • Species theory computations

Usage Guidelines

  1. Object Definition: Precisely define combinatorial objects
  2. Generation Strategy: Choose efficient generation methods
  3. Counting: Use generating functions for counting
  4. OEIS Lookup: Search for known sequences

Tools/Libraries

  • OEIS
  • SageMath combinat
  • SymPy combinatorics