### [sage-combinat-devel] Re: (free) algebras

Hi Anne, I just joined sage-combinat-devel, so, this time, I can answer directly. On 24 Mrz., 09:39, Anne Schilling a...@math.ucdavis.edu wrote: Looking at the link, it seems this is working with monomials in commutative variables. But this would still apply for monoids/ algebras where the

### [sage-combinat-devel] Re: (free) algebras

Hi Nicolas, On 26 Mrz., 08:03, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: What's the category for F? It would be great if it was in AlgebrasWithBasis, and in particular if CombinatorialFreeModule and FreeAlgebra would be consistent with each other (in particular for the accessors on

### [sage-combinat-devel] Re: (free) algebras

Hi Nicolas, On 26 Mrz., 11:00, Simon King simon.k...@uni-jena.de wrote: Sorry, I first saw your post on sage-algebra and answered there, although it might have been better to do it on combinat-devel. Anyway, I am very unhappy with the documentation of the ...WithBasis stuff. After several

### [sage-combinat-devel] Re: (free) algebras

Hi Anne, hi Nicolas, On 26 Mrz., 15:30, Anne Schilling a...@math.ucdavis.edu wrote: Could you then rebase trac7797 so that it is easier to use it in the sage-combinat queue? I added it there, but it is currently disabled. Ok, as soon as I get Simon's green light. Sounds good! Simon, can

### [sage-combinat-devel] Re: (free) algebras

Hi Anne, On 27 Mrz., 00:39, Anne Schilling a...@math.ucdavis.edu wrote: Hi Simon, I am not sure this is the smallest example, but I get some error messages when playing with the quotients: sage: n=3 sage: F = FreeAlgebra(ZZ,n,'x',implementation='letterplace') That's the other restriction

### [sage-combinat-devel] Re: (free) algebras

On 27 Mrz., 08:11, Simon King simon.k...@uni-jena.de wrote: I guess, what I should do is to test at the beginning of the groebner_basis method whether we have a field, and give a clear error message. Also I should mention that restriction in the doc string of the groebner_basis method. Udate

### [sage-combinat-devel] Categorification of sage/rings/ring.pyx

Hi all! working on #11068, I tried to move the methods responsible for creating ideals and quotient rings from sage/rings/ring.pyx to sage/ categories/rings.py. However, it did not work, because rings are not using categories properly. I think I could manage to make them use categories. Or at

### [sage-combinat-devel] Re: Categorification of sage/rings/ring.pyx

Hi Nicolas, On 29 Mrz., 11:00, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: I am happy with the recycling of this ticket. Especially since we also have #9944: categories for polynomial rings. I guess that could be fixed as well. Currently I have sage: QQ['x'].category() Category of

### [sage-combinat-devel] Re: Categorification of sage/rings/ring.pyx

Hi Nicolas, On 29 Mrz., 11:19, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: All good, as long as it plays smoothly with the patches posted on #9944! Hm. I guess that it is better to post on #9944 rather than on #9138, then. Cheers, Simon -- You received this message because you are

### [sage-combinat-devel] Puzzled about ParentMethods.__init_extra__

Hi! Under what conditions is the parent method __init_extra__ executed? With #9944 and #9138, sage: R.x,y = QQ['t'][] seems to properly initialise its category. One has sage: isinstance(R,Algebras(QQ['t']).parent_class) True However, not a single __init_extra__ is executed, although it

### [sage-combinat-devel] Re: Puzzled about ParentMethods.__init_extra__

On 30 Mrz., 11:21, Simon King simon.k...@uni-jena.de wrote: Hi! Under what conditions is the parent method __init_extra__ executed? Solution: In the example in question, sage.structure.parent.Parent.__init__ was not called. There, __init_extra__ would be dealt with. -- You received

### [sage-combinat-devel] Re: Categorification of sage/rings/ring.pyx

Hi Anne, On 31 Mrz., 14:09, Anne Schilling a...@math.ucdavis.edu wrote: Hi Simon, Applying your two patches trac11068_nc_ideals_and_quotients.patch trac7797-full_letterplace_wrapper_rel11068.patch in this order, I get the attached error for sage -b. Am I missing a patch? Do you also have

### [sage-combinat-devel] Re: Categorification of sage/rings/ring.pyx

Hi Anne On 31 Mrz., 14:09, Anne Schilling a...@math.ucdavis.edu wrote: /Applications/sage-4.6.2/devel/sage-combinat/sage/algebras/letterplace/free_algebra_letterplace.pxd:15:72: Name 'FreeAlgebraElement_letterplace' not declared in module

### [sage-combinat-devel] Question on a doctest

Hi! Working on some patch, I get the following doctest errors in combinat/ sf/dual.py File /mnt/local/king/SAGE/broken/devel/sage-main/sage/combinat/sf/ dual.py, line 185: sage: l(f._to_self_cache) # note: this may depend on possible previous computations! Expected: [([1, 1], [([1, 1],

### [sage-combinat-devel] Re: Question on a doctest

On 1 Apr., 08:43, Simon King simon.k...@uni-jena.de wrote: ... It states that this may depend on possible previous computations. Is there really no work around? Such as, using an object that is not considered in any other doc test? Is the new result correct? Shouldn't both tests better

### [sage-combinat-devel] Re: Question on a doctest

On 2 Apr., 08:39, Simon King simon.k...@uni-jena.de wrote: On 1 Apr., 08:43, Simon King simon.k...@uni-jena.de wrote: ... It states that this may depend on possible previous computations. Is there really no work around? Such as, using an object that is not considered in any other doc

### [sage-combinat-devel] Re: Question on a doctest

Hi Nicolas, On 2 Apr., 18:31, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: Well, I guess the right thing to do would be to change the doctest to not show the full cache of this function, but only those pieces that should be there at this point. Do you feel comfortable doing it, or would

### [sage-combinat-devel] Re: Categorification of sage/rings/ring.pyx

Hi Anne, On 2 Apr., 08:50, Anne Schilling a...@math.ucdavis.edu wrote: ... I think this makes sense; when the elements in the quotient are printed, there is also a choice which representative is printed. So going through the iterator, one would just expect to give one of the representatives.

### [sage-combinat-devel] Re: Categorification of sage/rings/ring.pyx

Hi Anne, On 4 Apr., 06:42, Anne Schilling a...@math.ucdavis.edu wrote: Ok. Will you open it? Or do you want me to do so? I'd prefer if you do. Cheers, Simon -- You received this message because you are subscribed to the Google Groups sage-combinat-devel group. To post to this group, send

### [sage-combinat-devel] Re: Categorification of sage/rings/ring.pyx

Hi Anne, On 18 Apr., 04:49, Anne Schilling a...@math.ucdavis.edu wrote: Hi Simon, Using your letterplace code, I get the following error: Singular error: no more memory System 65340600k:65340600k Appl 1084175k/64215466k Malloc 18133k/0k Valloc 65281508k/64215466k Pages 16320377/0 Regions

### [sage-combinat-devel] Re: Categorification of sage/rings/ring.pyx

Hi Nicolas, On 18 Apr., 12:04, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: Out of curiosity: does Singular have any builtin memory limit, or is it just using as much memory as is available on the system, as the above seems to suggest? Sorry, I have no idea if you need ulimit to prevent

### [sage-combinat-devel] Re: Categorification of sage/rings/ring.pyx

PS: On 18 Apr., 12:04, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: Out of curiosity: does Singular have any builtin memory limit, or is it just using as much memory as is available on the system, as the above seems to suggest? We are using libSingular in this example, not a Singular

### [sage-combinat-devel] Code duplication versus speed

Hi! Due to #9944, #9138 and #5, it will hopefully soon be possible to move many methods from sage.rings.ring.Ring to sage.categories.rings.Rings.ParentMethods, including cached methods. The benefit of moving the code is that a MatrixSpace, which sometimes is a ring and sometimes isn't, could

### [sage-combinat-devel] Bug in Subquotients

Hi! I just noticed that the category framework claims that any (sub)quotient of a euclidean domain is a euclidean domain. sage: EuclideanDomains().Subquotients() Join of Category of euclidean domains and Category of subquotients of monoids That's of course not true (ZZ/16 is not even an

### [sage-combinat-devel] Re: Bug in Subquotients

On 22 Apr., 00:02, Simon King simon.k...@uni-jena.de wrote: sage: EuclideanDomains().Subquotients() Join of Category of euclidean domains and Category of subquotients of monoids That's of course not true (ZZ/16 is not even an integral domain). Nicolas pointed out (on #9138

### [sage-combinat-devel] Re: Documentation tips...

Hi Nicolas, On 23 Apr., 15:39, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: It would be great if sage -docbuild would complain about them. It does complain. The warning usually mentions a missing indentation, or mentions a missing end of a quotation block and so on. But often the warning

### [sage-combinat-devel] Categorical Question on sage-support

Hi! As much as I know, some people here do not usually read sage-support. So, let me draw to your attention some questions on categories / monoid algebras: http://groups.google.com/group/sage-support/browse_thread/thread/3f3580e4c4fb0123 Best regrards, Simon -- You received this message

### [sage-combinat-devel] Re: abstract_method(optional=True)

Hi! What's the problem with raising a NotImplementedError for a method that is not implemented? Why should one want that these methods are deactivated? What shall deactivated actually mean? That they don't appear in introspection? -- You received this message because you are subscribed to the

### [sage-combinat-devel] Re: abstract_method(optional=True)

On 13 Mai, 13:22, Christian Stump christian.st...@lacim.ca wrote: I feel like the tab completion is often so long, that it is quite hard to find some method. So why not removing all methods from this list which I cannot use anyway? I think it is also annoying to find and try to use some method

### [sage-combinat-devel] getattr of elements

Hi! It seems to me that one could save a lot of time by investing some work on getting attributes of parents and elements. In particular, if an attribute can *not* be found, raising an attribute error should be faster resp. earlier. The faster part can be solved by improving

### [sage-combinat-devel] Re: getattr of elements

On 16 Mai, 19:14, Simon King simon.k...@uni-jena.de wrote: Similarly, if an attribute is requested from an element, then the attribute may be looked up in the element class of self.parent().category() --- but it is *not* requested that the category is initialized. Should it be requested

### [sage-combinat-devel] Re: getattr of elements

On 16 Mai, 21:27, Simon King simon.k...@uni-jena.de wrote: So, aparently the only question is what we intend to do in the case of a non-initialised parent. I plan to open a ticket tomorrow morning, but perhaps you can already state your opinion on that question. The ticket is #11342

### [sage-combinat-devel] Re: caching a generator?

Hi Dan, On 26 Mai, 02:14, Dan Drake dr...@kaist.edu wrote: If I use @disk_cached_function, won't it just cache the *generator* produced by squares_less_than(10), and not anything like [0, 1, 4, 9]? Indeed: sage: @cached_function : def squares_less_than(n): : for i in

### [sage-combinat-devel] Re: caching a generator?

A question to Python experts: A generator function somehow stores the internal state (i.e., a pointer to the current line of code and the value of local variables. I know how to obtain the *names* of local variables, such as here: sage: def t(n): : for i in range(n): : yield

### [sage-combinat-devel] Re: finitely-presented algebras?

Hi All! On 1 Sep., 18:15, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: ... However, Simon King is implementing an interface with the letterplace library from Singular which should, among other things, allow for implementing in Sage an algebra by generators and relations: Caveat: That's

### [sage-combinat-devel] Re: Is it really needed to make the parent class of a category depend on its base ring?

Hi! dynamic_class calls the cached function dynamic_class_internal. The reduction data is currently part of the cache key. That's probably too inflexible: Different reduction data may easily return the same result, and thus the reduction data should not be part of the cache key. And I wonder: Is

### [sage-combinat-devel] Re: Is it really needed to make the parent class of a category depend on its base ring?

I really don't see the problem. On 7 Okt., 22:21, Simon King simon.k...@uni-jena.de wrote: So, why shouldn't parent_class rely on the generic pickling of a dynamic class? Well, I guess I should simply try and look how it blows up... I simply dropped the reduction data from the definition

### [sage-combinat-devel] Re: Is it really needed to make the parent class of a category depend on its base ring?

Hi Nicolas, Sorry, I have seen your post only now. On 7 Okt., 23:06, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: It would not be quite surprising if the pickling of classes made some progress since 2009 :-) However, just to make sure: please save the pickle to a file, and reload it in a

Hi Nicolas, On 8 Okt., 17:40, Simon King simon.k...@uni-jena.de wrote: I know a trick that combines the old way of pickling with the desired independence from the base ring: 1. The lazy attribute C.parent_class could start with constructing a dynamic class without specifying the reduction

Hi all! Is there already a ticket for the problem discussed here (Make parent_class and element_class independent of the base ring, whenever possible)? Is there a ticket for a related topic that is marked FixMe in sage/ categories/category.py: Use Python's method resolution order in

Hi Nicolas, On 10 Okt., 15:53, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: Speaking of the latter, +1 on using directly Python's implementation if at all possible. Probably it isn't. The only thing that people on sage-devel pointed me to was a function implemented in C that assumes to

Hi Nicolas, On 11 Okt., 12:25, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: Ok. This can be a good occasion to detect early on when there is a conflict in the category inheritance diagram, and try to raise a more meaningful message than MRO conflict. Yep! That's one of the positive side

Hi all! Make parent/element classes independent of the base ring (unless absolutely necessary) is #11935, needing review. There are two patches, providing two different implementations. So, pick one, if you like. There is no ticket for Make all_super_categories consistent with parent_class.mro()

Hi folks, On 10 Okt., 15:53, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: On Mon, Oct 10, 2011 at 05:36:29AM -0700, Simon King wrote: Is there a ticket for a related topic that is marked FixMe in sage/ categories/category.py: Use Python's method resolution order

### [sage-combinat-devel] Re: error with skew Schur functions

Hi Nicolas, On 10 Dez., 09:25, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: if x[0]==[] and x[1]==[]: # Workaround empty skew partition bug in Symmetrica (see #12140) x = [[1],[1]] skewschur = symmetrica.part_part_skewschur(x[0], x[1]) Why is this

### [sage-combinat-devel] Re: Sage-Combinat meeting in Cernay

I have an appointment on 10/2. Apart from that day, I have no plans yet. Cheers, Simon -- You received this message because you are subscribed to the Google Groups sage-combinat-devel group. To post to this group, send email to sage-combinat-devel@googlegroups.com. To unsubscribe from this

### [sage-combinat-devel] Please finish the review of #11900!

Hi! The current experimental pre-release sage-5.0.prealpha0 contains: * #9138 (use the category framework for all rings) * #5 (very fast cached methods written in Cython) * #11068 (one- and two-sided ideals in non-commutative rings) * #4539 (a wrapper for the non-commutative stuff of

### [sage-combinat-devel] Re: Please finish the review of #11900!

Hi Nicolas! On 9 Jan., 17:20, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: Done :-) Thank you very much! Cheers, Simon -- You received this message because you are subscribed to the Google Groups sage-combinat-devel group. To post to this group, send email to

### [sage-combinat-devel] Coercion error in symmetric functions

Hi! Working on fixing some memory leaks by using weak references (here: #12215), together with making matrix spaces unique parents (at #12290) my patches trigger a problem with the method sage.combinat.sf.sf.SymmetricFunctions.register_isomorphism. self.register_isomorphism(morphism) does

### [sage-combinat-devel] Re: Coercion error in symmetric functions

It turns out that sage/combinat/... uses the implicit assumption that SymmetricFunctions(...) is a strongly cached object, i.e., that it will persist in memory forever. But #12215 turns `UniqueRepresentation` into a weak cache. I don't know if it is a good solution on the long run, but for now, I

### [sage-combinat-devel] Re: Coercion error in symmetric functions

Hi Nicolas, On 13 Jan., 10:12, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: On Thu, Jan 12, 2012 at 07:24:53AM -0800, Simon King wrote: It turns out that sage/combinat/... uses the implicit assumption that SymmetricFunctions(...) is a strongly cached object, i.e., that it will persist

### [sage-combinat-devel] Re: AttributeError when ploting a poset

Hi y'all! On 25 Jan., 01:08, slabbe sla...@gmail.com wrote: I get an attribute error when ploting a poset. I already created a ticket for it : http://trac.sagemath.org/sage_trac/ticket/12351 Patch's up and ready for review! Cheers, Simon -- You received this message because you are

### [sage-combinat-devel] Re: AttributeError when ploting a poset

Hi Nicolas, On 26 Jan., 13:35, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: On Thu, Jan 26, 2012 at 01:33:31PM +0100, Nicolas M. Thiery wrote: Has anyone tried first whether #10998 does not fix it already? Well, actually I just tried the example with the Sage-Combinat queue installed

### [sage-combinat-devel] Re: AttributeError when ploting a poset

Hi Nicolas, On 27 Jan., 15:01, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: With the Sage-Combinat queue installed, I get: sage: P = Poset([[1,2],[4],[3],[4],[]]) sage: P(0) == int(0) False OK, that probably means that the original bug (namely __eq__ assuming that both

### [sage-combinat-devel] Re: AttributeError when ploting a poset

Hi Nicolas, On 28 Jan., 08:53, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: Note: a pretty similar test is included in the TestSuite (see _test_eq). You mean the self!=None test? Right, that's the same, and it would fail in unpatched Sage. Do you think both are useful? Not sure... If

### [sage-combinat-devel] sage.combinat.sf.sf into the reference manual?

Hi! Is there a reason why sage.combinat.sf.sf is not part of the reference manual (as of sage-5.0.prealpha0)? Is there a ticket to include it? If not, shall I open such ticket? Cheers, Simon -- You received this message because you are subscribed to the Google Groups sage-combinat-devel

### [sage-combinat-devel] Re: sage.combinat.sf.sf into the reference manual?

And while I am at it: In sage/structure/dynamic_class.py and sage/combinat/sf/sf.py, it is attempted to use a Sphynx directive: ..topic: Why dynamic classes? However, that line appears in the doc exactly in that form (i.e., ..topic: is printed). In fact there seems to be a misspelling in the

### [sage-combinat-devel] Re: sage.combinat.sf.sf into the reference manual?

Hi Nicolas, On 9 Mrz., 15:12, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: The intention was to use .. rubric:: instead. That looks much better! Still: Is there a list of available markups? You are welcome to fix those, and also to add the missing link (gasp!) to sf/sf.py in the

### [sage-combinat-devel] Re: sage.combinat.sf.sf into the reference manual?

Hi Florent, On 10 Mrz., 10:07, Florent Hivert florent.hiv...@lri.fr wrote: Standard ReST markup: http://docutils.sourceforge.net/docs/ref/rst/directives.html Sphinx specific markup: http://sphinx.pocoo.org/markup/index.html Thank you! Simon -- You received this message because you are

### [sage-combinat-devel] Question on algebras with inverses

Hi! At http://ask.sagemath.org/question/1248/non-commutative-ring-with-inverses a user called Noud asks how one can construct a free associative unital algebra WITH inverses. In other words, the group algebra of a free group. He asked the same question on sage-support a while ago, but didn't get

### [sage-combinat-devel] Re: bug in LaurentPolynomialRing ?

Hi all! On 2012-03-28, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: On Wed, Mar 28, 2012 at 10:04:44AM -0700, Mark Shimozono wrote: The fraction field of a Laurent polynomial ring S can't tell if one of its elements is in S. I recall that about two years ago I had opened a ticket on

### [sage-combinat-devel] Re: bug in LaurentPolynomialRing ?

Hi! If someone is interested: I rebased my patch from #8972 relative to sage-5.0.beta10. It fixes various bugs, tends to improve timings, and needs review (and still needs the test suite to be run...). Cheers, Simon -- You received this message because you are subscribed to the Google Groups

### [sage-combinat-devel] Re: subclassing polynomial rings

Hi! On 2012-03-29, msh...@math.vt.edu msh...@math.vt.edu wrote: More seriously for me at the moment, there is type enforcement going on somewhere. If __init__ is called with a custom class, failure occurs because the actual class instance is not received. I am puzzled. How do you attempt to

### [sage-combinat-devel] Re: algebra functor

Hi Mark, On 2012-04-20, Mark Shimozono msh...@math.vt.edu wrote: You had mentioned the functor that, when applied to a group, creates the group algebra. I know about the algebra method for sets. Can one also get induced algebra morphisms this way too, as the name functor suggests should be

### [sage-combinat-devel] Do we want a metaclass framework?

Hi! Metaclasses are used in Sage in various ways, but so far there is no framework for it. By consequence, it is not straight forward to combine the features provided by different metaclasses. I have a proof of concept to improve the situation, and the question is whether I should post it on

### [sage-combinat-devel] Re: Do we want a metaclass framework?

Hi Nicolas, On 2012-04-21, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: At the same time, it's getting far enough from the KISS principle to get me uncomfortable. Isn't the use of meta-meta classes overkill (and thus potentially fragile, if we are not sure of a Python/Cython rock solid

### [sage-combinat-devel] Re: Do we want a metaclass framework?

Hi Nicolas, On 22 Apr., 00:37, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: So the question is how many metaclasses we forsee in the future. Some ideas are below. NestedClassMetaclass is really a workaround for a mishandling of nested classes by Python; Abstractly: What

### [sage-combinat-devel] Re: Do we want a metaclass framework?

PS: On 23 Apr., 14:48, Simon King simon.k...@uni-jena.de wrote: class MyClass(Parent): __metaclass__ = CustomisationMetaclass(call,init,add) ... @staticmethod def __classadd__(cls, other): if cls is other: return cls return type(cls)(cls.__name__

### [sage-combinat-devel] Re: Do we want a metaclass framework?

Hi Nicolas! On 2012-04-24, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: On Mon, Apr 23, 2012 at 05:59:04AM -0700, Simon King wrote: Hence, class MyClass(Parent): __metaclass__ = CustomisationMetaclass @staticmethod def __classadd__(... should suffice. I like

### [sage-combinat-devel] Re: Coercion bug in symmetric functions

Hi Nicolas, On 2012-05-18, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: Ok. It took me a good hour reducing the darn thing by dichotomy. The failure highly depended on the order of evaluation of the different doctests. Here is a minimal example that triggers the failure: R =

### [sage-combinat-devel] Re: Ticket #12215

Hi Anne, On 2012-07-16, Anne Schilling a...@math.ucdavis.edu wrote: Dear Simon, I would like to remove the line - Use #7980 to handle the multiple realizations in ../combinat/sf/sf.py in our upcoming clean-up of symmetric functions. However, this creates a conflict with your patch

### [sage-combinat-devel] Groups

Hi! I'd like to draw your attention to https://groups.google.com/forum/?fromgroups#!topic/sage-devel/Ue5g73lN4KQ The topic is: How to represent groups in Sage. We would like to have an abstract group that is able to provide us with different realisations of itself (permutation presentation,

### [sage-combinat-devel] Re: Groups

Hi Nicolas, On 2012-07-23, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: On Thu, Jul 19, 2012 at 02:21:52AM -0700, Simon King wrote: Thus, it seems to me that this is an ideal application of parents with multiple realisations. Nicolas, perhaps you can comment on the sage-devel

### [sage-combinat-devel] Re: Newbie review question

Hi Andrew, On 2012-07-30, Vincent Delecroix 20100.delecr...@gmail.com wrote: Hi Andrew, Dependencies should be used in trac (it is one of the field in the definition of the ticket and consists an a (possibly empty) sequence of patches). An example at [1]. When a patch is ready in

### [sage-combinat-devel] Re: dual (co)algebras

Hi Franco, On 2012-08-14, Franco Saliola sali...@gmail.com wrote: What should the method that returns the dual of an algebraic object be called? I don't know whether a convention exists. But I would suggest the convention dual_name-of-structure Hence, if you have a vector space V then I'd

### [sage-combinat-devel] Re: dual (co)algebras

[Followup-To: header set to gmane.comp.mathematics.sage.algebra.] On 2012-08-14, John H Palmieri jhpalmier...@gmail.com wrote: --=_Part_11_31037299.1344973817229 What about just dual? By default, it would compute the dual with respect to the category to which it belongs, and we can allow

### [sage-combinat-devel] Re: int and Integers

Dear Vincent, On 2012-08-16, Vincent Delecroix 20100.delecr...@gmail.com wrote: It breaks many test in sage.combinat.*. Note that if we adopt the strict convention (ie int(2) not in Integers/IntegerRange/...) then it will be impossible to do the following {{{ sage: W = Words(positive

### [sage-combinat-devel] Re: int and Integers

Hi Vincent, I'm sorry for my long answer. I am not a native speaker, so, it is difficult for me to be concise in English. On 2012-08-16, Vincent Delecroix 20100.delecr...@gmail.com wrote: This default behavior is very badly suited. In parallel to my second mail, I found the more striking

### [sage-combinat-devel] Re: int and Integers

PS: On 2012-08-16, Simon King simon.k...@uni-jena.de wrote: In other words 3 in Zmod(5)(3) should returns True but it returns an error. Zmod(5)(3) is by default considered as an element of a ring, not as a coset. Hence, of cource 3 in Zmod(5)(3) returns an error. If you want a coset, i.e

### [sage-combinat-devel] Re: missing methods from documentation

Hi! On 2012-08-22, Franco Saliola sali...@gmail.com wrote: --20cf307f346ad0c8b804c7df7c9f Content-Type: text/plain; charset=ISO-8859-1 Over at #8899, I'm having a problem with methods not showing up in the reference manual. Here is a schematic of the class structure: class

### [sage-combinat-devel] Re: SearchForest and post_process...

Dear Florent, On 2012-10-10, Florent Hivert florent.hiv...@lri.fr wrote: I'd like to gather proposal and find an agreement on the names for SearchForest and post_process. I don't know if my answer to sage-devel will automatically appear here as well. If not: I suggested RecursiveSet and

### [sage-combinat-devel] To what extent path algebras are currently available in Sage?

Hi Combinat folks! I see on the Sage Combinat Road Map on trac that there are some tickets dedicated to path algebras: #9889, #12630 and something which appears to have no ticket yet, namely an interface to QPA in Gap. What I'd need is: Path algebras over an arbitrary finite quiver (loops will

### [sage-combinat-devel] Re: To what extent path algebras are currently available in Sage?

Hi Volker, Am Mittwoch, 21. November 2012 13:52:15 UTC+1 schrieb Volker Braun: A C++/Cython implementation of the basic path algebra arithmetic with bit-packed exponents and arbitrary coefficient rings would be a nice thing to have though ;-) Bit packed exponents? What does that mean in a

### [sage-combinat-devel] Re: To what extent path algebras are currently available in Sage?

Hi Volker, On 2012-11-22, Volker Braun vbraun.n...@gmail.com wrote: --=_Part_1271_8275328.1353589681337 Content-Type: text/plain; charset=ISO-8859-1 On Thursday, November 22, 2012 7:37:49 AM UTC, Simon King wrote: Bit packed exponents? What does that mean in a path algebra? I thought

### [sage-combinat-devel] Re: Using lots of posets in Sage 5.0 and later causes high memory usage and eventual crash

Hi Martin, On 2012-11-23, Martin Malandro m.e.malandr...@gmail.com wrote: --=_Part_784_25730379.1353708869141 Content-Type: text/plain; charset=ISO-8859-1 Hi everyone, I've dug around in the source code for several days now, and the issue is not in the poset code specifically. Rather,

### [sage-combinat-devel] Crashing test in tiling.py with Sage's new debug version

Hi! The task #13864 coordinates work on getting a debug version of Sage, i.e., so that SAGE_DEBUG=yes results in Python being built in debug version, Singular being built with malloc instead of omalloc, and so on. The good news: It works ... The bad news: ... almost! One of the remaining

### [sage-combinat-devel] Internal caching in symmetric functions

Hi! Currently we made some progress in fixing Sage's memory leaks that came from overly-eager permanent caching. However, as it turned out in trac ticket #12313, some code related with symmetric functions, specifically code introduced in #13762, heavily relies on having permanent caches. In

### [sage-combinat-devel] Re: Should we be more careful with integral domains?

Hi Nicolas, On 2013-02-08, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: Hmm, fun indeed: sage: Qp(7).category() Category of commutative rings sage: Qp(7) in IntegralDomains() False sage: Qp(7) in Fields() True sage: Qp(7).category() Category of

### Re: [sage-combinat-devel] Should we be more careful with integral domains?

Hi! Am Freitag, 8. Februar 2013 21:54:33 UTC+1 schrieb Nicolas M. Thiery: I agree that Qp(p) should be declared from the beginning in the Fields category. And similarly ZZ[['x']] should be in IntegralDomains. This costs nothing. Here is the reason why it does not work yet. From the

### [sage-combinat-devel] Re: Bug in CombinatorialObject?

Hi Anne, On 2013-02-09, Anne Schilling a...@math.ucdavis.edu wrote: Please let me know if you think this is not a bug. If the consensus is that this is a bug the I will open a ticket and post a patch sometime next week. Yes, this looks like a bug. I don't think so. A ValueError should be

### [sage-combinat-devel] A thematic tutorial on categories and coercion

Hi! In 2011, I had created a (public) worksheet on Sage's category and coercion framework, and used it in a couple of talks. Unfortunately, public worksheets are now disabled. But thanks to #10637, I was able to translate it into .rst, and posted it as a new thematic tutorial. It is available at

### [sage-combinat-devel] sage.devel post

Hi! I don't know if you are aware of https://groups.google.com/forum/?fromgroups=#!topic/sage-devel/mSQqaVrDbZA Probably it makes sense for combinat-devel to chime in. Cheers, Simon -- You received this message because you are subscribed to the Google Groups sage-combinat-devel group. To

### [sage-combinat-devel] Is there a reason for CombinatorialFreeModule to violate the unique parent condition?

Hi! sage: G = CombinatorialFreeModule(ZZ, [1,2,3,4], prefix=G) sage: y = CombinatorialFreeModule(ZZ, [1,2,3,4], prefix='y') sage: G is y False sage: G == y True This is inspite of the fact that CombinatorialFreeModule inherits from UniqueRepresentation. Namely, it overloads __eq__ and __ne__.

### [sage-combinat-devel] Re: Is there a reason for CombinatorialFreeModule to violate the unique parent condition?

Hi Nicolas, On 2013-02-25, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: It was a design decision that the user could create his own free module by specifying a prefix, even if the base ring and index set is the same. So the result for ``G is y`` is as desired. On the other hand, I

### [sage-combinat-devel] Re: Is there a reason for CombinatorialFreeModule to violate the unique parent condition?

Hi Nicolas, On 2013-02-25, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: On the other hand, I personally consider that ``G == y`` is buggy: it should return False; the user explicitly asked for G and y to be distinct even if they are trivially isomorphic. The problem that bites us here:

### [sage-combinat-devel] Re: Is there a reason for CombinatorialFreeModule to violate the unique parent condition?

Hi Nicolas, On 2013-02-25, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: On Mon, Feb 25, 2013 at 07:17:57PM +, Simon King wrote: - Make CombinatorialFreeModule a unique parent, i.e., different prefixes will result in distinct and unequal modules (as suggested by Nicolas). I

Hi Nicolas, On 2013-02-26, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote: In my current (not yet posted) patch, the coercion is missing: sage: G = CombinatorialFreeModule(ZZ, [1,2,3,4], prefix=G) sage: y = CombinatorialFreeModule(ZZ, [1,2,3,4], prefix='y') sage:

Hi, On 2013-02-26, Simon King simon.k...@uni-jena.de wrote: That's perfect: I don't want this coercion :-) No? ... So, you *really* don't want a coercion between parents that have previously evaluated equal? I.e., in a case where the only difference is the prefix? Then I just change

### [sage-combinat-devel] Cythoning sage.categories.homset?

Hi! Homsets are used whenever a coercion or conversion map is involved, hence, they are uniquitous in Sage and should thus be fast. Before I try to convert homset.py into homset.pyx, I'd like to ask, because I suppose people have already tried to make it Cython: Is there a reason why the

### [sage-combinat-devel] Re: Cythoning sage.categories.homset?

Hi! On 2013-03-01, Simon King simon.k...@uni-jena.de wrote: Is there a reason why the transition to Cython should be difficult? Note that @lazy_attribute and @cached_method became available to .pyx files, if I am not mistaken. So, if such decorators where the only original reason to use