schur-partition-search
CommunitySA-driven search for optimal Schur partitions.
Education & Research#optimization#combinatorics#coloring#simulated-annealing#partition#schur#algebraic-seed
Authorbneb
Version1.0.0
Installs0
System Documentation
What problem does it solve?
Schur-partition-search tackles combinatorial optimization problems in Schur partitioning by applying a simulated-annealing (SA) optimizer seeded from algebraic partitions, enabling exploration beyond algebraic seeds to find valid witnesses when E > 0.
Core Features & Use Cases
- Warm-started SA from algebraic seeds for improved convergence on Schur-partition problems.
- Flexible configuration for domain_size, number_partitions, and sa_iterations, with optional warm_start_from_node chaining.
- Returns the best partition found and records the associated energy E, signaling a valid witness when E=0.
Quick Start
Run a partition_sa_search with domain_size 537, num_partitions 6, sa_iterations 5000000, starting from a prior algebraic_partition_construction seed.
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: schur-partition-search Download link: https://github.com/bneb/perqed/archive/main.zip#schur-partition-search 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.