Differences between revisions 1 and 2
Revision 1 as of 2008-02-06 11:04:22
Size: 230
Editor: was
Comment:
Revision 2 as of 2008-02-08 20:22:56
Size: 1211
Comment:
Deletions are marked like this. Additions are marked like this.
Line 1: Line 1:
= Sage testing system (parallel testings, '''REGRESSION TESTING''', removing extra "sage.:", etc) = = How close is sage to ready for teaching undergrad/grad combinatorial courses =
Line 3: Line 3:
'Remark': I already went through and completely eliminated the "sage.:" stuff from Sage... or so I thought. (William Stein) Textbooks:

Brualdi - Introductory Combinatorics

Wilf - Zeilberger Generating functionalogy

Stanley - Enumerative Combinatorics

CAGES Combinatorial
http://www.math.mtu.edu/~kreher/cages.html

Knuth Graham Pataschnik - Concrete mathematics

van Lint, Wilson: A course in Combinatorics
http://www.amazon.com/Course-Combinatorics-J-van-Lint/dp/0521422604


Graphs:
 - Complete, except maybe chromatic number and Hamiltonian paths?
   interface with graphviz?

Trees:
 - spanning trees / ... are there
   maybe they should return a Graph
 - no specific data structure for trees (orderered, ...)
   Parts could be taken from MuPAD-Combinat
 
 - basic decomposable objects / species

Posets:
 - TODO: (integrate Stembridge + MuPAD-Combinat)

Linear programming:
 - Should be there ...
 - Networks?

Coding theory:
 - Link with Guava in GAP: sage.coding.guava

Automata
 - There exist specialized things in pyrex

Classical combinatorial objects
 - Should be complete enough: partitions / ...

Generating functions
 - guess / ... (TODO: port Martin Rubey's implementation in Axiom)

How close is sage to ready for teaching undergrad/grad combinatorial courses

Textbooks:

Brualdi - Introductory Combinatorics

Wilf - Zeilberger Generating functionalogy

Stanley - Enumerative Combinatorics

CAGES Combinatorial http://www.math.mtu.edu/~kreher/cages.html

Knuth Graham Pataschnik - Concrete mathematics

van Lint, Wilson: A course in Combinatorics http://www.amazon.com/Course-Combinatorics-J-van-Lint/dp/0521422604

Graphs:

  • - Complete, except maybe chromatic number and Hamiltonian paths?
    • interface with graphviz?

Trees:

  • - spanning trees / ... are there
    • maybe they should return a Graph
    - no specific data structure for trees (orderered, ...)
    • Parts could be taken from MuPAD-Combinat
    - basic decomposable objects / species

Posets:

  • - TODO: (integrate Stembridge + MuPAD-Combinat)

Linear programming:

  • - Should be there ... - Networks?

Coding theory:

  • - Link with Guava in GAP: sage.coding.guava

Automata

  • - There exist specialized things in pyrex

Classical combinatorial objects

  • - Should be complete enough: partitions / ...

Generating functions

  • - guess / ... (TODO: port Martin Rubey's implementation in Axiom)

days7/sprints/teaching (last edited 2008-11-14 13:42:03 by localhost)