algebraic_graph_construction
CommunityAlgebraic graph mutations for smarter SA search.
Education & Research#algebra#lean4#graph-theory#simulated-annealing#ramsey-theory#cayley-graphs#paley-graphs
Authorbneb
Version1.0.0
Installs0
System Documentation
What problem does it solve?
Translate a random graph search space into a structured algebraic space by constructing graphs from finite group generators (Cayley graphs) or quadratic residues (Paley graphs), enabling symmetry-preserving mutations during optimization.
Core Features & Use Cases
- Algebraic mutation space: mutate generators instead of edges to dramatically reduce search space.
- Targeted witnesses for Ramsey bounds: focus on circulant/Paley graphs and Cayley constructions.
- Lean 4 templates and practical guidance for verification and experimentation.
Quick Start
Start an algebraic SA run by selecting a target Ramsey bound and letting the tool initialize from a Cayley/Paley witness.
Dependency Matrix
Required Modules
None requiredComponents
Standard package💻 Claude Code Installation
Recommended: Let Claude install automatically. Simply copy and paste the text below to Claude Code.
Please help me install this Skill: Name: algebraic_graph_construction Download link: https://github.com/bneb/perqed/archive/main.zip#algebraic-graph-construction Please download this .zip file, extract it, and install it in the .claude/skills/ directory.
Agent Skills Search Helper
Install a tiny helper to your Agent, search and equip skill from 471,000+ vetted skills library on demand.