before things became to complicated and long names to obey utmost
generality, I suggest to think about, whether there are non abelian
applications which use the +-symbol. I am curious to here about them.
As long as there is not a real bunch of them and as long there is no
concrete plan to extend
Another hint: AXIOM/FriCAS already has some of these new categories;
in the non-associativity world we once provided
Monad ( 1) for *)
MonadWithUnit ( 2) for *)
However, it was never unified with the associative world, which really
should be done to be consistent.
Am 17.08.15 um 02:14
I would not mind, at that time it was a 51 to 49 decision against Magma
Am 17.08.15 um 10:04 schrieb Martin Baker:
On 17/08/15 08:57, Prof. Dr. Johannes Grabmeier privat wrote:
Another hint: AXIOM/FriCAS already has some of these new categories;
in the non-associativity world we once provided
another problem with numeric evaluations for computing the normal
distribution using the error function.
To my opinion, numeric NV(0.7) directly should return 0.7580363478
Type:
Float
(52) -> NV(x) == (1+erf(x/sqrt(2)))/2
I desperately look for the reason of a strange behaviour of compiled
SPAD code:
I have coded a category MonoidAction with default code containing the
code for "orbit" using the group action *
Then I made two different domains for this category, for one the
inherited "orbit" functions works
I found the following bug in the basis List domain:
(121) -> li := [5,6,7,8,9]
(121) [5,6,7,8,9]
Type:
List(PositiveInteger)
(122) -> delete!(li,1)
(122) [6,7,8,9]
Type:
Hi all,
I use the binary version
FriCAS Computer Algebra System
Version: FriCAS 1.2.6
Timestamp: Thu Jun 25 10:48:08 CEST 2015
-
The following
Hallo Waldek,
here a two little improvements/enhancements:
I made CyclicGroup of category CommutativeStar and accordingly for
MonoidRing, if the Monoid has CommutativeStar, so we can e.g. compute
the determinant of a matrix over a group ring of the cyclic group. I
also added a function
see my answers:
Am 11.09.15 um 15:38 schrieb Waldek Hebisch:
> Prof. Dr. Johannes Grabmeier wrote:
>> Hi all,
>>
>> I use the binary version
>>
>>FriCAS Computer Algebra System
>> Version: FriCAS 1.2.6
>> Timestamp: Thu Jun 25
no and yes:
a finite group is not necessarily commutative, I only changed the
CyclicGroup there!
MRING: Yes, we need CommutativeRing !
Am 11.09.15 um 15:07 schrieb Waldek Hebisch:
> Prof. Dr. Johanneas Grabmeier wrote:
>> here a two little improvements/enhancements:
>>
>> I made CyclicGroup of
To prove the importance of symbolic computations, certainly, symbolic
integration is a bad, if not the worst example -- as for all practical
problems numerical method will do as your professor claims.
But the beauty of symbolic methods certainly can be demonstrated by the
Risch algorithm.
To my
Hi all,
by preparing for a lecture on Newton iteration I did the following,
which strange behaviour. Note, that p and p' in the body of a function
are not evaluated, while x is evaluated. Can one explain the philosophy
behind - or it is a bug (I hope) - and how to do it to achieve the
expected
similar problem, how to interrupt a running computation in FriCAS 1.2.6 ?
(vs. FriCAS-1.2.6-x86_64-macos10.6.tar.xz)
Am 22.06.16 um 15:36 schrieb oldk1331:
> Can we exit FriCAS by press Ctrl-D in terminal?
>
> If not, where can we add it, sman or clef or
> somthing else?
>
> --
> You received
I has a domain with a parameter V of type List Something.
In this domain I carelessly defined a local parameter in the body of a
function: V: Matrix SomethingElse.
no complaints
The FIRST application of this function worked, while the second failed
with some index out of range error, I guess
Dear Martin,
long ago I also wrote code in AXIOM for computing homological
resolutions for finite p-groups. Perhaps this might help, or can be
embedded. Please indicate, if you are interested in this code.
(see J. Grabmeier, L.A. Lambe, Computing resolutions over finite
p-groups ,in: A. Betten,
Any hints required: a very strange behaviour in a code, unfortunately
minimal example tedious to construct. Perhaps somebody has any ideas, if
not, I will try to construct a minimal example.
The following behaviour, a package with type parameter VEL has several
functions. All compile (trivial
Hallo all,
I observed the following behaviour. Perhaps someone can tell what is
going on, a bug of philosophy which I do not understad? If necessary I
can work out and provide a minimal example.
1. defined a category IML with several functions, all of them are
implemented in the category, some of
Hallo Waldek,
thanks for your quick explanation, I add my comments directly to your
comments
Am 20.12.16 um 22:35 schrieb Waldek Hebisch:
> Prof. Dr. Johannes Grabmeier wrote"
>> I observed the following behaviour. Perhaps someone can tell what is
>> going on, a bug of philosophy which I do not
Hi Waldek,
you perfectly right to give the nitpick hint, that only functions can
access the local variables. Nevertheless, my complain is, that
- a "directly" imported package like the add-part of a category (I count
this as an function of the new domain/package in the first place)
should
Thanks a lot for your quick help, yes I was not quite concentrated, in
the model GDMP one has
E : DirectProductCategory(#vl, NonNegativeInteger)
hence an argument of the domain constructor, while I had
E==> TermDisjunctiveNormalForm(#vl)
hence only at runtime, also it is very subtle, that
successfully compiled a domain, then the following happens. Any hint,
where to look for the error is welcome:
(178) -> D3 := DisjunctiveNormalForm [p1,p2,p3]
(178) DisjunctiveNormalForm([p1,p2,p3])
code is a lot of stuff, have basically more or less rewritten and
generalized the polynomials.
So I try the backtrace
(180) -> D3 := DisjunctiveNormalForm [p1,p2,p3]
(180) DisjunctiveNormalForm([p1,p2,p3])
here they are
)r compile-all
1 )co iml
2 )co prest
3 )co complet
4 )co dnf
5 )r testdnf
Am 19.09.17 um 15:00 schrieb oldk1331:
> The bug probably exists in your code instead of the compiler,
> so please upload your souce file, especially the definition
> of DisjunctiveNormalForm.
>
Can someone explain to me the semantics of "..." and _"
E.g. BitAggregate:
BitAggregate() : Category ==
Join(OrderedSet, Logic, OneDimensionalArrayAggregate Boolean) with
"not": % -> %
++ not(b) returns the logical {\em not} of bit aggregate
++ \spad{b}.
nand : (%, %) -> %
In statement 2 (combination of overbar and +) the line wraps cause that
the 3 characters ' , ; and O disappear, changing the output length
appropriately, all is ok.
Any idea to fix this? print of OutputForm calls mathprint of Lisp.
I discovered that for proper output of negations of boolean
Hallo Ralph,
you abbreviated a package and implemented a category:
)abbrev category FOO Foo
Foo(Z: EuclideanDomain(), V: SetCategory()): Category == with
laurentRelations: List Symbol -> List Polynomial Integer
relationsIdealGenerators: List Integer -> List Polynomial Integer
What is going wrong here:
(1) -> li := [2,4,3,2,5,2,7,2,2,7]
(1) [2, 4, 3, 2, 5, 2, 7, 2, 2, 7]
Type: List(PositiveInteger)
(2) -> remove(2,li)
(2) [4, 3, 5, 7, 7]
Hi all,
have added sqrt for prime fields, perhaps for next release.
(1) -> )r sqrtpf
F := PrimeField(nextPrime 273845092384750923487509234587)
(1) PrimeField(273845092384750923487509234619)
Type:
Am 31.05.18 um 15:55 schrieb Erik Eidsvig:
> Thanks!
>
> -But what about n-root of a numer? As an example, the 5th-root of 32?
>
> (I have tried commands like root(32,5), nrot(32,5) etc.)
(1) -> nthRoot(5,7)
7+-+
(1) \|5
Good morning,
any idea what that means (used to work before):
>> System error:
The variable |$resolve_level| is unbound.
--
Mit freundlichen Grüßen
Johannes Grabmeier
Prof. Dr. Johannes Grabmeier
Köckstraße 1, D-94469 Deggendorf
Tel. +49-(0)-991-2979584, Tel. +49-(0)-151-681-70756
Hi all,
since long I have a domain which respresents the elements of a list as a
elements of the domain: FiniteSet(S, List S) and a special case OneToN =
{1,2,3,...,n}.
Two problems:
1. < of PartialOrder does not work properly. Note, that the order of the
elements in the finite set is the given
018 at 3:53 AM, Prof. Dr. Johannes Grabmeier privat
> <johan...@grabmeier.net> wrote:
>> All general functions as leftRecip and rightRecip are superfluous as
>> soon we have a recip, ...
> I don't think so. For example 'MagmaWithUnit' is inherited by a very
> large
Your discussion showa a problem which disturbs me since long: In
AXIOM/FriCAS we are try to be as general as possible, having
non-associative and non-commutation structure. Every commutative
structure is a special case of the general non-(neccesarily)
commuatative structure, every associative
I think you have to do "by hand": I assume the first %p ist meant to be
%pi as well:
(5) -> m:= matrix [[%pi, %i *%e],[-%i*%e,%pi^2]]
+ %pi %i %e+
(5) | |
| 2 |
+- %i %e %pi +
no bug!
generator() does not necessarily return a primitive element, which
generates the cyclic group (F-{0},*)! It returns an element which generates
the algebra, so the result is correct.
See comment:
generator : () -> %
++ generator() returns a root of the defining polynomial.
++ This
I would like to use e.g. Greek letters instead of the awful %A, %B in
finite fields:
(68) -> greekLetters := [index(i)$Character :: String :: Symbol for i in
946 .. 970]
(68) [α, β, γ, δ, ε, ζ, η, θ, ι, κ, λ, μ, ν, ξ, ο, π, ρ, ς, σ, τ, υ,
φ, χ, ψ, ω]
Hi all,
I implemented signatures e.g. normalKernel depending in a package
depending on Field K with the additional
condition:
if K has "^": (K, Fraction Integer) -> K
The function works without package calling for K = Float
(125) -> normalKernel(x, lvf_cb, Hinv)
(125)
What is the proper way to qualify a type E to have a constant or a
function with no variables?
Other functions work well, here are examples from the algebra code.
if R has imaginary : () -> R then
if SMPF has _*: (NonNegativeInteger, SMPF) -> SMPF
if Coef has "*": (Expon,Coef) -> Coef then
Can anyone help: What are the interrupt key combination to stop a
running FriCAS computation on MacBook FriCAS 1.3.3 on SBCL?
--
Mit freundlichen Grüßen
Johannes Grabmeier
Prof. Dr. Johannes Grabmeier
Köckstraße 1, D-94469 Deggendorf
Tel. +49-(0)-991-2979584, Tel. +49-(0)-151-681-70756
Tel.
Can one clarify the ideas, semantics behind the following behaviours?
FriCAS algebra code:
AbelianMonoid() : Category == AbelianSemiGroup with
0 : constant -> %
.
becomes the following in the Interpreter:
(87) -> )sh AbelianMonoid
AbelianMonoid is a category constructor
I have extended Symbol to easily create Greek letters and think about
suggesting a change of the default (algebra) genererators
in finite fields from %A, %B to α, β. Any counter arguments?
(64) -> newGreek()$Symbol
(64) α
sorry, the new category is named OutputType
Weitergeleitete Nachricht
Betreff:New Category OutputForm
Datum: Wed, 27 Mar 2019 17:05:33 +0100
Von:Prof. Dr. Johannes Grabmeier privat
An: fricas-devel@googlegroups.com
Dear all,
I am just adding and correcting
Dear all,
I am just adding and correcting feature to basic algebraic domains, e.g.
SAE, LocalAlgebra and Fraction, as for example simplification
is not implemented yet for certain non standard situations, (already
fixed):
(1) -> x : UTS(FRAC INT, 'x, 0)
worked also without any problem for me:
MacBook Pro 2015
2,5 GHz Intel Core i7
Number of Processors: 1
Total Number of Cores: 4
Memory 16 GB
macOS High Sierra Vs. 10.13.6
SBCL 1.3.14
fricas-1.3.5-full.tar.bz2
/configure
make
make check
and
make install
I have various implementations and improbement of localizations done, if
interested I can go through it again and we can think how we improve the
current code.
Am 10.05.18 um 16:30 schrieb Waldek Hebisch:
> Various localizations seem to play important role in algebra
> so we would like to support
yes, my code is not yet in a showable shape, I will finalize it asap.
Am 11.05.19 um 17:08 schrieb Ralf Hemmecke:
> On 5/11/19 12:23 PM, Prof. Dr. Johannes Grabmeier privat wrote:
>> I have various implementations and improbement of localizations done, if
>> interested I can go t
While Integer inherits from IntegerNumberSystem the category
StepThrough, the domains NNI and PI do not share this natural property.
I have added this, however, while init() overwrites the inherited
functiom init() (as a subdomain of Integer), this is not the case for
the correct nextItem, i.e.
would like to have a binary operation -> (or something similar, e.g. =>,
==>, -->". How to handle this properly with all these special meanings?
The code
LatticeAlgebra: Category == Join(HeytingAlgebra, Monoid,
CommutativeStar) with
--operations
"->": (%, %) -> %
add
((x:
Hi all,
I have enhanved TwoDimensionalArray to include arithmetic for block
matrices and have an operation array2 (similar to matrix for Matrix) for
easy creation of
two-dimensional array and would suggest to include this into the next
version:
(1) -> )r array2-jg-test
A11 := matrix [[2]]
>> System error:
The value
((("wa" . #1=(0 . 1)) ("ka" . #1#) ("tr" . #1#) ("ws" . #1#)))
is not of type
SIMPLE-VECTOR
Any idea what is going on. It seems that after compilation, a certain
program runs, then I start another to get this bug, then the first
program all of a sudden has
I agree with your arguments. I would be content to have an
WITHOUT-statment, which "only" suppresses output of these functions in
)show and in )hd, perhaps with an additional )showall or so to see also
these still present, but for the user superfluous functions. And of
course the interpreter
t", I've seen "Meet" (the dual to Join),
> but I think that it is also not really implemented in Aldor.
>
> https://github.com/pippijn/aldor/blob/master/aldor/lib/aldor/src/lang/sal_lang.as#L93
>
>
> On 11/22/19 9:45 AM, Prof. Dr. Johannes Grabmeier privat wrote:
>
Hi all,
I started a revision of the field stuff. E.g. Simple algebraic
extensions are MonogenicAlgebra 's, so I included this and learnt, that
in this case one inherits DifferentialExtension with more differential
operators.
I think noone needs them (please indicate, if there are other
opionons).
I looked at it, but will have to go into more detail, perhaps a good
starting point to revise the whole field staff after 28 years, but would
take its time. Right now I had worked
on a such kind of domains anyway, as for a project I need
TranscendentalExtensionField
and
Hi all,
Finite is Missing StepThrough! Any objection against adding a default
step through:
)abbrev category FINITE Finite
++ Author:
++ Basic Functions:
++ Related Constructors:
++ Also See:
++ AMS Classifications:
++ Keywords:
++ References:
++ Description:
++ The category of domains composed
Any reasons that FiniteFieldCategory requires all finite fields to be a
DifferentialRing with trivial implementation pf differentiate(x) = 0? I
woud like to eliminate this.
--
Mit freundlichen Grüßen
Johannes Grabmeier
Prof. Dr. Johannes Grabmeier
Köckstraße 1, D-94469 Deggendorf
Tel.
would like to have a print functions with this feature, right now it
seems that print in OutputForm using print(x == mathprint(x)$Lisp is
the only way. Would appreciate if the LISP experts indicate such a
function, the of course it should be possible to print an end-of-line, too.
--
Mit
Dear all,
in my revision work for finite fields from time to time I get Control
stack exhausted without finding the problem which causes it. (Same
computation in the unchanged current world computes correctly)
Two questions:
1. How can I modify in LISP the debugging to check whether one simply
Hi all,
have a new error of an older code, which used to work an which I
recompiled today:
The function BOOT::PAIR is undefined.
346) -> )co dnf
Compiling FriCAS source code from file
/Users/jgrabmeier/arbeiten/fricas/dnf/dnf.spad using
old system compiler.
TDNF abbreviates
as/commit/97141c6f61a07f1d9484745d7f4051a2caeb7148#diff-0c18939820a0db36a38e0c1b54eb94120dba864e05c18723c90cb3ae621ac7d8L461
>
> However, I wonder how you can get this error if 'pair' is actually not
> in FriCAS. Sounds like you are using old and new code together. (?)
>
> Ralf
>
> On 10/16/20 9:12 PM, Prof.
Hi all,
in my rework through the finite field stuff, I recently discover strange
errors message: "The function COMMON-LISP:PROG1 is undefined"
Any hint what kind of problem is causing this?
--
Mit freundlichen Grüßen
Johannes Grabmeier
Prof. Dr. Johannes Grabmeier
Köckstraße 1, D-94469
Dear all,
writing code for apportionment methods (election, votes and seats) I
heavily need floor and ceiling: % -> Integer - the code should work for
Fraction Integer, DecimalExpansion and Floats
However, the two method in Float have signatures floor, ceiling: % -> %
(should be unified to have
the FriCAS code for inverting matrices over R is not correct. If wished
I can provide the necessary changes to matfuns.spad
Problem: recip returns "failed", inverse coerces to Fraction Integer:
(1) -> R := IntegerMod 26
(1) IntegerMod(26)
Dear all,
all of a sudden my FriCAS does no longer connect to X11. I installed
XQuartz (again), but same effect, any ideas/help what to do?
Checking for foreign routines
FRICAS="/usr/local/lib/fricas/target/x86_64-apple-darwin17.7.0"
64 matches
Mail list logo
