Re: [sage-combinat-devel] Infinite binary words -- Category of uncountable sets

Hi, RR in Sage *is* countable and *is not* the set of real numbers. Nevertheless it is not iterable (I do not know why). Currently there is only finite versus infinite for sets. I agree with you, it would be nice to have a category to deal with by essence non iterable sets such as Words(2). Best

Re: [sage-combinat-devel] Infinite binary words -- Category of uncountable sets

I would say that I am not a specialist of categories. There are many enhancements introduced by #10963. In particular, when you create a category you can do Sets().Finite() or Sets().Infinite() in a cleaner way. I guess we would like something like InfiniteCountable() (as a synonym of Infinite()) a

Re: [sage-combinat-devel] Re: Gray code

Hi, As there would be a lot of Gray code, it makes sense to have a dedicated sage/combinat/gray_codes/. I would be happy to see Gray codes as I do have one project related to it [1]. Sympy gray codes are implemented in pure Python and only concern subsets. It would be nice in Sage to not use GrayC

Re: [sage-combinat-devel] Re: About Free Algebras, infinite Words and equality

How do you define multiplication ?! If it is concatenation then uv = u... 2014/1/5, Darij Grinberg : > Oops, I've just realized that you *can* multiply infinite words, > though I'm not sure if this has ever been used. (No, you cannot take > their shuffle product.) > > On Sun, Jan 5, 2014 at 4:29 P

Re: [sage-combinat-devel] Re: About Free Algebras, infinite Words and equality

Concatenation product is well defined but not well implemented in Sage. If u is infinite then uv = u for any (finite or infinite) word v. It is not a free monoid anymore. That being said, you can build the algebra on finite words, the one on infinite words (which is really stupid) and the one on a

Re: [sage-combinat-devel] Re: About Free Algebras, infinite Words and equality

Thank you for your work !! 2014/1/5, Nathann Cohen : > I just edited ticket #12867. Thank you for your help :-) > > Nathann > > -- > 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 f

Re: [sage-combinat-devel] Volunteers for a Sage presentation/tutorial at CARI 2014?

Hello, Is the conference in french ? (the title is in english but most information are in french) I am interested but the themes of the conference looks far from Sage capabilities: theme 1: Complex Systems Modelling theme 2: Scientific Computing and Parallelism theme 3: Signal, Image, Speec

Re: [sage-combinat-devel] sage-combinat poster

> Graphs are not part of Combinat. ;-) It would be nice to have (part of) http://steinertriples.fr/ncohen/tut/LP_examples/ on the poster !! -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To unsubscribe from this group and stop receiv

Re: [sage-combinat-devel] Should the element of a Parent be Elements ?

Hi Nathann, This is one very special case where the Parent/Element relation is broken. First of all FiniteEnumeratedSet is not the parent of its elements (it is a facade): sage: F = FiniteEnumeratedSet([1, Partition([2,1]), Permutation([3,2,1])]) sage: F {1, [2, 1], [3, 2, 1]} sage: F[0].parent()

Re: [sage-combinat-devel] sum(Composition([1,2,3])) # broken

Hi, Not because of Composition but because of sum sage: import __builtin__ sage: __builtin__.sum(Composition([1,2,3])) 6 Vincent 2014-05-19 16:26 UTC+02:00, Nathann Cohen : > Hello everybody ! > > Today I come with this : > > sage: sum(Composition([1,2,3])) > ... > TypeError: sum() takes exactl

Re: [sage-combinat-devel] Re: sum(Composition([1,2,3])) # broken

I would rather deprecate the `.sum()` of Composition. If you want to concatenate composition, use `+`. There is also a mistake here, `__add__` is implemented instead of `_add_`. Vincent 2014-05-20 10:57 UTC+02:00, Nathann Cohen : > Please help me follow you : > > You want to define a + and * oper

Re: [sage-combinat-devel] Re: sum(Composition([1,2,3])) # broken

Hi, More fun: there are occurrences of sum(self) in the file compositions.py. But here this sum is intended to actually sum the elements. It is fine, because preparser is turned off and sum is the builtin sum there! I agree with Nathan that .sum must be changed. IMHO I would - remove sum from the

[sage-combinat-devel] redesign combinatorial statistics

Hello everyone, I like what statistics try to do but I do not like the way it works. Please tell me where I am wrong and where I am right. I can provide some proof of concepts as soon as most of you agreed on the design. Please: critics are welcome. I think that there are two disjoint tasks: - a

Re: [sage-combinat-devel] Re: redesign combinatorial statistics

It seems that actually nobody read my initial post on that thread... so let me repeat There are two disjoint tasks: - add semantic to Map and Morphism (Sage) - gather the list of meaningful maps (Sage/FindStat) First of all, most of us agree that we need more semantic at the level of maps. Note

Re: [sage-combinat-devel] Re: redesign combinatorial statistics

Hi Christian, 2014-05-28 11:32 UTC+02:00, Christian Stump : >> It seems that actually nobody read my initial post on that thread... so >> let me repeat > > I did -- but didn't really have any qualified contribution... > >> But the semantic has to be implemented at the level of maps not at the >> l

Re: [sage-combinat-devel] Re: redesign combinatorial statistics

Hi Christian, 2014-05-28 15:21 UTC+02:00, Christian Stump : >> The second step would be to think how to add semantic to the map. Part >> of is already managed by the axioms/categories (for example a Morphism > --> How do you think "more semantic" should be implemented? As a dict > with some conven

Re: [sage-combinat-devel] Re: redesign combinatorial statistics

Hi Paul, 2014-05-28 17:42 UTC+02:00, Paul-Olivier Dehaye : > I agree 100% with your summary, Simon, except that > 1) Nathann will have to say himself whether he agrees or not; Please at some point stop the flame. > 2) A decision should be made whether it is valid to introduce lots of empty > met

Re: [sage-devel] Re: [sage-combinat-devel] Re: redesign combinatorial statistics

Hi Vivianne, 2014-05-28 19:32 UTC+02:00, Viviane Pons : > I think we all agree on this idea now (that the decorator should not wrap > the method), so there is no point in keeping the argument. > > Still, I have asked a few questions on which I'd like you guys opinions: > > - what's the best way to

Re: [sage-combinat-devel] Re: redesign combinatorial statistics

Hi Travis, I agree with you and I think it was already suggested by Simon that the maps should not be built on startup. On the other hand, the maps that we want to register might not all come from a method. I created ticket #16408 and drafted a working implementation in u/vdelecroix/experimental-

[sage-combinat-devel] Set_object_enumerated

Hi, I am refactoring subset / subword at #10534. The "elements" are right now of type Set_object_enumerated. But I really do not like it since: sage: from sage.sets.set import Set_object_enumerated sage: Set_object_enumerated((Set(()), Set((2, {{2}, {}} sage: Set_object_enumerated((Set(()), S

Re: [sage-combinat-devel] ClassicalCrystalOfAlcovePaths?

Indeed. The problem was hidden because of a lazy import. But the object actually does not exist (and the deprecation is tested nowhere)! Vincent 2014-12-19 17:23 UTC+01:00, William Stein : > Hi, > > Somebody (mateon1) reported this bug in Sage on gitter [1]: > > There is a mystery thing in the gl

[sage-combinat-devel] polynoms/finite words and series/infinite words

Hi sage-combinat developpers, I just talk with somebody from Lyon (France) which works on (words) complexity of polynoms/series over finite fields. Is there any tools in SAGE for correspondance as : polynoms over GF(p) <-> finite word on the alphabet GF(p) One solution is the following...

[sage-combinat-devel] Re: missing patch

Hi, I had some network problems and some of my previous push did not work (in particular the renaming of iet_closed...). Sorry for this, hoping everything will go well. Vincent 2009/10/9 Nicolas M. Thiery : > > On Fri, Oct 09, 2009 at 06:52:28AM -0700, Anne Schilling wrote: >> >> Thank you, th

[sage-combinat-devel] MathsAuLycee

Hi, Just to say that there is a new section in the design discussion. http://wiki.sagemath.org/MathsAuLycee It's not the best place to put it because it does not concern directly the sage-combinat repository (but it does concern the sage-days in February). Right for now I have no other place to

[sage-combinat-devel] Re: Iterators demo

Hi, A basic example from statistics which I like for its simplicity : {{{ sage: marks = [1, 4, 2, 5.65, 3, 2.28] # the marks of my students sage: mean = sum(marks) / len(marks) sage: print mean 2.988333 sage: variance = sum([(mark-mean)^2 for mark in marks]) / len(marks) sage: print vari

[sage-combinat-devel] two operations on partitions

Hello, I need to consider two (families of) simple operations on partitions that are not explicitely implemented in partition. They are split(pi, a) : (p1, ..., pi, ..., pk) -> (p1, ..., a, pi - a - 1, ..., pk) collapse(pi, pj) : (p1, ..., pi, ..., pj, ..., pk) -> (p1, ..., pi + pj - 1, ..

Re: [sage-combinat-devel] disabled cardinality_of_rauzy_classes-vd.patch which breaks sage starts up

Hi, > The patch cardinality_of_rauzy_classes-vd.patch which breaks Sage's Sorry for that. I'm working on the patch trac_7145 from the review of Sebastien and let the cardinality apart... Cheers, Vincent -- You received this message because you are subscribed to the Google Groups "sage-combina

[sage-combinat-devel] Alphabet and Words

Hi Franco, Sebastien and others, I'm correcting the patch about Interval Exchange Transformations (iet) which uses a lot sage.iet.words.* (alphabet, words and morphisms). Just some remarks about this nice library. 1) alphabet does not have a union procedure but... Alphabet heritates from Combinat

[sage-combinat-devel] Partitions bug with max_slope?

I get the following with sage-4.3, is it normal to have [2, 1] and [1, 2] as partitions ? {{{ sage: for p in Partitions(3, max_slope=1): : print p : [3] [2, 1] [1, 2] [1, 1, 1] }}} Vincent -- You received this message because you are subscribed to the Google Groups "sage-combinat-de

Re: [sage-combinat-devel] Partitions bug with max_slope?

Yes I searched min_slope=-1 ;-) Thanks very much Nicolas. A raised error should convince me that I made an error (or I can consult the documentation before doing). Thanks one more time. Vincent 2010/1/9 Nicolas M. Thiery : > On Sat, Jan 09, 2010 at 10:53:30AM +0100, Vincent Delecroix wr

Re: [sage-combinat-devel] Re: [sage-devel] sage.combinat.combinat.combinations and sage.combinat.combination.Combinations

Dear Tim, dear sage-combinat, >> The huge speed differnce can be seen here: >> >>    {{{ >>    sage: timeit('[Combinations(range(i), j).list() for (i, j) in >>    CartesianProduct(range(15), range(15))]') >>    5 loops, best of 3: 449 ms per loop >> >>    sage: timeit('[combinations(range(i), j) f

Re: [sage-combinat-devel] sage/combinat/iet/template.py

Hi John, 2010/1/18 John H Palmieri : > The patch "trac_7948-lazy.patch" at sage_trac/ticket/7948> patches the file sage/combinat/iet/ > template.py. > >  Although the patch already has a positive review, could > someone familiar with the combinatorics code take a quick

[sage-combinat-devel] crystals

Hi everyone, sage-combinat is broken on my computer because of on sage-4.3 {{{ application de trac_7978_crystal_cleanup-as.patch patching file sage/combinat/crystals/crystals.py Hunk #2 FAILED at 135 }}} and on 4-3-1 at startup {{{ SyntaxError: Non-ASCII character '\xe2' in file /usr/local/sag

Re: [sage-combinat-devel] trac 7004: Refactor the graph layout code, and add interface with graphviz

Dear Nicolas, dear all, I started the lecture and the review. I need your tools to draw huge Rauzy diagrams (more than 1000 vertices) and graphs of graphs. Hence, I will see if your patch is "adaptable". If anybody else is on that, tell me I will concentrate my efforts on Rauzy diagrams. It will

Re: [sage-combinat-devel] Unpicklable class in IET and Words...

Hi Florent Yes. Thank you for pointing this. I know from where it comes: a path does not know how to build the underlying graph. I need some help to design this. Did you create a ticket for it ? Vincent -- You received this message because you are subscribed to the Google Groups "sage-combin

Re: [sage-combinat-devel] Interface with Semigroupe; first step to success

2010/2/24 Nicolas M. Thiery : >        Dear Jean-Eric, dear Sage-Combinat devs, > > Thanks to Semigroupe, Cython, and Sage Days 20, there now exists a > monoid of size 823543 which Sage can construct in memory in about one > second :-) Congratulations ! -- You received this message because you a

Re: [sage-combinat-devel] Re: [sage-devel] fractals in sage

2010/3/2 Florent Hivert : >      Hi William, > >> A student of mine is going to add to sage the capability of plotting >> lots and lots of fractals easily.  E.g., > [...] >> The point of this email: if you like plotting fractals, and have some >> potentially useful code to contribute, then please p

[sage-combinat-devel] WordMorphismExtension, vocabulary ang global namespace

Hi, With Stepan and Timo we start this week to work on WordMorphismExtensions starting from the code of Franco (thank you Franco). The code is in sage-combinat and works almost well. There is also an opened ticket #8431 relating this feature. {{{ sage: s = WordMorphism('a->ab, b->ac, c->a') sage:

Re: [sage-combinat-devel] WordMorphismExtension, vocabulary ang global namespace

> > Can you give here some typical use cases for those? > Here it is (in fact the dual morphism operates more on patches than on faces because the image of a face is a patch and not a face) {{{ sage: e = WordMorphismExtensionDual('a->ab,b->ac,c->a') sage: e E*(WordMorphism: a->ab, b->ac, c->a) sa

Re: [sage-combinat-devel] Fwd: [sage-devel] GSOC 2010 proposal

Hi Mike, Hi Carlos, I just answer few words about Automata. We talked with Jean Berstel about it during Sage days 20 and he said that there was a lot of software available around the world for dealing with them. The most general and most active is vaucanson (maintained by Jacques Sakarovitch) whic

[sage-combinat-devel] is_square_free

Hello, sage.combinat.words have a (HUGE) problem {{{ sage: Word("aa").is_square_free() True }}} The one-line-patch ticket is #8490 and needs review... Cheers, Vincent -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To post to this gro

[sage-combinat-devel] Re: two operations on partitions

Hello, One more time with integer partitions... 1) I find the actual __repr__ boring (Ferrers diagram). Why do not keep the old list representations which is really clearer than lines of sharps ? Is there a reason to prefer Ferrer diagrams than list of integers ? Moreover with the actual serie of

Re: [sage-combinat-devel] The queue is broken !!! trac_8490_square_free-vd.patch

Hi Florent, > application de trac_8490_square_free-vd.patch > unable to find 'sage/combinat/words/finite_word.py' for patching > 1 out of 1 hunks FAILED -- saving rejects to file > sage/combinat/words/finite_word.py.r > l'application du patch a échoué, impossible de continuer (essayez avec -v) >

Re: [sage-combinat-devel] The queue is broken !!! trac_8490_square_free-vd.patch

I put guards #4_3_4_1 on my patch and everything applies (with or without 4_3_4_1 selected) Sorry for this Vincent -- 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-de...@googlegroups.com.

[sage-combinat-devel] Permutation and PermutationGroupElement

Hi, Just to mention few incompatibilities with two nice different objects in Sage: the Permutation and the PermutationGroupElement. I can understand that we need to distinguish the two objects (not so well), is it projected to have a fusion and if not why ? compatibility between them ? Which one I

Re: [sage-combinat-devel] Re: two operations on partitions

>> 2) Is it consistent to define the following operation + on partition >> which sounds like concatenation on list >> {{{ >> sage: p = Partition([2, 1]) >> sage: p >> [2, 1] >> sage: q = Partition([3, 1]) >> [3, 1] >> sage: p + q >> [3, 2, 1, 1] >> }}} > > -1 on this: I'd rather denoting this opera

Re: [sage-combinat-devel] Patch queue woes: iet/iet.py not found

What is your Sage version ? sage/combinat/iet/iet.py is merged in Sage since 4.3.2 (Moreover, I do not think that there is any link between Sebastien's patch and this file). It looks strange... > patch failed, unable to continue (try -v) > sage/combinat/iet/iet.py: No such file or directory > No

[sage-combinat-devel] Bug (?) report for fixed point of word morphism

Hi, I tried the following and get an unexpected error {{{ sage: s = WordMorphism({'a1': ['a1','a2'], 'a2':['a1']}) sage: s.fixed_point('a1') Traceback ... KeyError: 'a' }}} and it does the same for tuples {{{ sage: s = WordMorphism({('a', 1) : [('a', 1), ('a', 2)], ('a', 2) : [('a', 1)]}) sage:

Re: [sage-combinat-devel] Bug (?) report for fixed point of word morphism

Thanks Sebastien for the ticket creation. It will be reviewed as soon as you write it ;-) Cheers, Vincent -- 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-de...@googlegroups.com. To unsub

Re: [sage-combinat-devel] Bug (?) report for fixed point of word morphism

Hello Sebastien, hello combinat-words dev, hello combinat team, In the same vein {{{ sage: t = WordMorphism({'a1' : ['a2'], 'a2': ['a1']}) sage: w = Word(['a1','a2']) sage: w.is_palindrome(t) Traceback ... KeyError 'a' }}} It is ennoying because I have a lot of pseudo palindromes on my hyperelli

Re: [sage-combinat-devel] queue is broken -- am I responsible ?

Hi, > This one is fixed but there is another one later: > > application de trac_8431-word_morphism_extensions-vd.patch > unable to find 'sage/combinat/invariant_ring_perm_gps/evaluation.py' for > patching > > The problem comes from the following chunk: > > diff -r 79d9e00bcdb7 sage/combinat/invar

[sage-combinat-devel] broken sadic (Sebastien ?)

Hello, It seems that the words.s_adic generator is broken by some patch word_dynamic_classes* sage: fib = WordMorphism('a->ab,b->a') sage: from itertools import repeat sage: words.s_adic(repeat(fib), repeat('a')) ValueErrorTraceback (most recent call last) ... Valu

Re: [sage-combinat-devel] broken sadic (Sebastien ?)

>> It seems that the words.s_adic generator is broken by some patch >> word_dynamic_classes* > > The second of them is very experimental and is guarded by #+not_ready > : make sure that only the first of the word dynamic class patch is > applied. > > Tell me if there are still any problems. Thank

[sage-combinat-devel] Re: language

> En fait, je crois qu'une autre solution serait mieux dans ce cas-ci. > L'utilisation de méthodes sur les objets permet d'éviter toute > l'ambiguité due à la création d'un objet plus complexes à partir > d'objets simples (qui peuvent utiliser les mêmes structures de données > python pour représent

[sage-combinat-devel] generators of trivial permutation group

Hi, Just consider the following group sage: G = SymmetricGroup(1) sage: G Symmetric group of order 1! as a permutation group What must be standard generators for it ? For now it is the family consisting of the identity... sage: G.gens() Family ((),) But I would prefer an empty family as gap do

Re: [sage-combinat-devel] problems with origami patch

Hi Anne, > There seems to be a problem with your new patch: Sorry for this. I submitted the patch with Karsten last night, and we put inside a file .cpp that is produced by cython during compilation. I will modify it (because Karsten is on the rails) and submit the changes in at most two minutes.

[sage-combinat-devel] mutability of permutations

Hi sage-devs, During the sage-days in Luminy, Florent told me about a possible mutability of objects that fails to be mathematically consistent for a moment. As an example, starting with the permutation [1,2,3] switching 1 and 2 in two steps gives an intermediate step with [1,1,3] which is no more

[sage-combinat-devel] Sage try to start MuPad

Hello, I made an error while correcting the series file (relative to the patch that appeared at the end of the file). My first attempt was to correct it but while starting Sage I get """ RuntimeError: Unable to start MuPAD because the command 'mupkern -P e -U SAGE=TRUE' failed. In order to use t

[sage-combinat-devel] Re: Sage try to start MuPad

> Hello, > > I made an error while correcting the series file (relative to the > patch that appeared at the end of the file). My first attempt was to > correct it but while starting Sage I get > I decided to disabling mupad-interface which seems to resolve the problem. -- You received this messa

Re: [sage-combinat-devel] Adding dictionaries pointwise using cython

I think that this kind of question is more dedicated to sage-support because it does not deal about combinatorics (http://groups.google.com/group/sage-support) 2010/7/28 Christian Stump : > Salut cython specialists, > > I would like to implement a routine adding dictionaries with possibly > differ

[sage-combinat-devel] disabling

Hello, I disabled the last patch of the queue (sf-tutorial-jb.patch) due to some error on my computer which says that the file are here and can not be added. Was it the case for everybody? Cheers, Vincent -- You received this message because you are subscribed to the Google Groups "sage-combin

Re: [sage-combinat-devel] disabling

Hello, > With sage-4.5.1 I now get the following error: > > patching file sage/geometry/all.py > Hunk #1 FAILED at 9 > 1 out of 1 hunks FAILED -- saving rejects to file sage/geometry/all.py.rej > patch failed, unable to continue (try -v) > patch failed, rejects left in working dir > errors during

Re: [sage-combinat-devel] Re: disabling

Hello, > I have been trying to install sage 4.5.2 and sage combinat on various > computers recently and got problems with triangle_graphs. Are you sure > that you have solved the problem you were talking about ? > > Here is the last part of what appears when I run sage, after > installing sage-com

Re: [sage-combinat-devel] Removed 15 of my work in progress patches from the sage-combinat tree.

Hi Sébastien, hi combinat devs, > Hence, since the majority of the patches I'm working on are > independent of other's, I decided to create my own patches repository > (made of my patches and the patches I am reviewing) : > > http://sage.math.washington.edu/home/slabbe/patches/ I found that's a g

[sage-combinat-devel] Re: souci en sage

Dear Frederic and sage-combinat team, > > j'essaye de faire "sage -combinat update", depuis quelques jours, sur > diverses machines, et a chaque fois ca donne ca : > > IOError: could not find dependency > sage/dynamics/flat_surfaces/origamis/cpython.pxd included in > sage/dynamics/flat_surfaces/or

Re: [sage-combinat-devel] ImportError: No module named flat_surfaces.all

Hello, > In a scratch-built Sage 4.6 on sage.math, I ran > > ./sage -combinat install > ./sage -combinat update > ./sage > > but I see > > [...] > > /mnt/usb1/scratch/mpatel/tmp/sage-4.6-combinat/local/bin/ipy_profile_sage.py > ImportError: No module named flat_surfaces.all > Error importing ipy_p

[sage-combinat-devel] hg push does not work any more

I was aiable to reinstall sage-combinat on sage-4.6 but not to push any changes. What did change from yesterday ? Vincent vinc...@jahe$ sage -hg push pushing to http://combinat.sagemath.org/patches/ searching for changes ** unknown exception encountered, details follow ** report bug details to ht

[sage-combinat-devel] Re: hg push does not work any more

> I was aiable to reinstall sage-combinat on sage-4.6 but not to push > any changes. What did change from yesterday ? > The problem curiously disappeared... if anyone has an explanation, I will be happy to hear it! Vincent -- You received this message because you are subscribed to the Google Gr

Re: [sage-combinat-devel] problems with hg

Hi Anne, > > I modified the series file (to make it compatible with sage-4.4.2), > did hg commit and then tried hg push from the sage-combint/.hg/patches > directory and got the following error message. Now I am not sure what's > wrong. > I just realized [*] that I get the same error as you few m

[sage-combinat-devel] two patches fail to apply

Hi, The following patches do not apply correctly on my sage-4.6 * trac_8678-module_morphisms-nt.patch * addon_finite_semigroup-nt-cs.patch I would like to put two guards but then Sage does not build any more... any hint ? Cheers, Vincent -- You received this message because you are subsc

Re: [sage-combinat-devel] two patches fail to apply

> Maybe: > >sage -combinat qselect > > (some new guards have been introduced recently). Thank you Nicolas for your answer. What does the command "sage -combinat qselect" do ? In any case, the command does not solve anything... (But I found how to "solve" temporarily the problem by hand m

Re: [sage-combinat-devel] Re: sage-combinat: erreur?

Salut Florent, Merci pour ta réponse. >> on bosse avec Vincent sur les surfaces plates et on voudrait envoyer nos >> modifs sur sage-combinat, mais il semble y avoir une erreur, dont on se >> demande si elle pourrait venir des modifs que tu as envoyées; peux-tu >> vérifier? > > Est-ce que tu peux

Re: [sage-combinat-devel] two patches fail to apply

>> PS: my hunky traceback > > Which patches are applied? > patches guarded (verbose output from $ hg -v qseries | grep "\ G\ "). In particular the patch 27 trac_9648_modulemorphism_codomain_extension-cs.patch is. 0 G trac_7420-fix-infinite-coercion-discovery-loop-2.patch 1 G sage-4.3.1.patch 2 G

Re: [sage-combinat-devel] two patches fail to apply

>> >> PS: my hunky traceback >> > >> > Which patches are applied? >> > >> >> patches guarded (verbose output from $ hg -v qseries | grep "\ G\ "). >> In particular the patch 27 >> trac_9648_modulemorphism_codomain_extension-cs.patch is. > > Ok, so that's indeed the problem: those patches are guarde

Re: [sage-combinat-devel] two patches fail to apply

>> vinc...@chezmoi$ sage -combinat update nor >> vinc...@chezmoi$ sage -combinat qselect >> fixed the problem > > Hmm. You might need to run sage -combinat qselect *in the sage-combinat > repository*. Could you give it a shot, and have a look at the script, > to see if this is the problem and possi

Re: [sage-combinat-devel] two patches fail to apply

> > Ah: that's wrong. There must be a glitch in the guards detection > (functions hg_all_guards / hg_active_guards). > There is (sort of) glitch ! I have the option verbose = true in my hgrc and the result of hg qelect -s is not a list of +name_of_the_guard but is the result of hg qselect -sv whic

Re: [sage-combinat-devel] two patches fail to apply

2010/11/27 Nicolas M. Thiery : > On Sat, Nov 27, 2010 at 04:56:28PM +0100, Vincent Delecroix wrote: >> > There is (sort of) glitch ! I have the option verbose = true in my >> hgrc and the result of hg qelect -s is not a list of >> +name_of_the_guard but is the result of

[sage-combinat-devel] coercion framework

Hello, I would like to use CombinatorialFreeModule and other combinatorial modules like group algebra. But there is always the same error when calling .gens() (and the traceback is not so useful for explaining me what should I do)... how do we use these objects ? Thanks Vincent sage: F=Combinato

[sage-combinat-devel] fast generation of combinatorial structures

Hello, I need for the purpose of my research fast iterator through set-partitions of a set, let say sage: SetPartitions(18,[3,3,3,3,3,3]).cardinality() 190590400 The actual version is not convincing in terms of speed, so I started to rewrote a bunch of combinatorial generation using very basic cyt

Re: [sage-combinat-devel] fast generation of combinatorial structures

Hi, >> I need for the purpose of my research fast iterator through >> set-partitions of a set, let say > > Yipee! It's great that someone is taking up this task which has been > on the TODO list for a while. Please create a ticket, and mention it > on: > >        http://trac.sagemath.org/sage_trac

Re: [sage-combinat-devel] fast generation of combinatorial structures

Hi Nicolas! > >> I decided to implement a Python extension in order to provide the best >> performances (because I just found that itertools has a combination >> function which is 100 times faster that anything I did with Cython). > > (you mean with Python I guess?) ^^

Re: [sage-combinat-devel] Re: De Bruijn Sequences

Just a question/remark : a DeBruijn sequence is just a Hamiltonian cycle in the Rauzy graph of the full language right ? (remark that for the DeBruijn graph the problem of finding Hamiltonian path is equivalent to the one of looking for Euler cycles at the next level!). It could be nice to have poi

[sage-combinat-devel] iterations

Hello, I'm still in my iteration challenges... I put pointers to itertools wherever it is needed for speed (i.e. choose_nk, subset, subword) as well as additional _fast_iterator in some combinatorial classes (SetPartitions). But now, must of the iterator yield tuples and not lists. The timing is b

[sage-combinat-devel] Permutation generator

Hello, I made some improvements (?) of the Permutation function (in improve_constructors_of_iet-vd.patch) in order to disable {{{ sage: Permutation(['a','b','c']) ['a', 'b', 'c'] sage: Permutation([2,1,1]) [2, 1, 1] }}} We now have: {{{ sage: Permutation(['a','b','c']) TypeError

Re: [sage-combinat-devel] problems with the queue with sage-4.6.1

Hello Anne, hello Florent, Sorry for late answer. I'm trying to apply the 8898.sh script on 4.6... it will be soon fixed (today, tomorrow or the day after tomorrow). But as far as I understand the problem of constructors.py was not line ending but misleading spaces like -if a == 3 : -print

[sage-combinat-devel] queue broken

Sorry, Due to conflict with trac_8898 the combinat queue is currently broken... wait few minutes before pull and push. Vincent -- 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@goog

[sage-combinat-devel] Re: queue broken

> > Due to conflict with trac_8898 the combinat queue is currently > broken... wait few minutes before pull and push. > This conflict is resolved and should work on sage-4.6.1. But application de trac_9065-facade_parents-nt.patch patching file sage/categories/enumerated_sets.py Hunk #1 FAILED at

[sage-combinat-devel] guards for 4_6_1

The four patches below do not apply on 4_6_1, so I decided to temporarily to guard them with a +4_6_1 * trac_10333-lrcalc-mh.patch * coxeter3-mh.patch * coxeter3-iterator.patch * trac_8360_semigroupe-interface-nt.patch It will be push in few minutes Vincent -- You received this message

Re: [sage-combinat-devel] Reject on the queue

Hi Florent 2011/1/18 Florent Hivert : >    Hi Vincent, > > In case you didn't notice > > applying demo_origami-vd.patch > applying iet_thematic_tutorial-vd.patch > applying demo-words-sl.patch > patching file doc/en/reference/demos/2011-01-17-SageDays28.rst > Hunk #1 FAILED at 22 > 1 out of 1 hunk

Re: [sage-combinat-devel] Re: Several trivial reject in the queue

Bonjour, > > je suis supposé faire quoi ? Comment je peux savoir pourquoi le patch > trac_10167-posets_Jposet_ARmatrix_fc.patch pose probleme ? > Lorsqu'un patch ne s'applique pas, mercurial crée un fichier le_fichier_en_question.rej qui correspond au diff qui n'est pas appliqué sur l'original. I

[sage-combinat-devel] Rewriting subword.py, subset.py, set_partition_ordered and set_partition.py

Hello Florent, hello others, I'm rewriting subword, subset, set_partition_ordered and set_partition in order to * correct many bugs (as example sage: Subwords([1,2,3], 0).last()) * improve documentation (in many case write the documentation) * have admissibe time (eg not infinite) for iter

Re: [sage-combinat-devel] Rewriting subword.py, subset.py, set_partition_ordered and set_partition.py

Hello ! >> I'm rewriting subword, subset, set_partition_ordered and set_partition >> in order to >>   * correct many bugs (as example   sage: Subwords([1,2,3], 0).last()) >>   * improve documentation (in many case write the documentation) >>   * have admissibe time (eg not infinite) for iterations

Re: [sage-combinat-devel] Rewriting subword.py, subset.py, set_partition_ordered and set_partition.py

> >>> I'm rewriting subword, subset, set_partition_ordered and set_partition >>> in order to >>>   * correct many bugs (as example   sage: Subwords([1,2,3], 0).last()) >>>   * improve documentation (in many case write the documentation) >>>   * have admissibe time (eg not infinite) for iterations t

[sage-combinat-devel] Question(s) about Integer vectors mod permgroup

Hello Nicolas (the little), I'm widely interested in your class for exhaustive generation of vectors modulo permgroup ! Thank you for this nice patch. My need are a bit more general: 1) iteration of couples "(vector, stabilizer of the vector)" 2) iteration through vectors such that the stabi

Re: [sage-combinat-devel] Question(s) about Integer vectors mod permgroup

>>   1) iteration of couples "(vector, stabilizer of the vector)" > > It depend on what kind of information you want in `stabilizer of the > vector`. If you want it to be a sage or gap permutation group, it can be > very very painful (especially for speed...). The orbit is `very easy` to > get, for

Re: [sage-combinat-devel] Re: Big cleanup in partitions and permutations

Hello Florent, There are 20 lines at the begining of the patch improve_constructors_of_iet-vd.patch which modify permutation.py (the __init__ method). See the following thread http://groups.google.com/group/sage-combinat-devel/browse_thread/thread/354f6e841ae5cc58 Cheers, Vincent -- You rece

Re: [sage-combinat-devel] updated series file

Hello, Anne, thank you for the job. I remark that some of my patches disappeared in the series file (not a problem but look strange). A real problem is that after all changes (on sage-4.6.2) I get ... ImportError: No module named rigged_configuration_element_type_A Error importing ipy_profile_sag

Re: [sage-combinat-devel] updated series file

Hello, > skipping separatrix_diagram-vd.patch - guarded by '-4_7_1' > applying translation_surface_homology-vd.patch > unable to find 'sage/dynamics/flat_surfaces/separatrix_diagram.py' for > patching That's normal because translation_surface_homology-vd.patch depends on separatrix_diagram-vd.pat

Re: [sage-combinat-devel] Rebasing trac_10534-generation_of_subsets_and_set_partitions-vd-rebased.patch on top of trac_11118-finite_enumset_list_cache-fh

Salut Nicolas, 2011/4/26 Nicolas M. Thiery : >        Salut Vincent, > > I just rebased your patch > >        trac_10534-generation_of_subsets_and_set_partitions-vd.patch > > [...] > > Rationale: with #10534, TestSuite checks that cardinality returns an > Integer. So I had to fix Subsets(...).card

[sage-combinat-devel] about trac_10534 and set-partition-fs.patch

Dear Franco (if fs -> Franco Saliola), I apologize. I modified the file set_partition in the patch trac_10534 in order to * return an Integer for .cardinality() * add TestSuite in all __init__ methods * make a proper construction for the categories (with Parent.__init__) There is a (somewha

  1   2   >