[sage-devel] Hash error

Hey all, There is a hashing error likely with multivariate Laurent polynomial rings: sage: R. = LaurentPolynomialRing(ZZ) sage: elt = (a + b) * (~a + ~b) - a*~b - ~a*b - 1 sage: elt == R.one() True sage: hash(elt) == hash(R.one()) False This is now http://trac.sagemath.org/ticket/20490.

[sage-combinat-devel] Re: Defining basis keys for combinatorial free modules

Yes repeated entries are allowed. My example was rather misleading in that regard... Finite length words in a possible infinite set/alphabet is what I was looking for. So that word class you just mentioned looks perfect. Thank you very much. On Friday, April 22, 2016 at 10:08:05 PM UTC+10,

Re: [sage-devel] Re: problem/ possible bug with picewise constant functions

On Thu, Apr 21, 2016 at 11:50 PM, Ralf Stephan wrote: > Please review > http://trac.sagemath.org/ticket/14801 > I love this!! You and Volker have done such great work on this and I really am very much looking forward to this being put into Sage. Also, I don't see any examples

[sage-combinat-devel] Re: Defining basis keys for combinatorial free modules

Oh, so you are allowing repeated entries? sage: Words([1,2]) Words over {1, 2} sage: Words([1,2],length=2).list() [word: 11, word: 12, word: 21, word: 22] On Friday, 22 April 2016 07:30:05 UTC-4, Simon Wood wrote: > > Hi Mike and Travis, > > Thank you very much for your replies. > > Mike, your

[sage-combinat-devel] Re: Defining basis keys for combinatorial free modules

Hi Mike and Travis, Thank you very much for your replies. Mike, your code snippet is unfortunately not what I am looking for. Sorry for being unclear. I'd like to construct the set of tuples of all lengths, not just tuples of length up to a certain bound. Travis, the FreeMonoid looks very