ASKSAGE: Sage Q&A Forum - RSS feedhttps://ask.sagemath.org/questions/Q&A Forum for SageenCopyright Sage, 2010. Some rights reserved under creative commons license.Wed, 24 Oct 2018 19:38:41 +0200Change degree in InfinitePolynomialRinghttps://ask.sagemath.org/question/44059/change-degree-in-infinitepolynomialring/If I use
<pre><code> P.<x,y,z> = InfinitePolynomialRing(QQ)</code></pre>
Assuming any of the orderings 'lex, deglex, degrevlex' I will have
$z_0 < z_1 < z_2 < ... < y_0 < y_1 < ... < x_0 < x_1 < ...$
And each variable having degree 1. I would like to obtain something like 'deglex' but assigning degree $n$ to $x_n,y_n,z_n$ so that in particular I would obtain
$z_0 < y_0 < x_0 < z_1 < y_1 < x_1 < ... $
Is there a way to implement this. It seems that in order to compute Grobner bases on arc schemes these orderings are much more natural that the ones implemented, but I just started looking at Sage so I may have missed the right implementation of polynomial rings in infinitely many variables to work. heluaniWed, 24 Oct 2018 19:38:41 +0200https://ask.sagemath.org/question/44059/