experience-millennium-hodge
SolidFeel the awe of revealing how algebraic equations shape the very topology of smooth varieties, turning abstract holes into concrete formulas. Work through 30 interactive steps, at high intensity, over a multi‑day exploration. 揭示代数结构. revelar álgebra.
Install
Quality Score: 94/100
Skill Content
Details
- Author
- openclaw
- Repository
- openclaw/skills
- Created
- 5 months ago
- Last Updated
- 2 months ago
- Language
- Python
- License
- MIT
Similar Skills
Semantically similar based on skill content — not just same category
holomorphic-dynamics
Educational pack for holomorphic dynamics, complex iteration, fractal geometry, and data-driven dynamics (DMD/Koopman). Use this skill when the user asks about: complex dynamics, iteration on the complex plane, Julia sets, Mandelbrot sets, fixed points and stability, period doubling, bifurcation, topology of the complex plane, DMD (Dynamic Mode Decomposition), Koopman operator theory, skill dynamics as a dynamical system, fractal rendering, escape-time algorithms, or connections between dynamics and deep learning.
math-olympiad
Solve competition math problems (IMO, Putnam, USAMO, AIME) with adversarial verification that catches the errors self-verification misses. Activates when asked to 'solve this IMO problem', 'prove this olympiad inequality', 'verify this competition proof', 'find a counterexample', 'is this proof correct', or for any problem with 'IMO', 'Putnam', 'USAMO', 'olympiad', or 'competition math' in it. Uses pure reasoning (no tools) — then a fresh-context adversarial verifier attacks the proof using specific failure patterns, not generic 'check logic'. Outputs calibrated confidence — will say 'no confident solution' rather than bluff. If LaTeX is available, produces a clean PDF after verification passes.
math-olympiad
Solve competition math problems (IMO, Putnam, USAMO, AIME) with adversarial verification that catches the errors self-verification misses. Activates when asked to 'solve this IMO problem', 'prove this olympiad inequality', 'verify this competition proof', 'find a counterexample', 'is this proof correct', or for any problem with 'IMO', 'Putnam', 'USAMO', 'olympiad', or 'competition math' in it. Uses pure reasoning (no tools) — then a fresh-context adversarial verifier attacks the proof using specific failure patterns, not generic 'check logic'. Outputs calibrated confidence — will say 'no confident solution' rather than bluff. If LaTeX is available, produces a clean PDF after verification passes.