Execute arbitrary SageMath code and retrieve its standard output, error, and exit status.
MIT
592,937 tools. Updated 2026-09-20 17:23
"SageMath" matching MCP tools:
- Retrieve SageMath documentation links for a symbol and check if the server exposes it for evaluate_sage code, helping validate names before evaluation.MIT
- Retrieve the version details of the local SageMath installation to verify compatibility and ensure proper setup for mathematical computations.MIT
- Check SageMath availability and basic readiness for mathematical computations through the MCP SageMath Server.MIT
- Executes SageMath code while streaming intermediate print() output line by line, then returns the final result.MIT
- Execute SageMath mathematical computations locally to solve equations, perform symbolic algebra, and analyze data using a configured SageMath installation.MIT
Matching MCP Servers
- AlicenseAqualityCmaintenanceEnables querying graph invariants and properties, such as matching covered, brick, and snark characteristics, via SageMath-backed MCP tools.16MIT
- AlicenseBqualityDmaintenanceEnables execution of SageMath mathematical computations through a local SageMath installation. Provides tools to check SageMath version and evaluate SageMath scripts with configurable timeouts and error handling.311MIT
- Evaluate SageMath expressions and return numeric or string results, with optional isolated workspace sessions for independent variables.MIT
- Clear all variables and state in a SageMath workspace to start fresh. Use when the current session needs isolation or recovery.MITDestructive
- Execute SageMath code in a persistent session where variables persist across calls, enabling multi-step workflows like transforms, modular arithmetic, and number fields.MIT
- Independently re-check a mathematical claim in Sage syntax and get a verdict: proved, refuted, supported, or undecided. Use it to confirm your algebra before presenting it.MIT
- Run all graph checks at once and return a summary. Prioritizes quick checks, skips irrelevant ones with reasons, and answers open-ended graph questions.MIT
- Classify each edge of a brick as b-invariant or quasi-b-invariant, reporting nontrivial barriers for quasi-b-invariant edges. For brick graphs only.MIT
- Determine the smallest k in [kmin, kmax] for which a graph has a cyclic k-edge-cut, returning null if none exists to suggest raising kmax.MIT
- Identify if a graph6 string or registry name corresponds to a known named graph in the registry, checking up to isomorphism.MIT
- Compute error-correcting code parameters—length, dimension, minimum distance, rate, and generator matrix—for Hamming and generalized Reed-Solomon codes.MIT
- Lists the named Sage workspaces belonging to this client, so you can find and reuse existing sessions before starting new computations.MIT
- Determines whether a given graph is a brick by checking 3-connectivity and bicriticality, reporting which condition fails if not.MIT
- Determine if a graph is near-bipartite: returns true when removing a pair of non-adjacent edges yields a bipartite matching covered graph, along with the witness pair.MIT
- Check if a graph has a cyclic edge cut of a specified size k, returning the bipartition as a witness via exhaustive search over vertex partitions.MIT
- Compute determinant, inverse, eigenvalues, rank, RREF, or transpose on one matrix. Use this for direct linear algebra instead of running general SageMath evaluation.MIT
- Solve any ordinary differential equation and return its general solution with arbitrary constants. Use this instead of a general evaluator for ODE problems.MIT