#5453: [with patch, needs review] Create a ring for working with polynomials in
countably infinitely many variables
---------------------------------+------------------------------------------
Reporter: mhansen | Owner: mhansen
Type: enhancement | Status: assigned
Priority: major | Milestone: sage-3.4.2
Component: commutative algebra | Keywords:
---------------------------------+------------------------------------------
Comment(by SimonKing):
Meanwhile i can provide a uniform interface for the dense and the sparse
approach. In both approaches, one can compute symmetric Gröbner bases.
And: Dense seems indeed to be faster.
Since i am owner for #5566, i've put my patch there. Hope you are not
upset.
The name of the rings is now InfinitePolynomialRing, and they can be
created in dense or sparse implementation.
Due to differences in the interface of uni- and multivariate polynomials,
a bug occured in the reduce method; i need to fix this, thus #5566
currently is 'needs work'. But perhaps you can already have a look if the
implementation makes sense.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5453#comment:30>
Sage <http://sagemath.org/>
Sage - Open Source Mathematical Software: Building the Car Instead of
Reinventing the Wheel
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en
-~----------~----~----~----~------~----~------~--~---
