Re: [sage-combinat-devel] Re: combinat out again?

On Thu, Dec 06, 2012 at 03:48:00PM -0800, Andrew Mathas wrote: >Is anyone able to get an account on combinat.math.washington.edu? This machine was purchased using the recent Sage-Combinat NSF Computional Mathematics grant co-PI'ed by Anne, Dan, Gregg, William and (unofficially for I am an alie

Re: [sage-combinat-devel] Re: combinat out again?

On Thu, Dec 6, 2012 at 4:27 PM, Andrew Mathas wrote: > >> Are they related to Sage combinatorics research? > > > Of course, otherwise I wouldn't ask. (I'm computing the graded dimensions of > simple modules and the graded dimensions of hom-spaces (for some reducible > modules).) Send me an offlis

Re: [sage-combinat-devel] Re: combinat out again?

> Are they related to Sage combinatorics research? > Of course, otherwise I wouldn't ask. (I'm computing the graded dimensions of simple modules and the graded dimensions of hom-spaces (for some reducible modules).) Andrew -- You received this message because you are subscribed to the Goo

Re: [sage-combinat-devel] Re: combinat out again?

On Thu, Dec 6, 2012 at 3:48 PM, Andrew Mathas wrote: > Is anyone able to get an account on combinat.math.washington.edu? I could > certainly run some memory intensive jobs if required. Are they related to Sage combinatorics research? William > > > Andrew > > -- > You received this message becau

Re: [sage-combinat-devel] Re: combinat out again?

Is anyone able to get an account on combinat.math.washington.edu? I could certainly run some memory intensive jobs if required. Andrew -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To view this discussion on the web visit https://gro

Re: [sage-combinat-devel] Re: combinat out again?

Hi, On Fri, Dec 7, 2012 at 5:36 AM, William Stein wrote: > After moving memory around, memtest86 (and the BIOS memtest) detected > no errors. If people can try to stress test > combinat.math.washington.edu for the next 24 hours (especially with > large-memory computations), that would be very us

Re: [sage-combinat-devel] Re: combinat out again?

Hi William, Sorry to bother you with this, but could you please reset my password on combinat.math.washington.edu and send it to me? I seem to have forgotten my old password. Thank you, Anne On 12/6/12 10:36 AM, William Stein wrote: > Hi, > > After moving memory around, memtest86 (and the BIOS

Re: [sage-combinat-devel] Re: combinat out again?

Hi, After moving memory around, memtest86 (and the BIOS memtest) detected no errors. If people can try to stress test combinat.math.washington.edu for the next 24 hours (especially with large-memory computations), that would be very useful! William On Wed, Dec 5, 2012 at 3:25 PM, William Stein

[sage-combinat-devel] Re: (just a warning) Backward-Incompatible changes in Posets and Permutations

On Thu, Dec 06, 2012 at 06:26:05AM -0800, Nathann Cohen wrote: >Hello !!! > > Maybe the default parameter should just be facade=True. What's the > purpose of having a three-state boolean when two of the states are > equal? facade=None is equivalent to not passing a

[sage-combinat-devel] Re: (just a warning) Backward-Incompatible changes in Posets and Permutations

Hello !!! Maybe the default parameter should just be facade=True. What's the purpose > of having a three-state boolean when two of the states are equal? > Answer 1 : they are not totally equal in the code... The doc says that facade = None is a bit different from facade = True, mean

[sage-combinat-devel] Re: End(CombinatorialFreeModule)?

On 2012-12-06, Nicolas M. Thiery wrote: > On Thu, Dec 06, 2012 at 07:29:57AM +, Dima Pasechnik wrote: >> I wonder if one can actually work in the endomorphism ring/algebra of a >> CombinatorialFreeModule, and if yes, how. > > Not yet. I guess the closest approximation would be to take V \otime

[sage-combinat-devel] Re: End(CombinatorialFreeModule)?

I think that without some extra information this is bound to be difficult. For the modules that I am working with at the moment I can do this and I am in the process of making this more explicit. The modules that I am working with have the following features which make this tractable: - the

[sage-combinat-devel] Re: (just a warning) Backward-Incompatible changes in Posets and Permutations

On Thursday, December 6, 2012 10:08:16 AM UTC, Nathann Cohen wrote: > #13742 (Changes to Posets) : The former meaning of "facade = None" (which > is the default parameter) was "facade = False". Now, it means "facade = > True". > Maybe the default parameter should just be facade=True. Whats the

[sage-combinat-devel] (just a warning) Backward-Incompatible changes in Posets and Permutations

Hellooo everybody !!! Nicolas thought that it would be wiser to send a warning to everybody about patches #13747 and #13742, which make backward-incompatible to Sage **and are now positively reviewed**. They affect the default behaviour of two objects : #13747 (Changes the behaviour o

Re: [sage-combinat-devel] Re: facade initialisation

On Thu, Dec 06, 2012 at 10:56:14AM +0100, Vincent Delecroix wrote: > Do you have a patch for that ? Yes, the dreaded ``more functorial constructions'' patch. > When do you want it to be finalized ? Now! But it's alas not going to happen ... Not that much left to do, but I need a couple days of 1

Re: [sage-combinat-devel] Re: facade initialisation

2012/12/6 Nicolas M. Thiery : > On Thu, Dec 06, 2012 at 10:27:27AM +0100, Vincent Delecroix wrote: >> Ok. What should return facade_for if there are infinitely many of them >> ? A tuple does not fit. It may be an iterator but the default >> constructor then fails. > > Only the future will tell if t

Re: [sage-combinat-devel] Re: facade initialisation

On Thu, Dec 06, 2012 at 10:27:27AM +0100, Vincent Delecroix wrote: > Ok. What should return facade_for if there are infinitely many of them > ? A tuple does not fit. It may be an iterator but the default > constructor then fails. Only the future will tell if there is a good use of facade_for when

Re: [sage-combinat-devel] Re: facade initialisation

> Vincent: the behavior described in the second example on the ticket is > what it should be. The parent should override facade_for if it uses > facade=True. On the other hand, if you find it useful, you may change > the default implementation of facade_for to return a more meaningful > example and

Re: [sage-combinat-devel] Re: facade initialisation

> Perhaps it would be better it would be better to set _facade_for = facade > in parent.pyx by un-indenting the line one step in Parent.__init__() rather > than doing a getattr(). > That was suppose to be (its been a long day, please forgive me): Perhaps it would be better to set _facade_for

Re: [sage-combinat-devel] Re: facade initialisation

On Wed, Dec 05, 2012 at 11:47:25PM -0800, Travis Scrimshaw wrote: >Hey everyone, > What is the reason why facade=True is allowable by Parent? It seems >like we always want to pass in the parent(s) which our facade parent is >acting for. See the documentation on top of sage.catego

Re: [sage-combinat-devel] Re: sage.sets.disjoint_set and sage.combinat.set_partitions

On Thu, Dec 06, 2012 at 12:42:53AM -0800, Travis Scrimshaw wrote: >I definitely agree with you, and my guess from the inactivity on the >ticket, they never got around to it. Personally I don't like SetPartition; >it makes me think that should be an element of SetPartitions. Well, maybe

Re: [sage-combinat-devel] Re: sage.sets.disjoint_set and sage.combinat.set_partitions

I definitely agree with you, and my guess from the inactivity on the ticket, they never got around to it. Personally I don't like SetPartition; it makes me think that should be an element of SetPartitions. Would anyone oppose to changing DisjointSet to FindMergeSet or have any other ideas? Best

Re: [sage-combinat-devel] End(CombinatorialFreeModule)?

On Thu, Dec 06, 2012 at 07:29:57AM +, Dima Pasechnik wrote: > I wonder if one can actually work in the endomorphism ring/algebra of a > CombinatorialFreeModule, and if yes, how. Not yet. I guess the closest approximation would be to take V \otimes V. But of course it is not endowed with compos

Re: [sage-combinat-devel] Re: facade initialisation

Actually that example helps. My understanding is that setting facade=True allows the elements to have arbitrary objects, necessarily even elements. For example: sage: S = FiniteEnumeratedSet([1, Permutation([1,3,2]), Word('a')]); S {1, [1, 3, 2], word: a} sage: S[0].parent() Integer Ring sage: S

Re: [sage-combinat-devel] Re: sage.sets.disjoint_set and sage.combinat.set_partitions

Hi Travis, Thanks for the pointer. But I still don't understand why it is not called SetPartition (with no s). Disjont-set intends to be a *data structure* and not a mathematical object. My objection is mainly about the naming convention. Best, Vincent 2012/12/6 Travis Scrimshaw : > Hey Vincent,

[sage-combinat-devel] Re: sage.sets.disjoint_set and sage.combinat.set_partitions

Hey Vincent, I found this ticket #5039 in which it mentions in the combinat queue (although it seems like it got integrated into sage at some point...), they created the data structure known as a disjoint set. From my understanding (a quick brow