Differences between revisions 1 and 4 (spanning 3 versions)
⇤ ← Revision 1 as of 2010-02-18 11:21:40 →
Size: 400
Editor: NicolasThiery
Comment:
← Revision 4 as of 2010-02-18 11:38:41 → ⇥
Size: 857
Editor: NicolasThiery
Comment:
Deletions are marked like this. Additions are marked like this.
Line 3: Line 3:
 * {{attachment:logo_UFR.png|Faculté d'Orsay|width=100}}
[[Graph representing the Cartan matrix of the monoid of upper unitriangular boolean 5x5 matrices]]
   I can't resist quoting Tom Denton: ``First they tell us we will never need more than 640k of RAM, then they tell us our documents should always be less than the length of a limousine...''		  * [[attachment:SageCategoryGraph.pdf|Graph of categories in Sage]]
   /* {{attachment:SageCategoryGraph.pdf|Graph of categories in Sage|width=200}} */
   Obtained with:
{{{
    sage: g = sage.categories.category.category_graph()
    sage: g.set_latex_options(format="dot2tex")
    sage: view(g, pdflatex=True, tightpage = True)
}}}

 * Graphs representing the Cartan matrix of the monoid of upper unitriangular boolean nxn matrices. For the second one, I can't resist quoting Tom Denton: "First they tell us we will never need more than 640k of RAM, then they tell us our documents should always be less than the length of a limousine..."
    * [[attachment:UpperTriangularBooleanMatrixMonoid4-cartan-graph.pdf|n=4]]
    * [[attachment:UpperTriangularBooleanMatrixMonoid5-cartan-graph.pdf|n=5]]

Cool pictures produced with Sage-Combinat

    sage: g = sage.categories.category.category_graph()
    sage: g.set_latex_options(format="dot2tex")
    sage: view(g, pdflatex=True, tightpage = True)
  • Graphs representing the Cartan matrix of the monoid of upper unitriangular boolean nxn matrices. For the second one, I can't resist quoting Tom Denton: "First they tell us we will never need more than 640k of RAM, then they tell us our documents should always be less than the length of a limousine..."

combinat/CoolPictures (last edited 2013-03-02 08:41:01 by nthiery)