القائمة
Algebraic K-theory for graphs — Grothendieck K0/K1, Mayer-Vietoris sequences
التثبيت باستخدام Codex أو Claude انسخ هذا Prompt والصقه في Codex أو Claude أو مساعد آخر ليراجع صفحة Skill ويثبّتها لك.
استنادا إلى تصنيف SOC المهني
Test model robustness with adversarial attacks and defenses
Multi-armed bandit simulation — epsilon-greedy, UCB1, Thompson sampling
Benchmark and compare ix algorithm performance
Embedded Redis-like cache with TTL, LRU, pub/sub, and RESP protocol
Category theory primitives — monad laws verification, free-forgetful adjunction
Chaos theory analysis — Lyapunov exponents, bifurcation, attractors, fractals
| name | ix-ktheory |
| description | Algebraic K-theory for graphs — Grothendieck K0/K1, Mayer-Vietoris sequences |
| disable-model-invocation | true |
Algebraic K-theory applied to graph structures.
When the user asks about K-theory computations on graphs, Grothendieck groups, K0/K1 invariants, or Mayer-Vietoris exact sequences for graph decompositions.
use ix_ktheory::graph_k::{graph_k0, graph_k1, GraphKTheory};
use ix_ktheory::mayer_vietoris::{MayerVietoris, ExactSequence};
Not yet available as a dedicated MCP tool. Use the Rust API directly.