1 | initial version |

You don't even have to decide on $n$ at all; just take an infinite polynomial ring.

By Infinite Polynomial Rings, we mean polynomial rings in a countably infinite number of variables. The implementation consists of a wrapper around the current finite polynomial rings in Sage.

2 | No.2 Revision |

You don't even have to decide on $n$ at all; just take an infinite polynomial ring.

By Infinite Polynomial Rings, we mean polynomial rings in a countably infinite number of variables. The implementation consists of a wrapper around the current finite polynomial rings in Sage.

Call polynomial_ring() to get the underlying finite polynomial ring.

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.