Dear William, dear Franco
On Sun, Mar 29, 2009 at 04:25:39PM +0200, Nicolas Thiéry wrote:
> ...
> I'll be interested in looking at the quickref when a draft will be
> ready, to check if what you perceived as the right way to do things
> from our documentation is what we had in mind (otherwise, this will
> point out how to improve the doc!)
Jason just pointed out that it was already available (I am late on
reading sage-devel). So, here are some suggestions for improvements.
Graph section:
G = Graph(0:[1,2,3], 2:[4])
Should be:
G = Graph({0:[1,2,3], 2:[4]})
Combinatorics section:
Integer sequences: sloane_find(list), sloane.<tab>
Combinatorial objects:
P = Partitions(10) P.count() P.<tab>
C = Combinations([1,3,7]) C.list()
for (p, c) in CartesianProduct(P, C): ...
W=Words(’abc’) W(’aabca’)
Posets: Poset([[1,2],[4],[3],[4],[]])
Polytopes: L =LatticePolytope(random_matrix(ZZ, 3,6, x=7))
L.npoints() L.plot3d()
Root systems: RootSystem([’A’,3])
CrystalOfTableaux(["A",3], shape = [3,2])
Later on, we will add symmetric functions, weyl groups (probably in
the groups section), ...
Franco:
- For Words: what about putting W('aabca').bar(), where bar would be
some snappy method of the word library?
- For Posets: what about:
Poset({1: [2,3], 2: [4], 3: [4]}).some_snappy_feature()
The input seems easier to interpret to me, and is consistent with
Graph above. Should this actually be in the Poset section?
Comments welcome!
Cheers,
Nicolas
--
Nicolas M. Thiéry "Isil" <nthi...@users.sf.net>
http://Nicolas.Thiery.name/
--~--~---------~--~----~------------~-------~--~----~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to
sage-devel-unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URLs: http://www.sagemath.org
-~----------~----~----~----~------~----~------~--~---
