2018-03-26 10:24:57 +0100 | received badge | ● Famous Question (source) |
2016-03-11 11:39:26 +0100 | received badge | ● Notable Question (source) |
2015-03-10 11:46:21 +0100 | received badge | ● Popular Question (source) |
2013-05-16 23:16:08 +0100 | received badge | ● Scholar (source) |
2013-05-16 23:16:08 +0100 | marked best answer | Exponent overflow in PolynomialRing(): need a work around See also http://trac.sagemath.org/sage_trac/ti.... You either use less variables so that there is enough space for the bit-packed exponents or you use the symbolic ring. Its not like you have memory for a dense polynomial of that degree anyways... |
2013-05-16 23:10:45 +0100 | commented answer | Exponent overflow in PolynomialRing(): need a work around Thanks. It looks like a fundamental limit arising from the implementation in singular. |
2013-05-16 23:06:36 +0100 | commented answer | Exponent overflow in PolynomialRing(): need a work around I need all of the variables. I am trying to make a resilient function to hash an input string. Each input symbol in the string becomes an input variable. |
2013-05-16 23:03:14 +0100 | commented answer | Exponent overflow in PolynomialRing(): need a work around Yes, I am using a 32 bit system. |
2013-05-16 22:52:15 +0100 | received badge | ● Supporter (source) |
2013-05-08 09:56:51 +0100 | received badge | ● Editor (source) |
2013-05-08 09:53:01 +0100 | asked a question | Exponent overflow in PolynomialRing(): need a work around PolynomialRing() gives an OverflowError for exponents larger than 32768. For example I need to make a function containing I am using Sage Version 5.3, Release Date: 2012-09-08. |