A
licenseNot graded
qualityC
maintenanceExposes the full SageMath computer algebra system to LLM clients through MCP tools for symbolic mathematics, solving, calculus, plotting, and number theory.
45 npm
1
Creative Commons Zero v1.0 Universal
sagemath-mcp
Related Servers
Alternatives to sagemath-mcp
No user-submitted related servers found.
Related Servers
- AlicenseNot gradedqualityDmaintenanceProvides deterministic AST graph queries and rule validation for AI coding agents via MCP tools, enabling structural intelligence without LLM calls.2 npmMIT
- AlicenseAqualityAmaintenanceProvides MCP tools to verify logical expressions and retrieve decision statistics, with verdicts VALID, INVALID, or UNDECIDED.2AGPL 3.0
- AlicenseNot gradedqualityBmaintenanceProvides a code graph querying and visualization MCP server, enabling users to search, trace, and describe code components, overlay diffs, and explore architecture through natural language.MIT
- AlicenseCqualityDmaintenanceEnables querying the LitCoin knowledge graph for nodes, edges, and relationships, with support for semantic similarity search over nodes and edges via MCP.5MIT
- AlicenseNot gradedqualityAmaintenanceEnables querying a Neo4j knowledge graph built from Git repositories and relational database schemas via MCP, with tools for schema inspection, Cypher queries, and searching code and database entities.MIT
TDQS
A3.7/5.0
Scored across 16 tools
Disambiguation3/5
The tools cover overlapping graph-theoretic concepts (e.g., is_efec, is_efec_cubic_brick, has_cyclic_edge_cut, cyclic_edge_connectivity all relate to edge connectivity), which may cause some misselection. However, each tool has a distinct focus and the descriptions are detailed enough to clarify most differences.
Naming Consistency4/5
Most tools follow a clear snake_case pattern with prefixes like is_, has_, classify_, list_, identify_, run_. A few outliers like cyclic_edge_connectivity and graph_info are noun phrases rather than verb phrases, creating a slight inconsistency but not a major one.
Tool Count4/5
16 tools is slightly above the ideal 3-15 range but still reasonable for a specialized graph analysis server. The tools cover a broad set of related properties without being excessively redundant.
Completeness4/5
The tool set covers many graph properties and includes run_sage for arbitrary computations, making it functionally complete. However, there are some specific checks (e.g., near-bipartite, brick, efec) that are covered, but not all possible graph invariants, so it is not exhaustive.
Maintenance
ActivityMaintained
ResponsivenessNo issues