You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
sage: B = matrix([[0,1,2],[-1,0,3],[-2,-3,0]])
sage: q = ZZ['q'].gen()
sage: R.<x,y,z> = algebras.qCommutingPolynomials(q, B)
sage: R.formal_series_ring()
Lazy completion of q-commuting polynomial ring in x, y, z over Univariate Polynomial Ring in q over Integer Ring with matrix:
[ 0 1 2]
[-1 0 3]
[-2 -3 0]
?
The text was updated successfully, but these errors were encountered:
This structure is indeed very similar to the quantum torus implemented in TMPolynomialRing, but most of the methods will have to be rewritten, so I am not sure about any advantage of using it.
There may be an advantage in terms of speed and code concision. There is also an interest in leaving to sagemath developers the burden to maintain the code in a working state. This also applies for instance to your poset code, that may be integrated inside sage without too much effort.
One could maybe make good use of
?
The text was updated successfully, but these errors were encountered: