Re: [sage-combinat-devel] A pretty bug...

2012-06-22 Thread Nicolas M. Thiery
On Wed, Jun 20, 2012 at 06:19:30PM +0200, Florent Hivert wrote: > sage: A = WQSymOperad(QQ) > sage: A[{1,2}, {3}] > A[12,3] > sage: A.an_element() > A[_,a,n,_,e,l,e,m,e,n,t,_] That's a cute one :-) Just out of curiosity, what does A.basis().keys().an_element() give? Cheers,

Re: [sage-combinat-devel] Re: namings for eulerian and mahonian statistics

2012-06-22 Thread Christian Stump
Hi -- I already asked this, but no one seemed to have an opinion on that... I have now implemented 5 or 6 bijections between Dyck paths and subsets of permutations (pattern-avoiding or noncrossing). I think that it is not practical to have a name for each of them since they 1. do not necessarily

Re: [sage-combinat-devel] queue

2012-06-22 Thread Florent Hivert
On Wed, Jun 20, 2012 at 11:32:44PM -0700, Anne Schilling wrote: > Hi! > > Currently, the following patch does not apply: > > applying update-dot2tex-nt.patch > applying sage-demos-and-tutorials-nt.patch > patching file doc/en/reference/combinat/index.rst > Hunk #1 FAILED at 3 > 1 out of 1 hunks F

Re: [sage-combinat-devel] Re: namings for eulerian and mahonian statistics

2012-06-22 Thread Anne Schilling
Hi Christian, > I already asked this, but no one seemed to have an opinion on that... > > I have now implemented 5 or 6 bijections between Dyck paths and > subsets of permutations (pattern-avoiding or noncrossing). I think > that it is not practical to have a name for each of them since they 1. >