Rodrigo Canaan rocan...@gmail.com writes:
Hello!
I am working on a program that takes quite a long time to execute, and I
wanted to be able to save the intermediate results to an output and to load it
later in another session, so that I wouldn't need to run the program
overnight
Jason White ja...@jasonjgw.net writes:
Tim Daly d...@axiom-developer.org writes:
As far as I am aware there is no emacs mode for Axiom.
Contact Martin Rubey
Thank you for the clarification.
axiom.el became fricas.el + fricas-cpl.el + efricas, is part of the
fricas distribution
I'm responding also to fricas-devel, since a problem shows up there...
Mark Clements mark.cleme...@anu.edu.au writes:
The following problem came up on the Maxima mail-list (translated here into
Axiom):
-- solve for x (over the Reals?)
ex := (3/7)^(4*x-5)*(7/3)^(2*x-7)=1
I came up with
Tim Daly d...@axiom-developer.org writes:
a:=(3/7)*(4*x-5)*(7/3)*(2*x-7)-1
you are missing some stars...
Martin
___
Axiom-mail mailing list
Axiom-mail@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-mail
Dear Ralf,
I'm extremely grateful that you answered...
Ralf Hemmecke r...@hemmecke.de writes:
N := Union(Symbol, List Integer)
BT := BinaryTree N
B == binaryTree -- the 3-argument version
V == binaryTree -- the 1-argument version
bt:BT:=B(V e,[5,1],B(B(V a,[1,1],V b),[1,1],B(V c,[1,2],V d)))
(1) - f:=-(37/84)*x^2 -(7/12)*x -1/42
37 27 1
(1) - -- x - -- x - --
84 12 42
Type: Polynomial(Fraction(Integer))
(2) - x12:=radicalSolve(f,x)
++ ++
- \|2105 - 49
Dear Liu,
Liu Xiaojun [EMAIL PROTECTED] writes:
Hi,
Does exponential operation (^ or **) of a differential operator, say L,
means repeating multiplications of L in Axiom ? If so, it seems the following
code produced an unexpected result:
(1) - Dx: LODO(EXPR INT, f+-D(f,x)) := D()
Gerald Knizia [EMAIL PROTECTED] writes:
Is there some way to accomplish something like that? Am I missing something
important in they way axiom works? If using functions or macros above does
not seem to make any difference.
Maybe you are looking for
eval(expr, [kernel=replacement])
or
Alasdair McAndrew [EMAIL PROTECTED] writes:
I'm a bit embarrassed not to be able to work this out for myself, but,
anyway... Now that I've discovered the joys of the NumericalQuadrature
package, I want to use it to calculate the total variation of some
functions; the total variation being
Alasdair McAndrew [EMAIL PROTECTED] writes:
Thanks for that. So does this mean that numerical quadrature is not
supported in Axiom?
There is romberg, which works pretty well, I think.
Martin
___
Axiom-mail mailing list
Axiom-mail@nongnu.org
Andreas Klein [EMAIL PROTECTED] writes:
Hello.
I hope this is the right address.
Has Axiom implemented the LLL-algorithm?
not yet, but it would be wonderful if you (or somebody) did. It would make a
great counterpart for my guessing package...
Alasdair McAndrew [EMAIL PROTECTED] writes:
Hi,
I can write (simple) Axiom programs for which the parameters are all
numbers, but what if the parameters include a function? Suppose I wished to
write a program to, say, solve the equation f(x)=0 by the bisection method,
and I wanted to call
Alasdair McAndrew [EMAIL PROTECTED] writes:
The command
integrate(exp(-x^2),x=0..1)
produces an expression involving the error function. But how do I turn this
into a single Float?
It seems to be a bug. Please file it on issuetracker, I'll try to fix it as
soon as possible. Quite
Zach [EMAIL PROTECTED] writes:
Tim, please tell me that Firefox will not be the only way to interface with
Axiom. It will still be possible to write an Emacs mode for it, something
like IMaxima? Also, why only Firefox, why not any browser?
There is an emacs mode. PLEASE try it and give
Fabio S. [EMAIL PROTECTED] writes:
I am sorry, but I can't understand why I am not able to change the elements
of a square matrix.
This is a consequence of SquareMatrix not inheriting from MatrixCategory.
Very likely, setelt was simply forgotten.
You have three possibilities:
a)
(6) -
An afterthought:
I believe it would be helpful to implement my favorite function hierarchy
(rational functions algebraic functions d-finite functions differentially
algebraic functions general function)
and my favorite recurrence relation hierarchy
(linear with constant coefficients
Bill Wood [EMAIL PROTECTED] writes:
I'm just trying to assign to a field of a record in a one-dimensional
array of records, but I get this incomprehensible message:
The form on the left hand side of an assignment must be a single
variable, a Tuple of variables or a reference to an
Maybe you could try to compile the same thing with libaxiom?
Martin
Ralf Hemmecke [EMAIL PROTECTED] writes:
I think you have just found a bug in the Axiom interpreter/compiler.
The following Aldor program compiles fine.
aldor -fx -laldor aaa.as
and gives as output
xs = [
[0, 0]
Ralf Hemmecke [EMAIL PROTECTED] writes:
I think you have just found a bug in the Axiom interpreter/compiler.
I just did the following:
-- assign.as --
#include axiom
INT == Integer;
R == Record(k: INT, rad: INT);
import from R, INT;
initrec():
Alasdair McAndrew [EMAIL PROTECTED] writes:
There's no difference between mod and positiveRemainder; in fact if it
were possible to rename positiveRemainder to mod then I'd be quite happy.
Is
(1) - mod == positiveRemainder
Dear Sumant,
Sumant S.R. Oemrawsingh [EMAIL PROTECTED] writes:
(1) - h(k,x)==1/2 + 1/%pi * atan(k*x)
(2) - f(k,x)==x**2 * (h(k,x)-h(k,-x))
(4) - g(x)==limit(f(k,x),k=%plusInfinity)
What I would think is that, since g(x) is a sum of two functions, the
integral would split up into a sum
Again a new version of axiom.el.pamphlet, uploaded to MathAction:
http://wiki.axiom-developer.org/AxiomEmacsMode
You need to untangle the file and load it into emacs with
M-x load-file Ret axiom.el Ret
Changes:
* implemented repositioning of the process-mark consistently and safely,
*
A new version of axiom.el (10-06-2007) is now available on
http://wiki.axiom-developer.org/SandBoxAxiomEmacsMode
Thanks to Tom Tromey, shell mode works now even after having used axiom mode.
I also added some documentation.
Missing:
* xemacs port
* allow debugger to be entered, I.e., track
Alasdair McAndrew [EMAIL PROTECTED] writes:
This is an example of where Axiom's handling of domains fries my limited
brain.
Never say such things.
ex:=z/(z-1)+2*z/(z-3)
(Result is returned as a single polynomial fraction.)
Yes. That's the canonical form for FRAC POLY INT.
Now, what I
Dear Bill,
Bill Page [EMAIL PROTECTED] writes:
http://wiki.axiom-developer.org/358VariableIsApparentlyAlwaysAssumedToBePosi
tive
The latter filing is more complete and correctly categorised.
Good. Thanks for submitting the report!
Normally I would add my comments directly to the
Dear Themos, Alasdair,
trying to debug the freeOf? pattern, I discovered that Themos' pattern suffers
from the same problem:
tt:=operator 'tt; ttrules := rule tt(n/(n^a+(X | integer?(a) and (n-1)^a = n^a
+X))) == 1/t^a
(100) - ttrules tt(n/(n^6+anything))
1
(100) --
Alasdair McAndrew [EMAIL PROTECTED] writes:
I also notice, while hunting through /src/algebra, that there is an
applyRules function; but as with suchThat, it's not mentioned in the
documentation; at least, not in the Rules and Pattern Matching section (6.21)
of the Axiom book. Maybe these
Alasdair McAndrew [EMAIL PROTECTED] writes:
I've become much fonder of HyperDoc, especially since editing the X
resources to use nicer fonts! But, for example, suchThat in the search
page of HyperDoc produces no results. Neither does Ruleset. Maybe my
HyperDoc has been incompletely
Alasdair McAndrew [EMAIL PROTECTED] writes:
Thanks, Martin,
As always I am helped by you! I have two questions; maybe you can answer
them:
1) How do I include linearity in the pattern matching rules? At present,
the command
ztrans(2+3^n,nz)
which should return the result
Alasdair McAndrew [EMAIL PROTECTED] writes:
But this doesn't quite work. I'd be grateful for a little help here! (Then
I'll see if I can use the z-transform to solve some difference equations.)
it seems that rules don't like local function definitions too much. The usual
syntax would be
Dear Sumant,
You have sent an excellent example!
Sumant S.R. Oemrawsingh [EMAIL PROTECTED] writes:
Say, I wish to define a piece-wise function,
(1) - f(x|x0)==-x**2
Type: Void
(2) - f(x)==x**2
Dear all,
finally, I think I have something more or less working. Unfortunately, it cost
it me yet another night, but I hope it will come useful for some people.
+ still more cleaning up
+ C-c C-c works
+ for i in 1..10 repeat ([j for j in 1..2000]; output hi)
outputs one line after the
Sumant S.R. Oemrawsingh [EMAIL PROTECTED] writes:
I just tried axiom today for the first time, since it appears quite
powerful. This of course means I'm a total newbie, so I've tried searching
for the problem that I have through the archives, without luck.
welcome, and do not hesitate to ask!
Sumant S.R. Oemrawsingh [EMAIL PROTECTED] writes:
I just find this very strange:
(1) - %e
(1) %e
Type: Expression Integer
(2) - %pi
(2) %pi
Type: Pi
Why
Dear all,
after a day of hacking and with some help from Cliff and Jay (many thanks!) I
have a new version of axiom.el, which you find attached. I'd be extremely
grateful for feedback! Alasdair, is this usable for you?
To use it, put it into a directory where emacs can find it, gunzip it, say
Dear Gaby,
Gabriel Dos Reis [EMAIL PROTECTED] writes:
For concretness, here is a very classic example of inductive type
along with a function working on expression of such type, written in
both Haskell and New Boot. How would you best write that in Spad?
I'm very sorry, but I do not
Here you go. But I doubt somehow that Gaby had this in mind, since this is
quite usual stuff in Axiom (grep Rep.*Union)
Martin
)abbrev domain EX Expr
Expr(): with
eval: % - Integer
coerce: Integer - %
coerce: % - OutputForm
_+: (%,%) - %
_*: (%,%) - %
== add
MkInt ==
in
SYMMETRICA.
Axel Kohnert Symmetric functions in MAGMA
--
Organisers: Ralf Hemmecke
Martin Rubey
Email: [EMAIL PROTECTED]
URL:http://wiki.axiom
Dear Alasdair, Dear Vadim!
Vadim: sorry I haven't sent you the paper by Gemignani yet. It turned out that
I do not have a pdf. If you are still interested, please send me a postal
adress and I send you a collection of papers today. See below on a tiny
demonstration what FFFG can do.
Alasdair
Dear Bill, Alasdair,
Bill Page [EMAIL PROTECTED] writes:
I would like to give you an unsolicited caution regarding the use of pattern
matching rules in Axiom. Although the application of rules work fairly well
within the Axiom 'Expression' domain really this sort of symbolic
manipulation of
Alasdair McAndrew [EMAIL PROTECTED] writes:
And even in HyperDoc, there are very few examples. For instance, I was
trying to find the defining polynomial of a finite field. I discovered that
there is a command definingPolynomial, but I couldn't find any examples on
its use, nor a
Dear Ralf
(I'm the author of mantepse co)
Ralf Stephan [EMAIL PROTECTED] writes:
Hello, why is it that I can compile the Simpson's method's spad file but not
mantepse.spad? The latter contains %S strings which let the compile command
choke.
Hm, I don't see any %S strings in any of my
algebras using SCHUR and Maple
Harald Fripertinger
TBA
Axel Kohnert
Symmetric functions in MAGMA
Organisers: Ralf Hemmecke
Martin Rubey
Email: [EMAIL PROTECTED
Ralf [EMAIL PROTECTED] writes:
Hello,
does somebody know the proper method/function to convert between
NNI, PI, SingleInteger, Integer
I guss to go from x: NNI to SingleInteger you have to say
retract(x::INT)@SingleInteger
Usually, in axiom, if a coercion (in the general, not Axiom
[EMAIL PROTECTED] (Ludovic Courtès) writes:
Hello,
I'm trying to solve an inequality of the following form:
find all values of x such that f(x) 1,
where f(x) is an `Expression Integer'
`solve' and `radicalSolve' are apparently not helpful here. Any idea on
how to achieve this?
root [EMAIL PROTECTED] writes:
that seems to require an ACM account. --t
maybe. However, I just googled a little and came up with the following:
Computing Rational Forms of Integer Matrices
MARK GIESBRECHT AND ARNE STORJOHANN
which should be a lot faster...
I also found out that Isabelle
Hans Peter Würmli [EMAIL PROTECTED] writes:
Hi Martin
this follows the documentation: binomial(n-1,k)/binomial(n,k) is not a
rational function, but normalize(e2) is:
n - k
(3) -
n
Type: Expression
Hans Peter Würmli [EMAIL PROTECTED] writes:
(1) - e2:=binomial(n-1,k)/binomial(n,k)
n - 1
( )
k
(1) ---
n
( )
k
Type: Expression Integer
(2) -
Dear Stefano,
Stefano Simonucci writes:
Now if I write
integrate(exp(x)/x,x)
I obtain
Ei(x)
while if I write
integrate(exp(x)/x^2,x)
I get a form integral. But the integral of exp(x)/x^2 can be given in terms
of Ei(x) as exp(x). In fact I believed that the axiom can be able to
49 matches
Mail list logo
