Sara's profile - activity

Good afternoon, I have defined a recursive function and I would like to vizualise the 'calls' of the function trought a tree diagram. The nodes should be the elements of a group (Extended affine weyl group). So expressions of this type s0s1s2s4s5s6s0s0s7 (not hashable). Is there a easy way to do that ? Maybe using just matplotlib? So without instal graphviz. I need something simple like latex \tree. I have just tried something like this G = graphs.RandomGNM(4,5) G.relabel({0:'zero' , 1:'one', 2:'two', 3:'three'}) G.show(figsize=[4,4], graph_border=True) But the labels on the vertices are not readable. Really, I need something like a diagram not a graph.

I have used: from functools32 import lru_cache @lru_cache() and it works. However my functions takes elements that probably are not hashable. Indeed I get this error TypeError: <class 'sage.combinat.root_system.fundamental_group.fundamentalgroupofextendedaffineweylgroup_class_with_category.element_class'=""> is not hashable Why elements of a group are not hashable? Is there a way to use @lru_cache() for my function?

I am using the notebook of Sagemath 8.1. Is there a way to use the python command @lru_cache in the files with extension .ipynb ? Or in Python 2?(it is the version that is provided in the notebook.)

So, let E = ExtendedAffineWeylGroup(["A",2,1]) and L=E.lattice(). I would like to do the tensor product of L and the Rational number over Z.

Is possible to do the tensor product over ZZ of a lattice L and QQ ?