\(\def\NN{\mathbb{N}}\) \(\def\ZZ{\mathbb{Z}}\) \(\def\QQ{\mathbb{Q}}\) \(\def\RR{\mathbb{R}}\) \(\def\CC{\mathbb{C}}\)

# More Sage Thematic Tutorials¶

This is a repository of SageMath demonstrations, quick reference cards, primers, and thematic tutorials, grouped by theme, and licensed under a Creative Commons Attribution-Share Alike 3.0 License.

- A
*demonstration*is a short document giving a broad view of the available features on a given theme; it is typically presented during a talk, and lasts a couple minutes. - A
*quickref*(or quick reference card) is a one page document with the essential examples, and pointers to the main entry points. - A
*primer*is a document meant for a user to get started by himself on a theme in a matter of minutes. - A
*tutorial*is more in-depth and could take as much as an hour or more to get through.

This repository is meant as a place to collectively share and evolve documents for SageMath with the aim to merge the mature ones into Sage’s official documentation, and in particular its official thematic tutorials. For the convenience of the reader, the index below also includes links to some of the latter.

Contributions, from typo fixes to full-fledged tutorials are more than welcome. See Contributing.

Warning

Most of the documents below have been recently resurrected from an old repository. They are of varying quality and may be outdated or require additional software. It is planned to add status information on each of them.

## Documents for specific events¶

## Introduction to Sage¶

- Demonstration: Basics
- Demonstration: graphics (short)
- Demonstration: Documentation
- Demonstration: Databases
- Demonstration: Sage combines the power of multiple software
- Logging on and Making a Worksheet
- Introductory Sage Tutorial
- Tutorial: Using the Sage notebook, navigating the help system, first exercises
- Welcome to the Sage Tutorial!

## Calculus¶

## Algebra¶

- Demontration: Computing with ideals using Singular (early draft)
- Linear Programming (Mixed Integer)
- Group Theory and Sage
- Option Algèbre et Calcul Formel de l’Agrégation de Mathématiques: Groupe Symétrique et groupes de permutations
- Lie Methods and Related Combinatorics in Sage
- Tutorial: Using Free Modules and Vector Spaces
- Tutorial: Implementing Algebraic Structures

### Number Theory¶

### Monoids, representation Theory¶

- Demonstration: Sage + GAP4 + GAP3 + Chevie + Semigroupe (experimental)
- Demonstration: Calculations with character rings of the biHecke monoid (experimental)
- Demonstration: Computational representation theory for finite monoids (experimental)
- Demonstration: Representation theory of monoids and Markov chains: generalized Tsetlin library (experimental)
- Demonstration: A real life example, parallel testing of a conjecture on J-Trivial monoids using MuPAD (experimental)

## Combinatorics¶

- Demonstration: Combinatorics (short)
- Demonstration: Sage-Combinat
- Introduction to combinatorics in Sage
- Tutorial: Enumerated sets

### Algebraic Combinatorics¶

### Dynamics¶

### Numerical computations¶

## Programming and Design¶

- Demonstration: Cython: Python -> C
- Sage Introductory Programming Tutorial
- Tutorial: Comprehensions, Iterators, and Iterables
- Tutorial: Programming in Python and Sage
- Option Algèbre et Calcul Formel de l’Agrégation de Mathématiques: Tris et complexité
- Functional Programming for Mathematicians
- Tutorial: Objects and Classes in Python and Sage
- Tutorial: Testing a conjecture in parallel (draft)