In sage, the following succeeds.
sage: Partition([2,0,1])
I would expect this not to succeed. Is this a bug or there is a reason
for this construction to work.
Rishi
--
You received this message because you are subscribed to the Google Groups
"sage-combinat-devel" group.
To post to this grou
In gmane.comp.mathematics.sage.combinat.devel, you wrote:
>
>> This is interesting; we should profile this. Can you give a precise
>> description of how you constructed the algebra, and a typical
>> calculation you wanted to run?
>>
>> Permutations are written in Cython, and should be rather fast.
> This is interesting; we should profile this. Can you give a precise
> description of how you constructed the algebra, and a typical
> calculation you wanted to run?
>
> Permutations are written in Cython, and should be rather fast. On the
> other hand, Weyl group elements could be slow (their ac
On Thu, Feb 16, 2012 at 07:41:52AM -0800, Anne Schilling wrote:
> But how do I do this? Implementing the analogue of the cores method (see
> combinat-queue)
> I get ...
> TypeError: __init__() got an unexpected keyword argument 'parent'
See my reviewer's patch. The __init__ method of LinearExtens
Hi,
With some sage/sage-combinat developers, we get hurt several time by the
problem of equality vs. coercion. Before discussing the problem I'd like to
gather use cases. I created a page on the wiki:
http://wiki.sagemath.org/EqualityCoercion
Please add more example when you hit one.
On 2/16/12 2:21 AM, Nicolas M. Thiery wrote:
> On Wed, Feb 15, 2012 at 02:47:04PM -0800, Anne Schilling wrote:
>> Perhaps I need
>>
>> __metaclass__ = ClasscallMetaclass
>>
>> @staticmethod
>> def __classcall_private__(cls, p, order = None):
>
> Yes, this sounds like it. You have:
>
>
> > We discussed this with Vincent over the phone: I pointed him to the
> > combinatorial_class_from_iterator decorator implemented in
> > class_from_iterator.patch; he volunteered to refactor it as
> > enumerated_set_from_iterator. Note that, as a decorator over an
> > existing function which prod
On Wed, Feb 15, 2012 at 02:47:04PM -0800, Anne Schilling wrote:
> Perhaps I need
>
> __metaclass__ = ClasscallMetaclass
>
> @staticmethod
> def __classcall_private__(cls, p, order = None):
Yes, this sounds like it. You have:
sage: type(p)
compared to:
sage
On Thu, Feb 16, 2012 at 10:01:48AM +, Vincent Delecroix wrote:
> Hi,
>
> Trying to apply the combinat queue on sage-5.0.beta2 I get
>
> applying trac_10963-more_functorial_constructions-nt.patch
> patching file sage/categories/commutative_additive_monoids.py
> Hunk #1 FAILED at 2
> 1 out of 2
On Thu, Feb 16, 2012 at 10:04:16AM +, Vincent Delecroix wrote:
> Trying to put my patch a little bit higher in the queue, I noticed the
> presence of the patch class_from_iterator.patch (which does not
> commute with mine as I basically deprecate what it did). There is no
> author, if there is
2012/2/16, Vincent Delecroix <20100.delecr...@gmail.com>:
> 2012/2/11, Nicolas M. Thiery :
>> On Sat, Feb 11, 2012 at 12:05:49PM +0100, Florent Hivert wrote:
>>> > Together with the language-team, we decided to implement a
>>> > LazyEnumeratedSet (see my patch in the queue) which takes as input an
Hi,
Trying to apply the combinat queue on sage-5.0.beta2 I get
applying trac_10963-more_functorial_constructions-nt.patch
patching file sage/categories/commutative_additive_monoids.py
Hunk #1 FAILED at 2
1 out of 2 hunks FAILED -- saving rejects to file
sage/categories/commutative_additive_monoid
2012/2/11, Nicolas M. Thiery :
> On Sat, Feb 11, 2012 at 12:05:49PM +0100, Florent Hivert wrote:
>> > Together with the language-team, we decided to implement a
>> > LazyEnumeratedSet (see my patch in the queue) which takes as input an
>> > iterable (finite or infinite) and mimic a set which contai
13 matches
Mail list logo
