SageMath
From MaRDI portal
Software:13572
swMATH825WikidataQ1165184 ScholiaQ1165184MaRDI QIDQ13572FDOQ13572
Last update: 16 September 2023
Copyright license: GNU General Public License, version 2.0
Software version identifier: 10.2.beta3
Official website: http://www.sagemath.org
Source code repository: https://github.com/sagemath/sage
SageMath is a free open-source mathematics software system licensed under the GPL. It builds on top of many existing open-source packages: NumPy, SciPy, matplotlib, Sympy, Maxima, GAP, FLINT, R and many more. Access their combined power through a common, Python-based language or directly via interfaces or wrappers.
- \texttt{SAGE} for number theorists
- Sage: A Basic Overview for Coding Theory and Cryptography
- Group theory in SAGE
- Computational mathematics with SageMath. Translated from the 2013 French original by the authors
- Sage for undergraduates
- Sage: creating a viable free open source alternative to Magma, Maple, Mathematica, and MATLAB
- The Sage project: unifying free mathematical software to create a viable alternative to Magma, Maple, Mathematica and Matlab
Cited In (only showing first 100 items - show all)
- Reverse-engineering the S-Bbox of Streebog, Kuznyechik and Stribobr1
- From M-theory higher curvature terms to \(\alpha^{\prime}\) corrections in F-theory
- A class of quaternary linear codes improving known minimum distances
- Directional complexity and entropy for lift mappings
- Toric elliptic fibrations and F-theory compactifications
- Ricci-Ollivier curvature of the rooted phylogenetic subtree-prune-regraft graph
- The development version of the \texttt{CHEVIE} package of \texttt{GAP3}.
- SFOPDES: a stepwise first order partial differential equations solver with a computer algebra system
- DiscreteZOO: a fingerprint database of discrete objects
- Implementing hybrid semantics: from functional to imperative
- Fully homomorphic encryption over the integers with shorter public keys
- On the multipliers at fixed points of quadratic self-maps of the projective plane with an invariant line
- Computing distance-regular graph and association scheme parameters in \texttt{SageMath} with \texttt{sage}-\texttt{drg}
- admcycles -- a Sage package for calculations in the tautological ring of the moduli space of stable curves
- An effective bound for the partition function
- Computing \(\widehat {HF}\) by factoring mapping
- Flexibility of affine cones over del Pezzo surfaces of degree 4 and 5
- Formally verifying proofs for algebraic identities of matrices
- A parametric approach to 3D dynamic geometry
- On classifying the divisor involutions in Calabi-Yau threefolds
- MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures
- Lattices with many Borcherds products
- Polymake and Lattice Polytopes
- Constructing genus-3 hyperelliptic Jacobians with CM
- Realizability and inscribability for simplicial polytopes via nonlinear optimization
- On the GIT quotient space of quintic surfaces
- A Singular Introduction to Commutative Algebra
- Semantic-aware fingerprints of symbolic research data
- Small \(f\)-vectors of 3-spheres and of 4-polytopes
- Existence of primitive 1-normal elements in finite fields
- Complete intersection fibers in F-theory
- An electronic compendium of extreme functions for the Gomory-Johnson infinite group problem
- A characterization of the family of secant lines to a hyperbolic quadric in \(\mathrm{PG}(3,q)\), \(q\) odd. II
- On special pairs of primitive elements over a finite field
- On the existence of pairs of primitive normal elements over finite fields
- Combinatorial Markov chains on linear extensions
- Transforming graph states using single-qubit operations
- Unirationality of RDP Del Pezzo surfaces of degree 2
- On the existence of pairs of primitive and normal elements over finite fields
- Ranks and symmetric ranks of cubic surfaces
- On flux quantization in F-theory
- Intersections of loci of admissible covers with tautological classes
- On the multiplicities of normalized Laplacian eigenvalues of graphs
- Integral triangles and perpendicular quadrilateral pairs with a common area and a common perimeter
- The F5 criterion revised
- The density of sets avoiding distance 1 in Euclidean space
- JGraphT—A Java Library for Graph Data Structures and Algorithms
- New software for computing asymptotics of multivariate generating functions
- Algorithm 898
- Algorithm 959
- Fast Library for Number Theory: An Introduction
- Letterplace
- Congruences satisfied by eta-quotients
- NZMATH 1.0
- Algorithms to compute the topological Euler characteristic, Chern-Schwartz-MacPherson class and Segre class of projective varieties
- A compendium on the cluster algebra and quiver package in \texttt{Sage}
- Computational tools for cohomology of toric varieties
- Critical points and number of master integrals
- Ideals, Varieties, and Algorithms
- How to implement a modular form
- On the sum of fourth powers in arithmetic progression
- Combinatorics of non-ambiguous trees
- Combinatorics of non-ambiguous trees
- Title not available (Why is that?)
- Selfish routing in public services
- Exploiting chordal structure in polynomial ideals: a Gröbner bases approach
- A first step in the design of a formally verified constraint-based testing tool: FocalTest
- Experimental data for Goldfeld's conjecture over function fields
- Open source computer algebra systems: Axiom
- Overview of the Mathemagix type system
- Groebner bases in Theorema
- Haydi: rapid prototyping and combinatorial objects
- Simplicial blowups and discrete normal surfaces in \textsf{simpcomp}
- Hermitian ranks of compact complex manifolds
- Computing weight \(q\)-multiplicities for the representations of the simple Lie algebras
- DiscreteZOO: towards a fingerprint database of discrete objects
- Neural ideals in SageMath
- Vinberg's algorithm for hyperbolic lattices
- Adventures in graph theory
- New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem
- CAPD::RedHom v2 -- homology software based on reduction algorithms
- Two-vertex generators of Jacobians of graphs
- Symbolic and numerical analysis in general relativity with open source computer algebra systems
- MathCheck: a math assistant via a combination of computer algebra systems and SAT solvers
- POLY: a new polynomial data structure for Maple 17
- Interoperability in the OpenDreamKit project: the math-in-the-middle approach
- SIROCCO: a library for certified polynomial root continuation
- A Lyapunov function construction for a non-convex Douglas-Rachford iteration
- Fuchsia: a tool for reducing differential equations for Feynman master integrals to epsilon form
- A Calabi-Yau database: threefolds constructed from the Kreuzer-Skarke list
- Quadratic Chabauty and rational points. I: \(p\)-adic heights
- MathChat: computational mathematics via a social machine
- Ore polynomials in Sage
- Computing the Dixon resultant with the Maple package DR
- Chabauty-Coleman experiments for genus 3 hyperelliptic curves
- Computation of Eisenstein series associated with discriminant forms
- House of graphs 2.0: a database of interesting graphs and more
- \textsf{ZpL}: a \(p\)-adic precision package
- Optimal line packings from nonabelian groups
- Using symbolic computation to prove nonexistence of distance-regular graphs
This page was built for software: SageMath
