## Overview

This course is part of the 2016 AARMS Summer School at Dalhousie University.

Instructor | Armin Straub
straub@southalabama.edu |

Lecture | Week 1: class meets MTWRF, 11-12:30pm (MTF in Dunn 302, W in Dunn 135, R in Dunn 301B)
Week 2: class meets MTWRF, 9-10:30am (MTWF in Dunn 135, R in Dunn 301B) Week 3: class meets MTWRF, 11-12:30pm (MTF in Dunn 302, W in Dunn 135, R in Dunn 301B) Week 4: class meets TWRF, 9-10:30am (TW in Rowe 1016, RF in Dunn 301B) |

Syllabus | syllabus.pdf |

## Problems

Each of the problems comes with a number of experience points (XP's) you gain by doing it (mostly correctly).

The goal is to reach a minimum of 42 experience points by the end of the course.

Many more XP's can be collected, and this is meant to allow you to focus on the problems you find most interesting and skip some that may be less relevant to you.

Date | XP's | due by | ||
---|---|---|---|---|

07/11 | problems01.pdf problems01-solution.pdf | 7 | =2+3+1+1 | Wednesday, July 20 |

07/12 | problems02.pdf problems02-solution.pdf | 10 | =2+1+2+2+3 | Wednesday, July 20 |

07/13 | problems03.pdf problems03-solution.pdf | 10 | =1+1+2+2+2+2 | Wednesday, July 20 |

07/14 | problems04.pdf problems04-solution.pdf | 3 | =1+2 (bonus: 7=2+2+2+1) | Wednesday, July 27 |

07/15 | problems05.pdf problems05-solution.pdf | 8 | =1+2+5 (bonus: 4) | Wednesday, July 27 |

07/18 | problems06.pdf problems06-solution.pdf | 10 | =2+1+1+1+5 (bonus: 2) | Wednesday, July 27 |

07/19 | problems07.pdf problems07-solution.pdf | 12 | =2+1+2+3+1+1+2 | Wednesday, July 27 |

07/20 | problems08.pdf problems08-solution.pdf | 7 | =2+3+2 | Wednesday, July 27 |

07/21 | problems09.pdf | 4 | =4 (bonus: 9=3+3+3) | Tuesday, August 2 |

07/25 | problems10.pdf | 8 | =2+2+2+2 | Tuesday, August 2 |

07/27 | problems11.pdf | 7 | =1+2+2+2 | Tuesday, August 2 |

07/29 | problems12.pdf | 5 | =2+3 (bonus: 3) | optional |

91 | currently achievable XPs (aim for at least 42 XP) |

## Sage

As part of this course, we will explore the open-source free computer algebra system Sage.

If you don't have access to Sage yet, please create an account at http://cloud.sagemath.com. This free cloud service does not require you to install anything, and you can access your files and computations from any computer as long as you have internet.

### Introduction to Sage

Here are the notebooks that we explored in lab:

If you are logged into your cloud account, you can play around with these files (which initially show up as read-only) by copying them to one of your personal projects (click on the light blue button with an `i`

and select `Copy...`

).

### LaTeX and Sage

The superb package sagetex allows you to include Sage computations into your LaTeX file. Below is the example file we discussed in lab:

See http://www.sagemath.org/doc/tutorial/sagetex.html for more information on sagetex. More examples are included with the sagetex package; see, for instance, the resulting document: http://tug.ctan.org/macros/latex/contrib/sagetex/example.pdf

### WZ algorithms for Sage

Following the description in the excellent book `A=B`

by Marko Petkovsek, Herbert S. Wilf and Doron Zeilberger, I have implemented Celine's method, Gosper's algorithm and Zeilberger's algorithm in Sage, so we can play with these and prove identities:

The code requires the ore_algebra package by Manuel Kauers, Maximilian Jaroschek, and Fredrik Johansson to be installed.

*(7/2020: wz.py was fixed to run with Sage 9 and ore_algebra 0.4; it may or may not run with previous versions.)*

## Recommended literature

- Herbert S. Wilf.
*Generatingfunctionology*. Academic Press, 1990. freely available online - Marko Petkovsek, Herbert S. Wilf and Doron Zeilberger.
*A=B*. A. K. Peters, Ltd., 1st edition, 1996. freely available online - George E. Andrews, Richard Askey, and Ranjan Roy.
*Special Functions*. Cambridge University Press, 1999. - Manuel Kauers and Peter Paule.
*The Concrete Tetrahedron*. Springer-Verlag, 2011.