On 28.05.2018 21:31, Riccardo GUIDA wrote:
> Hi, I have a couple of questions.
>
> 1)
> are dependent types supported by the interpreter (input files)?
Yes, e.g. Matrix(Integer) is a DT.
>
> I feel like n in the image type of defFun below is really understood ...
>
> (1) -> )read dep-types
>
On 28.05.2018 21:31, Riccardo GUIDA wrote:
> 2)
> Is there an assign function such that
>
> assign(x,z)
>
> would be equivalent to the statement x:= z ?
Well, there a many possibilities ... depends on purpose
Use an abbreviation for instance:
(1) -> assign(var,val) ==> var:=val
Hi, I have a couple of questions.
1)
are dependent types supported by the interpreter (input files)?
I feel like n in the image type of defFun below is really understood ...
(1) -> )read dep-types
defFun(n:PositiveInteger):SquareMatrix(n, Integer) == sample$SquareMatrix(n,
Integer)
Hi Kurt
> The REDUCE ncpoly is quite slow
Perhaps, but it is useful for small expressions and is better than nothing.
> Singular's nfactor.lib is quite sophisticated
I just came across Singular. Looks pretty good.
> This might be a good opportunity for you to write a package ;)
I would love
> That's a pity. Is the problem with the published algorithm or the source
code?
Fabrizio said there were some bugs in the code.
> The terms of XDPOLY consist of the "support" (an element of an
> FreeMonoid) and a coefficient. FreeMonoid exports "factors".
Thank you Bill!
On Mon, May 28,
Hi Marduk
You certainly know that this is not entirely trivial. The REDUCE ncpoly is quite
slow (at least it was some years go). IMO Singular's nfactor.lib is quite
sophisticated and could also be implemented in fricas (all structures are
already availabe, Ring, FreeModule(R,S) is nc ...
This
On Mon, 28 May 2018, Bill Page wrote:
That's a pity. Is the problem with the published algorithm or the source code?
Factorization of noncommutative polynomials seems to be a difficult
problem. See
https://arxiv.org/abs/1706.01806
for a recent new approach which reduces factorization to the
On Mon, May 28, 2018 at 6:14 AM, Marduk BP wrote:
> It turns out that code was never released because it was buggy, so we
> can forget about it.
>
That's a pity. Is the problem with the published algorithm or the source code?
> But IMHO what I want to do does not
Yes! Thanks a lot Waldek.
leadingSupport is not mentioned in the FriCAS book. Could you explain what
does it do/why does it work?
Marduk
On Mon, May 28, 2018 at 2:08 PM, Waldek Hebisch
wrote:
> Marduk BP wrote:
> >
> > It turns out that code was never released
Marduk BP wrote:
>
> It turns out that code was never released because it was buggy, so we
> can forget about it.
>
> But IMHO what I want to do does not require factoring a polynomial. I just
> want to extract the variables and their exponents from a monomial of
> noncommutative variables.
>
>
It turns out that code was never released because it was buggy, so we
can forget about it.
But IMHO what I want to do does not require factoring a polynomial. I just
want to extract the variables and their exponents from a monomial of
noncommutative variables.
There must be a (hopefully simple)
>
> 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)
> (3) -> li10 := [recip(i::IntegerMod 10) for i in 0..9]
>
> (3) ["failed", 1, "failed", 7, "failed", "failed", "failed", "failed", 9]
>
Ah! Of course. Actually, I recently realized that I should treat symbolic
coefficients
as polynomials with integer coefficient 1.
Thanks Ralf!
On Mon, May 28, 2018 at 10:03 AM, Ralf Hemmecke wrote:
> On 05/28/2018 08:53 AM, Marduk wrote:
> > Dear all,
> >
> > As the
On 05/28/2018 08:53 AM, Marduk wrote:
> Dear all,
>
> As the following example shows, when writing polynomials with noncommutative
> variables one has to specify that the symbols belong to the list of NC
> variables:
>
> ops := OVAR[A,B]
>
> ncomm := XDPOLY(ops, Integer)
>
> q : ncomm :=
Dear all,
As the following example shows, when writing polynomials with noncommutative
variables one has to specify that the symbols belong to the list of NC
variables:
ops := OVAR[A,B]
ncomm := XDPOLY(ops, Integer)
q : ncomm := 3*B::ops*A::ops
I just found out that doing the same in REDUCE
Thank you Bill! I already contacted the author.
I also found out that REDUCE includes this functionality:
http://www.reduce-algebra.com/reduce38-docs/ncpoly.pdf
I think it should also be included in Axiom/FriCAS.
Marduk
--
You received this message because you are subscribed to the Google
16 matches
Mail list logo