Hi,
is it implemented to create submodules of QQ['x,y,z'] as module over
itself? I know it works for QQ['x'] or ZZ.But I don't know how to do
this in the case of QQ['x,y,z'].
If it's not possible, where and what are the problems? Or is there a
patch available, which provides this?
bg,
Johanne
Hi,
I use the following code in sage, which internally calls Maxima to solve
the problem.
The solver never returns with a solution, even if i change the values
randomly.
I tried to enter the same code into MATLAB and it also doesn't return with
a solution.
What is the Problem?
L1=8;
L2=6;
L3=4
Is it faster to switch to using the mobius_function_matrix if I only want
the intervals starting from zero?
I'm also confused about what it means by the linear extension.
The part of my code in question is
F = []
for i in range(M.rank()+1):
F.extend(M.flats(i))
P = Poset((F
This has cut my computation time to a hundredth of that it was, thanks.
On Wednesday, 22 May 2013 01:10:40 UTC-4, Jeroen Demeyer wrote:
>
> On 05/22/2013 12:24 AM, Michael Orlitzky wrote:
> > Singular (included in sage) has a library that can quickly count the
> > number of real roots in an inte
I don't understand what you're trying to do, but in any case: Sage is open
source, so yes you can definitely modify it. It's probably easiest if you
simply subclass the ANF2CNF converter and implement whatever change you want
to see in your subclass.
On Wednesday 22 May 2013, akhil wrote:
> Hel
Hello everyone,
I wanted to know if the SAGE builtin ANF2CNF converter (I am using the
sparse strategy implementation) can be modified so as to display a limited
number of clauses of the given ANF expression, say 'n' number of clauses (n
must be input to the converter, along with the ANF expre
