Hi!
Thanks everyone for your input. We are banging hard on IntegerListLex
at Sage Days 64, and hopefully will get a correct and as fast as
previously implementation in the coming days. Don't hold your breath,
but the point is that it's likely that the "non lex is faster" is only
a temporar
Hi,
please don't make a distinction based on the n being less than 15! That
would make a really bad pitfall.
Best regards,
Darij
On Wed, Mar 18, 2015 at 6:28 AM, Viviane Pons wrote:
>
>
> 2015-03-18 12:40 GMT+01:00 Mike Zabrocki :
>
>> That would make sense. My preference is that (at leas
2015-03-18 12:40 GMT+01:00 Mike Zabrocki :
> That would make sense. My preference is that (at least for values less
> than 15) the default is that the output is sorted and this can be
> controlled by the optional parameter.
>
> I think about how many times that I test symmetric function identitie
That would make sense. My preference is that (at least for values less
than 15) the default is that the output is sorted and this can be
controlled by the optional parameter.
I think about how many times that I test symmetric function identities on
partitions and realize that patterns that ind
Nathann Cohen wrote:
>
> Hello,
>
> > I think that Partitions should be output in either lex (or possibly
> reverse
> > lex) since this order is compatible with dominance order.
>
> I only want to bring to your attention that deciding in which order
> the partitions should be returned is not f
