You can explore the inbuilt function `solve_mod`...
You will have to input your system in the form of equations and not in
form of a matrix.
The function also accepts system of non-linear congruences!
VInay
On 4 August 2016 at 22:50, Juan Grados wrote:
> I need a operator, or function, to f
Yes, this is not yet implemented in Singular yet. Although GTZ algorithm
gives error whereas SY algorithm clearly mentions "Not implemented".
If you are interested in char 0, and not specifically Complex, then using
QQ instead of CC gives a workaround. As far as your example is concerned,
it may n
Sorry to ask such simple questions, but I am not able to find appropriate
reference in the manual.
I have a power series ring (or polynomial ring) in multi-variables, say R =
k[X_1,\cdots, X_n] or k[[X_1,\cdots, X_n]]. I need to define a module over
R, generated by f_1,f_2,\cdots,f_r.
e.g. in Si
Thanks Maarten.
I was able to install sage-mode by downloading it to a temporary directory
and then sage -i .
About the proxy, I managed a workaround in two ways:
1. exporting http_proxy="http://user:passwd@server:port/"; from the
commandline and then execute sage -i package_name. (Also I suspec
Our institute network uses authenticated proxy. I am having trouble
installing a package using
*sage -i* OR *sage -f* from command-line. I am using sage-4.7.2 on Ubuntu
12.04 (development branch).
I just tried to install *sage-mode*. The error is:
Deleting directories
Oh! I wasn't aware that multivariable power series is a "new" addition...
Thanks anyway...
-- VInay
On 2 November 2011 21:09, William Stein wrote:
> On Wed, Nov 2, 2011 at 8:32 AM, Vinay Wagh wrote:
> >
> > On 2 November 2011 20:49, Jason Grout
> wrote:
>
On 2 November 2011 20:49, Jason Grout wrote:
> On 11/2/11 10:15 AM, Vinay Wagh wrote:
>
>> I am not sure whether my "problem" has anything to do with the topic of
>> this thread...
>>
>> I want to define a Power Series Ring over QQ. The following code work
I am not sure whether my "problem" has anything to do with the topic of
this thread...
I want to define a Power Series Ring over QQ. The following code works
perfectly fine on my local computer (Ubuntu 11.10, Sage Version 4.7.1,
Release Date: 2011-08-11), whereas if I give the same on sagenb.org i
@Volker Thanks for pointing that out... I had forgotten to mention
that in my post. BY the way any idea, why such a restriction? Can we
get away with that in sage (of course for that now we cant use
Martin's code...)
@Martin Thanks for the code.
Actually I wanted to do this "without" going back an
I am working in a multi-variable polynomial ring over a field (e.g. QQ
or CC). How do I get the minimal set of generators for an ideal I (or
module M)?
I am here referring to something I can do in Singular with the command
minbase.
(http://www.singular.uni-kl.de/Manual/latest/sing_266.htm)
Thanks
n program.
Thanks a lot once again...
-- VInay
On Sep 28, 11:57 pm, john_perry_usm wrote:
> Try this:
>
> sage: I3_red_I2 = R.ideal([p.reduce(I2gb) for p in I3gb])
>
> regards
> john perry
>
> On Sep 28, 12:24 am, Vinay Wagh wrote:
>
>
>
>
>
>
>
>
The last command (redece) is giving me an error. I am not getting what
wrong I am doing...
Thanks and regards
-- VInay Wagh
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options,
12 matches
Mail list logo
