Quillen Suslin_algorithm

Jump to bottom Edit New page

Mahrud Sayrafi edited this page Mar 12, 2021 · 1 revision

title: Quillen-Suslin algorithm permalink: wiki/Quillen-Suslin_algorithm/ layout: wiki

If M is a projective module over a polynomial ring k[x1,..,xn], the Quillen-Suslin Theorem asserts that M is free.

Goal

Given a presentation of M by generators and relations, find a set of free generators.

Home
- Introduction
- Macaulay2 Contribution Guides
  - Git for Macaulay2 Contributors
  - Package Writing Style Guide
- Macaulay2 Workshop Guides
  - Git for Workshop Participants
- Macaulay2 Internals
  - Building Macaulay2 from source
    - Autotools Build System
    - CMake Build System
  - Components of Macaulay2
  - Case Studies
    - Adding a Function in Engine, Interpreter, and Core
    - Adding a Library for Interval Arithmetic
  - Web servers
    - InteractiveShell
    - Macaulay2Web
  - Other
- Frequently Asked Questions
  - CMake Build Problems
- Road map

Clone this wiki locally