Computation using Sympy to understand Spin Algebra
-
Updated
Dec 13, 2020 - Jupyter Notebook
Computation using Sympy to understand Spin Algebra
c++ programs on groebner basis and polynomial ideals computation
In this project, we attempt to reformulate various notions from classical commutative algebra (such as flatness, regularity, smoothness, etc.) in an entirely categorical manner, so as to be able to later write down their analogues in derived algebraic geometry without having to develop extra theory. We will also be presenting certain application…
Notes on the derived functor \Ext^i(-,-)
Field-algebra based on Group / Ring symbolic vector module extension
Programs and examples of computations of schemes evinced by generalized additive decompositions (GADs)
A curated list of Algebraic Statistics tools and resources.
A Macaulay2 package to deal with t-spread ideals of a polynomial ring. Some details can be found in this paper.
Equivalent definitions of flatness
An experimental, companion implementation of the Macaulay2 computer algebra system in Rust.
c++ library for mathematical computations
An introduction to the basic ideas of commutative algebra
A computer algebra system in Smalltalk
A software package for algebraic, geometric and combinatorial problems on linear spaces. By R. Hemmecke, R. Hemmecke, M. Köppe, P. Malkin, M. Walter
Rings: efficient JVM library for polynomial rings
The agda-unimath library
The primary source code repository for Macaulay2, a system for computing in commutative algebra, algebraic geometry and related fields.
Add a description, image, and links to the commutative-algebra topic page so that developers can more easily learn about it.
To associate your repository with the commutative-algebra topic, visit your repo's landing page and select "manage topics."