[Axiom-developer] Re: pfaffian.input.pamphlet

>> Martin, >> >> I've been studying Pfaffian systems (related to robotics, a field I >> know a bit about). It seems that your algorithm does not work for >> embedded matrices as in: >> >> z:SQMATRIX(2,INT):=[[0,0],[0,0]] >> m:SQMATRIX(2,INT):=[[0,1],[-1,0]] >> m2:SQMATRIX(4,SQMATRIX(2,INT)):=[[m,

[Axiom-developer] [ANN] new version of axiom mode for emacs.

The following message is a courtesy copy of an article that has been posted to gnu.emacs.sources,comp.emacs.xemacs as well. Axiom is a wonderful computer algebra system and axiom.el ist the emacs mode that makes it great to use. This new version now has a command axiom-yank by default bou

[Axiom-developer] Re: pfaffian.input.pamphlet

root <[EMAIL PROTECTED]> writes: > Martin, > > I've been studying Pfaffian systems (related to robotics, a field I > know a bit about). It seems that your algorithm does not work for > embedded matrices as in: > > z:SQMATRIX(2,INT):=[[0,0],[0,0]] > m:SQMATRIX(2,INT):=[[0,1],[-1,0]] > m2:SQMATRIX

[Axiom-developer] Re: Copyright notice Re: pfaffian.input.pamphlet

Martin, I've been studying Pfaffian systems (related to robotics, a field I know a bit about). It seems that your algorithm does not work for embedded matrices as in: z:SQMATRIX(2,INT):=[[0,0],[0,0]] m:SQMATRIX(2,INT):=[[0,1],[-1,0]] m2:SQMATRIX(4,SQMATRIX(2,INT)):=[[m,z,z,z],[z,m,z,z],[z,z,m,z],

Re: [Axiom-developer] Re: Copyright notice Re: pfaffian.input.pamphlet

On 09/29/2007 06:42 PM, Martin Rubey wrote: root <[EMAIL PROTECTED]> writes: Please send a reference to Gunter's paper. I did: @article{570734, author = {G\"{u}nter Rote}, title = {Division-free algorithms for the determinant and the Pfaffian: algebraic and combinatorial approaches}, book

[Axiom-developer] Re: Copyright notice Re: pfaffian.input.pamphlet

root <[EMAIL PROTECTED]> writes: > I hope to merge it into the SQMATRIX domain, since it requires the matrices > to be square. It looks like I can use the antisymmetric function to replace > some of your code. I do not know of such a function. However, you can use antiSymmetric? to check whether

[Axiom-developer] Re: Copyright notice Re: pfaffian.input.pamphlet

>> The point of the game is to make the code live beyond the original >> author. Otherwise, what is science for? > >Maybe for you. I just needed a Pfaffian to do some experiments, and couldn't >find an implementation. So I looked for an algorithm I thought I was able to >implement. If you can us

[Axiom-developer] Re: Copyright notice Re: pfaffian.input.pamphlet

root <[EMAIL PROTECTED]> writes: > In total number of characters and time, the source text TeX, the regression > test case generation, the system merge issues, the testing and the patch > generation exceed the number of characters posted in the algorithm. Characters maybe, time I doubt. It took

[Axiom-developer] Re: Copyright notice Re: pfaffian.input.pamphlet

>Finally, if I read > >\author{Timothy Daly, Gunter Rote, Martin Rubey} > >(it's Günter, by the way) I'd think that the three of them implemented the >algorithm, but that's maybe only my personal view. And I must say that I was a >bit surprised that you claim copyright for pasting text from wikip

[Axiom-developer] Re: Copyright notice Re: pfaffian.input.pamphlet

root <[EMAIL PROTECTED]> writes: > Please send a reference to Gunter's paper. I did: @article{570734, author = {G\"{u}nter Rote}, title = {Division-free algorithms for the determinant and the Pfaffian: algebraic and combinatorial approaches}, book = {Computational Discrete Mathematics: advanc

[Axiom-developer] Re: Copyright notice Re: pfaffian.input.pamphlet

Please send a reference to Gunter's paper. Please post a plain-text latex for the way you expect Gunter's name to be spelled. All of my mail readers render it with a 'u'. Please document your algorithm. Tim ___ Axiom-developer mailing list Axiom-develo

[Axiom-developer] Re: [Axiom-legal] Re: Copyright notice Re: pfaffian.input.pamphlet

root wrote: >> I just realised that you are possibly breaking Copyright in your pamphlet. >> See >> > > Ok. I'll withdraw the change and see if I can understand what it takes to > be in compliance. I read the lic

[Axiom-developer] Re: Copyright notice Re: pfaffian.input.pamphlet

root <[EMAIL PROTECTED]> writes: > > I just realised that you are possibly breaking Copyright in your pamphlet. > > See > > > > Ok. I'll withdraw the change and see if I can understand what it takes to > be in c

[Axiom-developer] 20070929.01.tpd.patch

This change removes pfaffian.input.pamphlet. === diff --git a/changelog b/changelog index c254ce6..6c10a71 100644 --- a/changelog +++ b/changelog @@ -1,3 +1,5 @@ +20070929 tpd src/input/Makefile pfaffian regression test removed

[Axiom-developer] Re: Copyright notice Re: pfaffian.input.pamphlet

> I just realised that you are possibly breaking Copyright in your pamphlet. > See > Ok. I'll withdraw the change and see if I can understand what it takes to be in compliance. I read the license over once and I'

Re: [Axiom-developer] End Of File

Alfredo, READ-CHAR-NO-HANG is looked for the EOF (end of file) marker. However, the read to the socket always returns a zero length string so read-char-no-hang returns that string and the loop will never terminate. The problem is that the socket is not working properly. We need to debug this. Ti

[Axiom-developer] Copyright notice Re: pfaffian.input.pamphlet

Dear Tim, I just realised that you are possibly breaking Copyright in your pamphlet. See http://en.wikipedia.org/wiki/Wikipedia:Text_of_the_GNU_Free_Documentation_License Martin ___ Axiom-developer mailing list Axiom-developer@nongnu.org http://

[Axiom-developer] End Of File

Hi everyone, I think Arthur was going to be offline for a couple days. Can somebody translate this line for me: while (char := STRING(READ_-CHAR_-NO_-HANG(s,NIL$Lisp,'EOF)$Lisp)$Lisp) ^= "EOF" repeat headers := concat [headers,char] Better said, what does this do: READ_-CHAR_-NO_-H

[Axiom-developer] (no subject)

Good day, If you are interested in starting your own hosting company, please email us. We can setup the whole company for you for only ZAR 100.00 (USD15.38). This includes all the fees. After you have paid the setup of ZAR 100.00 you will never have to pay us any fees again. So you keep 100% of