2018-03-26 03:24:57 -0500 | received badge | ● Famous Question (source) |

2016-03-11 04:39:26 -0500 | received badge | ● Notable Question (source) |

2015-03-10 05:46:21 -0500 | received badge | ● Popular Question (source) |

2013-05-16 16:16:08 -0500 | 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 16:16:08 -0500 | received badge | ● Scholar (source) |

2013-05-16 16:10:45 -0500 | 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 16:06:36 -0500 | 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 16:03:14 -0500 | commented answer | Exponent overflow in PolynomialRing(): need a work around Yes, I am using a 32 bit system. |

2013-05-16 15:52:15 -0500 | received badge | ● Supporter (source) |

2013-05-08 02:56:51 -0500 | received badge | ● Editor (source) |

2013-05-08 02:53:01 -0500 | 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. |

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.