[sage-devel] Re: implementation of Rencontres numbers

2007-12-05 Thread mabshoff
It seems like email are getting lost on the way to sage-devel: Nicolas M. ThiƩry wrote: > However, what we do in Aldor-Combinat cannot be done so elegantly in any > > other language I know off. We learned a lot from MuPAD-combinat, but our > > design is completely different from MC, since Aldor

[sage-devel] Re: [Aldor-combinat-devel] [sage-devel] Re: implementation of Rencontres numbers

2007-12-05 Thread Ralf Hemmecke
>> Is there a problem with the license of the aldor compiler >> (aldor-combinat itself is GPL2). > > Yep, I believe so. From the website; Version 1.1 of Aldor has been > released in source form under the Aldor Public License 2.0. This allows > free non-commercial use, modification and re-distribu

[sage-devel] Re: [Aldor-combinat-devel] [sage-devel] Re: implementation of Rencontres numbers

2007-12-05 Thread Michael Abshoff
Martin Rubey wrote: > "Michael Abshoff" <[EMAIL PROTECTED]> > writes: [somehow Martin's reply didn't make it onto sage-devel (yet)] > >> > * licensing issues need to be sorted out since the APL2 is not >> > GPL-compatible. I don't know if it'd even be possible to distribute >> Aldor >> > as par

[sage-devel] Re: [Aldor-combinat-devel] [sage-devel] Re: implementation of Rencontres numbers

2007-12-04 Thread Michael Abshoff
Mike Hansen wrote: > Hello, > Hello, >> Mike, could you point me to your code? > > I've attached the _very_ rough version I started awhile back. It just > does FormalPowerSeries and DataStream. > >> I actually wonder why you would >> reprogram it in Sage and not interfacing the aldor-combinat l

[sage-devel] Re: [Aldor-combinat-devel] [sage-devel] Re: implementation of Rencontres numbers

2007-12-04 Thread Mike Hansen
> > Mike, could you point me to your code? > > I've attached the _very_ rough version I started awhile back. It just > does FormalPowerSeries and DataStream. Just for clarification, the code that I posted above is just some very preliminary experimentation I had been doing on my own machine. It

[sage-devel] Re: [Aldor-combinat-devel] [sage-devel] Re: implementation of Rencontres numbers

2007-12-04 Thread Mike Hansen
Hello, > Mike, could you point me to your code? I've attached the _very_ rough version I started awhile back. It just does FormalPowerSeries and DataStream. > I actually wonder why you would > reprogram it in Sage and not interfacing the aldor-combinat library? > Is there a problem with the lic

[sage-devel] Re: implementation of Rencontres numbers

2007-12-04 Thread Michael Abshoff
Ralf Hemmecke wrote: > > On 11/30/2007 03:13 AM, Mike Hansen wrote: >> Hi Dan, >> >> I've been spending a bit of time with symmetric functions recently. >> In the near future, I'll be making a commit that adds support for >> Hall-Littlewood, Macdonald polynomials, and quasisymmetric functions. >>

[sage-devel] Re: implementation of Rencontres numbers

2007-12-04 Thread Ralf Hemmecke
On 11/30/2007 03:13 AM, Mike Hansen wrote: > Hi Dan, > > I've been spending a bit of time with symmetric functions recently. > In the near future, I'll be making a commit that adds support for > Hall-Littlewood, Macdonald polynomials, and quasisymmetric functions. > Other stuff that will need to

[sage-devel] Re: implementation of Rencontres numbers

2007-11-29 Thread Mike Hansen
Hi Dan, I've been spending a bit of time with symmetric functions recently. In the near future, I'll be making a commit that adds support for Hall-Littlewood, Macdonald polynomials, and quasisymmetric functions. Other stuff that will need to be done are LLT polynomials, k-Schur functions, and non

[sage-devel] Re: implementation of Rencontres numbers

2007-11-29 Thread Dan Drake
By the way, what other sorts of combinatorial functions need to be written? I'm pretty decent with Python, Mathematica, and Maple, and would be happy to help out. I don't really do graph theory, though, so the recent post here on graph theory stuff is not something I'd be very helpful with. Dan

[sage-devel] Re: implementation of Rencontres numbers

2007-11-27 Thread Jaap Spies
William Stein wrote: > On Nov 27, 2007 10:47 AM, Jaap Spies <[EMAIL PROTECTED]> wrote: >> This is my favorite application of permanents: counting the number of >> permutations with restricted positions! > > That is indeed very beautiful.It's not so good from an efficiency > point of view tho

[sage-devel] Re: implementation of Rencontres numbers

2007-11-27 Thread William Stein
On Nov 27, 2007 10:47 AM, Jaap Spies <[EMAIL PROTECTED]> wrote: > > Jaap Spies wrote: > > > > > Maybe it is interesting to know that you can do this with integer arithmetic > > (and permanents!): > > > > Let J_n be the n x n matrix with all 1's and I_n the identity matrix, > > then the number of r

[sage-devel] Re: implementation of Rencontres numbers

2007-11-27 Thread Jaap Spies
Jaap Spies wrote: > > Maybe it is interesting to know that you can do this with integer arithmetic > (and permanents!): > > Let J_n be the n x n matrix with all 1's and I_n the identity matrix, > then the number of recontres or derangements with no fixed points is > > D_{n,0} = per(J_n - I_n)

[sage-devel] Re: implementation of Rencontres numbers

2007-11-27 Thread Jaap Spies
William Stein wrote: > On Nov 26, 2007 11:05 PM, Dan Drake <[EMAIL PROTECTED]> wrote: >> Hello, >> >> I don't know if this is the appropriate place to submit code, but... >> >> The combinat.py file lists Rencontres numbers in the TODO section. >> Here's a function that implements Rencontres number

[sage-devel] Re: implementation of Rencontres numbers

2007-11-27 Thread William Stein
On Nov 26, 2007 11:05 PM, Dan Drake <[EMAIL PROTECTED]> wrote: > Hello, > > I don't know if this is the appropriate place to submit code, but... > > The combinat.py file lists Rencontres numbers in the TODO section. > Here's a function that implements Rencontres numbers. I tried to copy > the docu