You can subscribe to this list here.
2009 
_{Jan}
(2) 
_{Feb}
(5) 
_{Mar}

_{Apr}

_{May}
(2) 
_{Jun}
(8) 
_{Jul}
(4) 
_{Aug}

_{Sep}

_{Oct}
(2) 
_{Nov}
(6) 
_{Dec}


2010 
_{Jan}
(1) 
_{Feb}
(1) 
_{Mar}
(3) 
_{Apr}
(2) 
_{May}
(2) 
_{Jun}
(2) 
_{Jul}
(18) 
_{Aug}
(13) 
_{Sep}
(7) 
_{Oct}

_{Nov}

_{Dec}
(2) 
2011 
_{Jan}

_{Feb}
(11) 
_{Mar}

_{Apr}
(4) 
_{May}

_{Jun}
(1) 
_{Jul}
(18) 
_{Aug}
(16) 
_{Sep}
(12) 
_{Oct}
(12) 
_{Nov}
(19) 
_{Dec}
(42) 
2012 
_{Jan}
(16) 
_{Feb}
(3) 
_{Mar}
(8) 
_{Apr}
(14) 
_{May}
(30) 
_{Jun}
(5) 
_{Jul}
(7) 
_{Aug}
(3) 
_{Sep}
(10) 
_{Oct}
(4) 
_{Nov}
(10) 
_{Dec}
(1) 
2013 
_{Jan}
(14) 
_{Feb}
(8) 
_{Mar}
(5) 
_{Apr}
(3) 
_{May}
(9) 
_{Jun}
(19) 
_{Jul}

_{Aug}
(27) 
_{Sep}
(5) 
_{Oct}
(18) 
_{Nov}
(12) 
_{Dec}
(8) 
2014 
_{Jan}
(5) 
_{Feb}
(8) 
_{Mar}
(20) 
_{Apr}
(22) 
_{May}
(28) 
_{Jun}
(9) 
_{Jul}
(6) 
_{Aug}
(46) 
_{Sep}
(40) 
_{Oct}
(15) 
_{Nov}
(8) 
_{Dec}
(34) 
2015 
_{Jan}
(20) 
_{Feb}
(15) 
_{Mar}
(18) 
_{Apr}
(20) 
_{May}
(3) 
_{Jun}
(13) 
_{Jul}
(10) 
_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}

S  M  T  W  T  F  S 





1
(8) 
2

3

4

5

6
(3) 
7
(2) 
8

9

10
(1) 
11

12
(2) 
13
(2) 
14
(2) 
15
(1) 
16
(1) 
17
(1) 
18
(1) 
19

20

21
(2) 
22
(1) 
23

24

25

26

27

28

29

30

31

From: abpetrov <abpetrov@uf...>  20130822 17:14:29

Thank you very much for your detailed answer. Best regards, Petrov Alexander. 21.08.2013 19:31, Arthur Norman пишет: > On Thu, 22 Aug 2013, abpetrov wrote: >> Hi, >> I got some expression in Reduce as result of calculations. When I try to >> scroll >> window Reduce with result to view all members of result I see next >> picture. >> Some brackets, indexes disappears. After scrolling up and down I see >> among >> sum's members message >> >> malformed expression >> >> And in the console appears strings like >> >> Unrecognized keyword "\righ" >> "{" expected after keyword "\mathrm" >> "}" not found >> and etc. >> >> If I repeat up and down scrolling many times (~5) Reduce exit with >> messages >> >> FXTerminal::replaceStyledText: bad argument range. >> emergency stop (this my translation from Russian) >> >> Previous version Reduce in Gentoo has not that mistake. >> Current version works fine with option off nat. > .... >> >> Best regards, Petrov Alexander. >> > > I have just got back from a trip. I see a load of interesting reports > from you that came in while I was away, many of which have been > addressed by others but some are down to me  as this one probably is. > > The "fancy" maths display code in the CWSL version of Reduce works by > first outputting expressions in TeXlike format using the code (that > did not origininate with me, but that at times I have hacked at) in > tmprint/tmprint.red. If that code messes up and somehow splits the > text "\right" as "\righ" "t" (it tries to avoid linelengthrelated > issues but who know...) or if some buffering of its output messes that > up it is a shambles. The output goes into my code probably in > csl/fox/src/FXShowMath.cpp that parses the TeX and tries to display > it. I have various limits on the size of buffers I provide there so > big expressions may overflow them and lead to the TeX ending up > truncated and hence messed up. As may be reasonably general with TeX > the issue of breaking lines for big expressions is a bit horrid. > > So I PROBABLY believe that the fancymode maths stuff is a real > benefit for people doing computations where the results fit on one > page. but I probably have dounts about displays of dozens of pages of > displayed maths and the code (as you observe) can sometimes be > fragile, so I would be happy for users who are doing BIG sums to use > "off fancy;" to go back to the oldstyle diaplsy format that is much > better inservice tested, or as you say even "off nat;" that does not > mess around trying to display exponents on the line above. > > Again referring back to something you mentiomned earlier, the current > CSL version uses the FOX GUI toolkit to let me manage the display. > This supports Windows and X11 comfortably, and the maths display code > is something I added to my copy of the library (because I could not > see neat enough hooks to let my code be fully separate are merely a > user of the library). But FOX does not provide native support for the > Mac and I got moans from some Mac users that using X11 there is > considered shameful. Hence my start at an interface using wxWidgets! > That was also to be an opportunity to replan and reimplement a > second version of the interface code that might end up more robust  > or at least where I had a better idea of where I was aiming when I > started. As you will have observed that is not complete code, and > among other things that maths display is not present (but see my demo > app wxdvi.cpp). Help from anybody who reads this list in getting the > wxWidgets version of stuff complete and robust with a decent design > for maths I/O would be most welcome. I find it quite uphill effort and > certainly without encouragement not a lot will happen in a hurry... > Are there any volunteers or enthusiasts out there? > > Arthur > 
From: Arthur Norman <acn1@ca...>  20130821 19:32:00

On Thu, 22 Aug 2013, abpetrov wrote: > Hi, > I got some expression in Reduce as result of calculations. When I try to > scroll > window Reduce with result to view all members of result I see next picture. > Some brackets, indexes disappears. After scrolling up and down I see among > sum's members message > > malformed expression > > And in the console appears strings like > > Unrecognized keyword "\righ" > "{" expected after keyword "\mathrm" > "}" not found > and etc. > > If I repeat up and down scrolling many times (~5) Reduce exit with messages > > FXTerminal::replaceStyledText: bad argument range. > emergency stop (this my translation from Russian) > > Previous version Reduce in Gentoo has not that mistake. > Current version works fine with option off nat. .... > > Best regards, Petrov Alexander. > I have just got back from a trip. I see a load of interesting reports from you that came in while I was away, many of which have been addressed by others but some are down to me  as this one probably is. The "fancy" maths display code in the CWSL version of Reduce works by first outputting expressions in TeXlike format using the code (that did not origininate with me, but that at times I have hacked at) in tmprint/tmprint.red. If that code messes up and somehow splits the text "\right" as "\righ" "t" (it tries to avoid linelengthrelated issues but who know...) or if some buffering of its output messes that up it is a shambles. The output goes into my code probably in csl/fox/src/FXShowMath.cpp that parses the TeX and tries to display it. I have various limits on the size of buffers I provide there so big expressions may overflow them and lead to the TeX ending up truncated and hence messed up. As may be reasonably general with TeX the issue of breaking lines for big expressions is a bit horrid. So I PROBABLY believe that the fancymode maths stuff is a real benefit for people doing computations where the results fit on one page. but I probably have dounts about displays of dozens of pages of displayed maths and the code (as you observe) can sometimes be fragile, so I would be happy for users who are doing BIG sums to use "off fancy;" to go back to the oldstyle diaplsy format that is much better inservice tested, or as you say even "off nat;" that does not mess around trying to display exponents on the line above. Again referring back to something you mentiomned earlier, the current CSL version uses the FOX GUI toolkit to let me manage the display. This supports Windows and X11 comfortably, and the maths display code is something I added to my copy of the library (because I could not see neat enough hooks to let my code be fully separate are merely a user of the library). But FOX does not provide native support for the Mac and I got moans from some Mac users that using X11 there is considered shameful. Hence my start at an interface using wxWidgets! That was also to be an opportunity to replan and reimplement a second version of the interface code that might end up more robust  or at least where I had a better idea of where I was aiming when I started. As you will have observed that is not complete code, and among other things that maths display is not present (but see my demo app wxdvi.cpp). Help from anybody who reads this list in getting the wxWidgets version of stuff complete and robust with a decent design for maths I/O would be most welcome. I find it quite uphill effort and certainly without encouragement not a lot will happen in a hurry... Are there any volunteers or enthusiasts out there? Arthur 
From: abpetrov <abpetrov@uf...>  20130821 18:15:00

Hi, I got some expression in Reduce as result of calculations. When I try to scroll window Reduce with result to view all members of result I see next picture. Some brackets, indexes disappears. After scrolling up and down I see among sum's members message malformed expression And in the console appears strings like Unrecognized keyword "\righ" "{" expected after keyword "\mathrm" "}" not found and etc. If I repeat up and down scrolling many times (~5) Reduce exit with messages FXTerminal::replaceStyledText: bad argument range. emergency stop (this my translation from Russian) Previous version Reduce in Gentoo has not that mistake. Current version works fine with option off nat. Below is program with that behaviour: off lower$ load_package noncom2; operator a2,a2c; noncom a2,a2; noncom a2c,a2c; noncom a2,a2c; operator U,UC,V,VC, Delta, InvDelta; H := 2*B*a2(j1)*Delta(i1  j2)*V(i,j2)*VC(i,j1)  2*B*a2(j2)* Delta(i1  j1)*U(i,j2)*UC(i,j1) + 2*B*a2(j2)*a2(j1)*a2(i1)*InvDelta(i1  j1)* InvDelta(i1  j2)*InvDelta(j1  j2)*U(i,j2)*VC(i,j1)  2*B*a2(j2)*a2(j1)*a2(i1)* InvDelta(j1  j2)*U(i,j2)*VC(i,j1) + 2*B*a2c(j1)*Delta(i1  j2)*InvDelta(j1  j2 )*UC(i,j1)*V(i,j2)  2*B*a2c(j1)*a2(j2)*a2(i1)*InvDelta(i1  j2)*U(i,j2)*UC(i,j1 ) + 2*B*a2c(j1)*a2(j2)*a2(i1)*U(i,j2)*UC(i,j1)  2*B*a2c(j2)*Delta(i1  j1)* InvDelta(j1  j2)*UC(i,j1)*V(i,j2) + 2*B*a2c(j2)*a2(j1)*a2(i1)*InvDelta(i1  j1) *V(i,j2)*VC(i,j1)  2*B*a2c(j2)*a2(j1)*a2(i1)*V(i,j2)*VC(i,j1)  J1*a2(j1)*Delta (i1  j2)*V(i + 1,j2)*VC(i,j1)  J1*a2(j1)*Delta(i1  j2)*V(i,j2)*VC(i + 1,j1) + J1*a2(j2)*Delta(i1  j1)*U(i + 1,j2)*UC(i,j1) + J1*a2(j2)*Delta(i1  j1)*U(i,j2 )*UC(i + 1,j1)  J1*a2(j2)*a2(j1)*a2(i1)*InvDelta(i1  j1)*InvDelta(i1  j2)* InvDelta(j1  j2)*U(i + 1,j2)*VC(i,j1)  J1*a2(j2)*a2(j1)*a2(i1)*InvDelta(i1  j1)*InvDelta(i1  j2)*InvDelta(j1  j2)*U(i,j2)*VC(i + 1,j1) + J1*a2(j2)*a2(j1)* a2(i1)*InvDelta(j1  j2)*U(i + 1,j2)*VC(i,j1) + J1*a2(j2)*a2(j1)*a2(i1)*InvDelta (j1  j2)*U(i,j2)*VC(i + 1,j1)  J1*a2c(j1)*Delta(i1  j2)*InvDelta(j1  j2)*UC( i + 1,j1)*V(i,j2)  J1*a2c(j1)*Delta(i1  j2)*InvDelta(j1  j2)*UC(i,j1)*V(i + 1 ,j2) + J1*a2c(j1)*a2(j2)*a2(i1)*InvDelta(i1  j2)*U(i + 1,j2)*UC(i,j1) + J1*a2c( j1)*a2(j2)*a2(i1)*InvDelta(i1  j2)*U(i,j2)*UC(i + 1,j1)  J1*a2c(j1)*a2(j2)*a2( i1)*U(i + 1,j2)*UC(i,j1)  J1*a2c(j1)*a2(j2)*a2(i1)*U(i,j2)*UC(i + 1,j1) + J1* a2c(j2)*Delta(i1  j1)*InvDelta(j1  j2)*UC(i + 1,j1)*V(i,j2) + J1*a2c(j2)*Delta (i1  j1)*InvDelta(j1  j2)*UC(i,j1)*V(i + 1,j2)  J1*a2c(j2)*a2(j1)*a2(i1)* InvDelta(i1  j1)*V(i + 1,j2)*VC(i,j1)  J1*a2c(j2)*a2(j1)*a2(i1)*InvDelta(i1  j1)*V(i,j2)*VC(i + 1,j1) + J1*a2c(j2)*a2(j1)*a2(i1)*V(i + 1,j2)*VC(i,j1) + J1* a2c(j2)*a2(j1)*a2(i1)*V(i,j2)*VC(i + 1,j1) + J2*a2(j1)*Delta(i1  j2)*U(i + 1,j1 )*V(i,j2)  J2*a2(j1)*Delta(i1  j2)*UC(i,j2)*VC(i + 1,j1)  J2*a2(j2)*Delta(i1  j1)*U(i,j2)*V(i + 1,j1) + J2*a2(j2)*Delta(i1  j1)*UC(i + 1,j1)*VC(i,j2) + J2* a2(j2)*a2(j1)*a2(i1)*InvDelta(i1  j1)*InvDelta(i1  j2)*InvDelta(j1  j2)*U(i, j2)*U(i + 1,j1)  J2*a2(j2)*a2(j1)*a2(i1)*InvDelta(i1  j1)*InvDelta(i1  j2)* InvDelta(j1  j2)*VC(i,j2)*VC(i + 1,j1)  J2*a2(j2)*a2(j1)*a2(i1)*InvDelta(j1  j2)*U(i,j2)*U(i + 1,j1) + J2*a2(j2)*a2(j1)*a2(i1)*InvDelta(j1  j2)*VC(i,j2)*VC( i + 1,j1)  J2*a2c(j1)*Delta(i1  j2)*InvDelta(j1  j2)*UC(i,j2)*UC(i + 1,j1) + J2*a2c(j1)*Delta(i1  j2)*InvDelta(j1  j2)*V(i,j2)*V(i + 1,j1)  J2*a2c(j1)*a2( j2)*a2(i1)*InvDelta(i1  j2)*U(i,j2)*V(i + 1,j1) + J2*a2c(j1)*a2(j2)*a2(i1)* InvDelta(i1  j2)*UC(i + 1,j1)*VC(i,j2) + J2*a2c(j1)*a2(j2)*a2(i1)*U(i,j2)*V(i + 1,j1)  J2*a2c(j1)*a2(j2)*a2(i1)*UC(i + 1,j1)*VC(i,j2) + J2*a2c(j2)*Delta(i1  j1)*InvDelta(j1  j2)*UC(i,j2)*UC(i + 1,j1)  J2*a2c(j2)*Delta(i1  j1)*InvDelta (j1  j2)*V(i,j2)*V(i + 1,j1) + J2*a2c(j2)*a2(j1)*a2(i1)*InvDelta(i1  j1)*U(i + 1,j1)*V(i,j2)  J2*a2c(j2)*a2(j1)*a2(i1)*InvDelta(i1  j1)*UC(i,j2)*VC(i + 1,j1 )  J2*a2c(j2)*a2(j1)*a2(i1)*U(i + 1,j1)*V(i,j2) + J2*a2c(j2)*a2(j1)*a2(i1)*UC(i ,j2)*VC(i + 1,j1); end; Best regards, Petrov Alexander. 
From: abpetrov <abpetrov@uf...>  20130818 15:29:25

Now it works. Dissapearing sum's members is absents. Link for svn I got from the page http://reducealgebra.com/downloading.htm Thank you. Best regards, Petrov Alexander. 17.08.2013 09:13, Rainer Schöpf пишет: > On Sat, 17 Aug 2013 at 13:09 0000, abpetrov wrote: > > > Hello, > > Nothing changed. But I am not sure that, may be I got another repository? > > I saw directory trunk. As I can see, old file scripts/findos.sh is in > > repository without Gentoo, but it must be here according to our > > correspondence. > > I got repository according documentation with command > > > > svn co https://reducealgebra.svn.sourceforge.net/svnroot/reducealgebra reducealgebra > > This is an old repository. sourceforge.net changed repositories a while ago, > but didn't remove the old one. > > Where did you find this URL? > > The correct one is shown on the REDUCE download page > > http://reducealgebra.sourceforge.net/downloading.html > > It is > > svn checkout http://svn.code.sf.net/p/reducealgebra/code/trunk reducealgebra > > Rainer > 
From: Rainer Schöpf <rainer.schoepf@gm...>  20130817 09:13:18

On Sat, 17 Aug 2013 at 13:09 0000, abpetrov wrote: > Hello, > Nothing changed. But I am not sure that, may be I got another repository? > I saw directory trunk. As I can see, old file scripts/findos.sh is in > repository without Gentoo, but it must be here according to our > correspondence. > I got repository according documentation with command > > svn co https://reducealgebra.svn.sourceforge.net/svnroot/reducealgebra reducealgebra This is an old repository. sourceforge.net changed repositories a while ago, but didn't remove the old one. Where did you find this URL? The correct one is shown on the REDUCE download page http://reducealgebra.sourceforge.net/downloading.html It is svn checkout http://svn.code.sf.net/p/reducealgebra/code/trunk reducealgebra Rainer 
From: Rainer Schöpf <rainer.schoepf@gm...>  20130816 20:56:22

Hello, I believe I have corrected the error in the subversion repository. Please update your working copy and rebuild. Rainer 
From: abpetrov <abpetrov@uf...>  20130815 07:50:36

thank you 14.08.2013 18:28, Rainer Schöpf пишет: > Hello, > > I had a quick look on your problem. > > First of all, it does not occur when you remove the line > > off lower$ > > It seems to me that the error comes from the noncom2 package. This package was > written 20 years ago for Reduce 3.3, and redefines some of the inner parts of > Reduce. In particular, it changes the internal ordering of expressions, which > doesn't work well with the current version. > > I'll look at this in the next few days. > > > Rainer > 
From: richard noel fell <fell@br...>  20130814 21:22:20

Does anyone know if it is possible to have vectors and indices, both in the context of the high energy package, local to a procedure such as one can do with scalars as in: procedure test begin scalar a,b; vector p; index mu; more stuff; end; a and b are local but the vector and index properties of p and mu propagate outside of the procedure. This is what I would like to inhibit and would be most grateful for suggestions. I should mention that in the example above p and mu cannot be members of a parameter list. Many thank, Dick Fell  Richard Noel Fell Fisher School of Physics Brandeis University Waltham, Ma 02454 fell@... JMJ 
From: Rainer Schöpf <rainer.schoepf@gm...>  20130814 18:28:13

Hello, I had a quick look on your problem. First of all, it does not occur when you remove the line off lower$ It seems to me that the error comes from the noncom2 package. This package was written 20 years ago for Reduce 3.3, and redefines some of the inner parts of Reduce. In particular, it changes the internal ordering of expressions, which doesn't work well with the current version. I'll look at this in the next few days. Rainer 
From: Arthur Norman <acn1@ca...>  20130813 22:26:14

I am away from home (thus email is from the rainforest!) so I willreply properly in a bit over a week when I get home. But wxwidgets needs the version included with Reduce which is a patched 2.9 not a standard anythig so try just withwx Arthur On Mon, 12 Aug 2013, abpetrov wrote: > 10.08.2013 16:16, abpetrov пишет: >> Hi, >> >> I have made attempt to build Reduce with wxWidget library. >> I used command >> >> ./configure withcsl withwx=/usr/include/wx2.8 >> >> to configure sources. But I got error message >> >> configure: error: withfox=default and withwx=/usr/include/wx2.8 >> inconsistent here >> >> How can I switch off Fox library and build with wxWidget? >> >> >> Best regards, Petrov Alexander. >> >>  >> Get 100% visibility into Java/.NET code with AppDynamics Lite! >> It's a free troubleshooting tool designed for production. >> Get down to codelevel detail for bottlenecks, with <2% overhead. >> Download for free and get started troubleshooting in minutes. >> http://pubads.g.doubleclick.net/gampad/clk?id=48897031&iu=/4140/ostg.clktrk >> _______________________________________________ >> Reducealgebradevelopers mailing list >> Reducealgebradevelopers@... >> https://lists.sourceforge.net/lists/listinfo/reducealgebradevelopers >> > I am sorry, for configuration command > ./configure withcsl withwx > > build works fine. > >  > Get 100% visibility into Java/.NET code with AppDynamics Lite! > It's a free troubleshooting tool designed for production. > Get down to codelevel detail for bottlenecks, with <2% overhead. > Download for free and get started troubleshooting in minutes. > http://pubads.g.doubleclick.net/gampad/clk?id=48897031&iu=/4140/ostg.clktrk > _______________________________________________ > Reducealgebradevelopers mailing list > Reducealgebradevelopers@... > https://lists.sourceforge.net/lists/listinfo/reducealgebradevelopers 
From: abpetrov <abpetrov@uf...>  20130813 15:57:08

> Hi, > I just have tried make linear transformation for fermi operators. > But after such transformation result has strange property. > When I set switch factor on some sum's members dissapears. > When I set switch factor off they appears again. I suppose this is a bad > thing because in many situations it can lead to illegal interpretation > calculation results. > So, questions is > 1) Why dissapears some sum's members > 2) How can I avoid that situations? > I can add, that when I made new fermi operators a2 and a2c (see below) > as commutative variables they don't disappears. > The program with noncommutative variables below. > In program I have fermi operators a,ac with rules and > a2 and a2c with rules. After that I defined operator H, > in which I made linear transformation. > Last two outputs of operator H2 is different because of switch > factor on. > > > off lower$ > on intstr$ > > load_package noncom2; > > operator a,ac; > noncom a,a; > noncom ac,ac; > noncom a,ac; > > for all i let a(i)*ac(i) = 1  ac(i)*a(i); > for all i,j such that i neq j let a(i)*ac(j) = ac(j)*a(i); > for all i,j such that ordp(i,j) let a(i)*a(j) = a(j)*a(i); > for all i,j such that ordp(i,j) let ac(i)*ac(j) = ac(j)*ac(i); > > operator a2,a2c; > noncom a2,a2; > noncom a2c,a2c; > noncom a2,a2c; > > for all i let a2(i)*a2c(i) = 1  a2c(i)*a2(i); > for all i,j such that i neq j let a2(i)*a2c(j) = a2c(j)*a2(i); > for all i,j such that ordp(i,j) let a2(i)*a2(j) = a2(j)*a2(i); > for all i,j such that ordp(i,j) let a2c(i)*a2c(j) = a2c(j)*a2c(i); > > > operator H; > H := J1*ac(i)*a(i+1) + J1*ac(i+1)*a(i); > > operator U,UT,V,VT; > > sub_fermi := { a(~i) => U(i,j1)*a2(j1) + V(i,j1)*a2c(j1), > ac(~i) => VT(i,j2)*a2(j2) + UT(i,j2)*a2c(j2) }; > H2 := (H where sub_fermi); > on factor; > H2; > > > Best regards, Petrov Alexander > >  > Get 100% visibility into Java/.NET code with AppDynamics Lite! > It's a free troubleshooting tool designed for production. > Get down to codelevel detail for bottlenecks, with <2% overhead. > Download for free and get started troubleshooting in minutes. > http://pubads.g.doubleclick.net/gampad/clk?id=48897031&iu=/4140/ostg.clktrk > _______________________________________________ > Reducealgebradevelopers mailing list > Reducealgebradevelopers@... > https://lists.sourceforge.net/lists/listinfo/reducealgebradevelopers > I just have rewritten result for H2 as input expression and switched on factor. Result same as in prior program. So, linear transformaition hasn't relation to that behaviour of Reduce. Possible, something wrong with noncommutative operators or with on factor working with noncommutative operators. The new program, which show different view H2 depending from factor switch is: off lower$ load_package noncom2; operator a2,a2c; noncom a2,a2; noncom a2c,a2c; noncom a2,a2c; operator U,UT,V,VT; H2 := J1*(U(i + 1,j1)*UT(i,j2)*a2c(j2)*a2(j1) + U(i + 1,j1)*VT(i,j2)*a2(j2)*a2(j1) + U (i,j1)*UT(i + 1,j2)*a2c(j2)*a2(j1) + U(i,j1)*VT(i + 1,j2)*a2(j2)*a2(j1) + UT(i + 1,j2)*V(i,j1)*a2c(j2)*a2c(j1) + UT(i,j2)*V(i + 1,j1)*a2c(j2)*a2c(j1)  V(i + 1, j1)*VT(i,j2)*a2c(j1)*a2(j2)  V(i,j1)*VT(i + 1,j2)*a2c(j1)*a2(j2)); on factor; H2; Where is 4 first summand? Best regards, Petrov Alexander 
From: abpetrov <abpetrov@uf...>  20130812 16:28:32

Hi, I just have tried make linear transformation for fermi operators. But after such transformation result has strange property. When I set switch factor on some sum's members dissapears. When I set switch factor off they appears again. I suppose this is a bad thing because in many situations it can lead to illegal interpretation calculation results. So, questions is 1) Why dissapears some sum's members 2) How can I avoid that situations? I can add, that when I made new fermi operators a2 and a2c (see below) as commutative variables they don't disappears. The program with noncommutative variables below. In program I have fermi operators a,ac with rules and a2 and a2c with rules. After that I defined operator H, in which I made linear transformation. Last two outputs of operator H2 is different because of switch factor on. off lower$ on intstr$ load_package noncom2; operator a,ac; noncom a,a; noncom ac,ac; noncom a,ac; for all i let a(i)*ac(i) = 1  ac(i)*a(i); for all i,j such that i neq j let a(i)*ac(j) = ac(j)*a(i); for all i,j such that ordp(i,j) let a(i)*a(j) = a(j)*a(i); for all i,j such that ordp(i,j) let ac(i)*ac(j) = ac(j)*ac(i); operator a2,a2c; noncom a2,a2; noncom a2c,a2c; noncom a2,a2c; for all i let a2(i)*a2c(i) = 1  a2c(i)*a2(i); for all i,j such that i neq j let a2(i)*a2c(j) = a2c(j)*a2(i); for all i,j such that ordp(i,j) let a2(i)*a2(j) = a2(j)*a2(i); for all i,j such that ordp(i,j) let a2c(i)*a2c(j) = a2c(j)*a2c(i); operator H; H := J1*ac(i)*a(i+1) + J1*ac(i+1)*a(i); operator U,UT,V,VT; sub_fermi := { a(~i) => U(i,j1)*a2(j1) + V(i,j1)*a2c(j1), ac(~i) => VT(i,j2)*a2(j2) + UT(i,j2)*a2c(j2) }; H2 := (H where sub_fermi); on factor; H2; Best regards, Petrov Alexander 
From: abpetrov <abpetrov@uf...>  20130812 11:47:58

10.08.2013 16:16, abpetrov пишет: > Hi, > > I have made attempt to build Reduce with wxWidget library. > I used command > > ./configure withcsl withwx=/usr/include/wx2.8 > > to configure sources. But I got error message > > configure: error: withfox=default and withwx=/usr/include/wx2.8 > inconsistent here > > How can I switch off Fox library and build with wxWidget? > > > Best regards, Petrov Alexander. > >  > Get 100% visibility into Java/.NET code with AppDynamics Lite! > It's a free troubleshooting tool designed for production. > Get down to codelevel detail for bottlenecks, with <2% overhead. > Download for free and get started troubleshooting in minutes. > http://pubads.g.doubleclick.net/gampad/clk?id=48897031&iu=/4140/ostg.clktrk > _______________________________________________ > Reducealgebradevelopers mailing list > Reducealgebradevelopers@... > https://lists.sourceforge.net/lists/listinfo/reducealgebradevelopers > I am sorry, for configuration command ./configure withcsl withwx build works fine. 
From: abpetrov <abpetrov@uf...>  20130810 10:16:56

Hi, I have made attempt to build Reduce with wxWidget library. I used command ./configure withcsl withwx=/usr/include/wx2.8 to configure sources. But I got error message configure: error: withfox=default and withwx=/usr/include/wx2.8 inconsistent here How can I switch off Fox library and build with wxWidget? Best regards, Petrov Alexander. 
From: Rainer Schöpf <rainer.schoepf@gm...>  20130807 17:12:42

On Tue, 6 Aug 2013 at 14:22 0000, abpetrov wrote: > I have Gentoo as OS at my personal computer, > and I installed Reduce from portage, as it requires > Gentoo rules. This work fine. > But for better learning Redduce I got copy > from subversion and try to build local executable file, > not installed in my system. And I got error message > > unknown system > > I found that this message goes from file scripts/findos.sh > where branch for Gentoo is absent. I added this branch to it > and here included corresponding patch file. Thanks, I added gentoo to the list of vendors in the findos.sh file. Rainer 
From: abpetrov <abpetrov@uf...>  20130807 02:53:18

06.08.2013 22:34, Rainer Schöpf пишет: > On Tue, 6 Aug 2013 at 14:32 0000, abpetrov wrote: > > > > > Hi, > > > > I tried to define rules for working with fermi operators. Here is > > the corresponding program: > > > > load_package noncom2; > > > > operator a,ac; > > noncom a,a; > > noncom ac,ac; > > noncom a,ac; > > > > for all i let a(i)*ac(i) = 1  ac(i)*a(i); > > for all i,j such that i neq j let a(i)*ac(j) = ac(j)*a(i); > > for all i,j let a(i)*a(j) = a(j)*a(i); > > for all i,j let aс(i)*aс(j) = aс(j)*aс(i); > > > > operator anticom; > > for all x,y let anticom(x,y) = x*y + y*x; > > > > > > But when I make attempt calculate an anticommutator like > > > > anticom( ac(i)*a(j), a(k)); > > > > I got error message > > > > Segmentation fault > > > > What is wrong in my rules? > > Your rules cause an infinite recursion. For example, > > a(i)*a(j) => a(j)*a(i) =>  (a(i)*a(j)) => ((a(j)*a(i) )) .... > > One possiblity to apply the rule only once is to depend on the order of the > variables: > > for all i,j such that ordp(i,j) let a(i)*a(j) = a(j)*a(i); > for all i,j such that ordp(i,j) let aс(i)*aс(j) = aс(j)*aс(i); > > Regards, > Rainer thank you 
From: Rainer Schöpf <rainer.schoepf@gm...>  20130806 22:34:50

On Tue, 6 Aug 2013 at 14:32 0000, abpetrov wrote: > > Hi, > > I tried to define rules for working with fermi operators. Here is > the corresponding program: > > load_package noncom2; > > operator a,ac; > noncom a,a; > noncom ac,ac; > noncom a,ac; > > for all i let a(i)*ac(i) = 1  ac(i)*a(i); > for all i,j such that i neq j let a(i)*ac(j) = ac(j)*a(i); > for all i,j let a(i)*a(j) = a(j)*a(i); > for all i,j let aс(i)*aс(j) = aс(j)*aс(i); > > operator anticom; > for all x,y let anticom(x,y) = x*y + y*x; > > > But when I make attempt calculate an anticommutator like > > anticom( ac(i)*a(j), a(k)); > > I got error message > > Segmentation fault > > What is wrong in my rules? Your rules cause an infinite recursion. For example, a(i)*a(j) => a(j)*a(i) =>  (a(i)*a(j)) => ((a(j)*a(i) )) .... One possiblity to apply the rule only once is to depend on the order of the variables: for all i,j such that ordp(i,j) let a(i)*a(j) = a(j)*a(i); for all i,j such that ordp(i,j) let aс(i)*aс(j) = aс(j)*aс(i); Regards, Rainer 
From: abpetrov <abpetrov@uf...>  20130806 08:32:50

Hi, I tried to define rules for working with fermi operators. Here is the corresponding program: load_package noncom2; operator a,ac; noncom a,a; noncom ac,ac; noncom a,ac; for all i let a(i)*ac(i) = 1  ac(i)*a(i); for all i,j such that i neq j let a(i)*ac(j) = ac(j)*a(i); for all i,j let a(i)*a(j) = a(j)*a(i); for all i,j let aс(i)*aс(j) = aс(j)*aс(i); operator anticom; for all x,y let anticom(x,y) = x*y + y*x; But when I make attempt calculate an anticommutator like anticom( ac(i)*a(j), a(k)); I got error message Segmentation fault What is wrong in my rules? Best regards, Petrov Alexander. 
From: abpetrov <abpetrov@uf...>  20130806 08:22:20

Hi, I have Gentoo as OS at my personal computer, and I installed Reduce from portage, as it requires Gentoo rules. This work fine. But for better learning Redduce I got copy from subversion and try to build local executable file, not installed in my system. And I got error message unknown system I found that this message goes from file scripts/findos.sh where branch for Gentoo is absent. I added this branch to it and here included corresponding patch file. Best regards, Petrov Alexander. 
From: Rainer Schöpf <rainer.schoepf@gm...>  20130801 20:18:17

On Thu, 1 Aug 2013 at 20:05 0000, abpetrov wrote: > I made attempt with program > > load_package pm; > operator f1; > s(f1(x) + f1(y),f1(?x) + f1(?y)−>f1(x+y)); > > And then I got next error message > > ***** (? y) invalid as operator It took me a while to understand the problem: you are using a nonASCII character (Unicode \u2212) instead of a minus sign in ">". If you use the minus sign it works. Rainer 
From: Francis Wright <f.wright@li...>  20130801 18:13:04

trigsimp(cos(x)*tan(x)); works for me. Francis From: tk [mailto:tk@...] Sent: 01 August 2013 5:31 pm To: reducealgebradevelopers@... Subject: [Reducealgebradevelopers] Trig Simplifications / Reductions Hello All, I have been trying to work out if two trig expressions are equivalent. After getting tired of trying it manually, it crossed my mind that REDUCE might be able to help here. But even after switching on "trigsimp", the output is still not reduced to its simplest form, i.e. if I enter : a = Cos(x)*Tan(x) I will not get an output line of : a = Sin(x). What do I need to do here to rationalise sums of long trig quotients ? Kind Regards, TK.  Die Sonne scheint noch.  Sophie Scholl (19211943). 
From: tk <tk@br...>  20130801 16:46:39

Hello All, I have been trying to work out if two trig expressions are equivalent. After getting tired of trying it manually, it crossed my mind that REDUCE might be able to help here. But even after switching on "trigsimp", the output is still not reduced to its simplest form, i.e. if I enter : a = Cos(x)*Tan(x) I will not get an output line of : a = Sin(x). What do I need to do here to rationalise sums of long trig quotients ? Kind Regards, TK.  /*Die Sonne scheint noch.* / / Sophie Scholl (19211943)./ 
From: abpetrov <abpetrov@uf...>  20130801 14:32:27

this program work operator f1, ff; r1 := {ff( f1(~x)+f1(~y))=> ff( f1(x+y))}; p := f1(x) + f1(y); p2 := ( ff(p) where r1 ); part( p2, 1); but I must declare dummy operator ff Best Regards Petrov Alexander 
From: abpetrov <abpetrov@uf...>  20130801 14:05:34

01.08.2013 05:36, Rainer Schöpf пишет: > On Thu, 1 Aug 2013 at 09:59 0000, abpetrov wrote: > > > Hi, > > I am new in Reduce, so I ask forgive me this question, it is may be simple. > > I am trying to define rule for an operator > > > > operator f1; > > r1 := {f1(~x)+f1(~y)=> f(x+y)}; > > > > but when i try to use it > > > > ( f1(x) + f1(y) where r1 ); > > > > i have error message > > > > ***** Unmatched free variable(s) ~y > > > > Is it possible to define rule for such operation ( not for > > f(~x+~y)=>f(x)+f(y), there isn't problem here)? > > I'm afraid that this is not possible with the rule mechanism (see section 11.2.5 > of the Reduce manual for an explanation). > > Instead you could try the user contributed pm module, documented in > > packages/pm/pm.txt > > Hope that helps > Rainer > I made attempt with program load_package pm; operator f1; s(f1(x) + f1(y),f1(?x) + f1(?y)−>f1(x+y)); And then I got next error message ***** (? y) invalid as operator I suppose I can do what I want with operator part, but I don't like this solution. Best Regards Petrov Alexander 
From: Rainer Schöpf <rainer.schoepf@gm...>  20130801 05:36:39

On Thu, 1 Aug 2013 at 09:59 0000, abpetrov wrote: > Hi, > I am new in Reduce, so I ask forgive me this question, it is may be simple. > I am trying to define rule for an operator > > operator f1; > r1 := {f1(~x)+f1(~y)=> f(x+y)}; > > but when i try to use it > > ( f1(x) + f1(y) where r1 ); > > i have error message > > ***** Unmatched free variable(s) ~y > > Is it possible to define rule for such operation ( not for > f(~x+~y)=>f(x)+f(y), there isn't problem here)? I'm afraid that this is not possible with the rule mechanism (see section 11.2.5 of the Reduce manual for an explanation). Instead you could try the user contributed pm module, documented in packages/pm/pm.txt Hope that helps Rainer 