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 temporary effect.

Btw: I'd like to thank Jeroen for his hard work on an alternative
polytope based implementation (#17920). Even with the hopefully
upcoming IntegerListLex, every bit of his work will be useful:

- Iteration over polytopes which is a generally useful feature
- Lots of documentation and tests that we will recycle
- An alternative implementation to run comparative tests
- The connection with polytopes, which will be useful for other
  operations (counting, and maybe others)

Cheers,
                                     Nicolas


On Wed, Mar 18, 2015 at 02:28:36PM +0100, Viviane Pons wrote:
>    2015-03-18 12:40 GMT+01:00 Mike Zabrocki <[1]mike.zabro...@gmail.com>:
> 
>    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 indicate a relation to
>    dominance order will be a lot less clear if the order is not something
>    natural.  I wouldn't want the interface to be too complicated, but the
>    more I think about it the more I realize that my personal use of
>    partitions is very dependent on this order.
> 
>    I would tend to agree with you. The order wasn't documented but I'm
>    pretty sure many people writing some personal code using partitions
>    still rely on the order somehow. I feel a good choice would be to give
>    the "nice" order by default and some parameter to obtain the optimized
>    one.
> 
>    On Wednesday, 18 March 2015 04:20:15 UTC-4, Samuel Lelievre wrote:
> 
>    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 free in terms of
>      computational time.
>      The current implementation returns them in lex order, but returns
>      *many* wrong answers too (see #17548).
>      In order to fix that, Jeroen is re-implementing this feature through
>      a
>      routine that enumerates the integer points of a polytope (see
>      #17920),
>      probably without any control over the order in which they are
>      returned.
>      Thus, in order for Partition/Composition to return them in a
>      specific
>      order we must list them *all* before returning the first of them.
>      This
>      can really mean hours (or no results at all) instead of seconds on
>      big
>      instances.
> 
>    So would it make sense to have an optional parameter sorted=None,
>    which one could set to 'lex' or 'revlex' to get them in a desired
>    order.
>    The documentation could warn about the issues you just raised.
> 
>    --
>    You received this message because you are subscribed to the Google
>    Groups "sage-combinat-devel" group.
>    To unsubscribe from this group and stop receiving emails from it, send
>    an email to [2]sage-combinat-devel+unsubscr...@googlegroups.com.
>    To post to this group, send email to
>    [3]sage-combinat-de...@googlegroups.com.
>    Visit this group at
>    [4]http://groups.google.com/group/sage-combinat-devel.
>    For more options, visit [5]https://groups.google.com/d/optout.
> 
>    --
>    You received this message because you are subscribed to the Google
>    Groups "sage-combinat-devel" group.
>    To unsubscribe from this group and stop receiving emails from it, send
>    an email to [6]sage-combinat-devel+unsubscr...@googlegroups.com.
>    To post to this group, send email to
>    [7]sage-combinat-de...@googlegroups.com.
>    Visit this group at
>    [8]http://groups.google.com/group/sage-combinat-devel.
>    For more options, visit [9]https://groups.google.com/d/optout.
> 
> Références
> 
>    1. mailto:mike.zabro...@gmail.com
>    2. mailto:sage-combinat-devel+unsubscr...@googlegroups.com
>    3. mailto:sage-combinat-de...@googlegroups.com
>    4. http://groups.google.com/group/sage-combinat-devel
>    5. https://groups.google.com/d/optout
>    6. mailto:sage-combinat-devel+unsubscr...@googlegroups.com
>    7. mailto:sage-combinat-de...@googlegroups.com
>    8. http://groups.google.com/group/sage-combinat-devel
>    9. https://groups.google.com/d/optout
                                Nicolas
--
Nicolas M. Thiéry "Isil" <nthi...@users.sf.net>
http://Nicolas.Thiery.name/

-- 
You received this message because you are subscribed to the Google Groups 
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to sage-devel+unsubscr...@googlegroups.com.
To post to this group, send email to sage-devel@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel.
For more options, visit https://groups.google.com/d/optout.

Reply via email to