Hi Dima,
just for the record: Both the master and the develop version are now
built and they work.
Thank you! Best regards,
Simon
On 2021-11-14, Dima Pasechnik wrote:
> Hi Simon,
>
> On Sun, Nov 14, 2021 at 1:26 AM Simon King wrote:
>>
>> Hi Dima,
>>
>> On
was done automatically, but I guess ./configure is
the normal thing to do before "make" in most software), which
recommended to install further stuff (which I did), and now "make" is
running!
Best regards,
Simon
--
You received this message because you are subscribed to the G
PS:
On 2021-11-14, Simon King wrote:
> On 2021-11-14, Dima Pasechnik wrote:
>> hmm, if you really checked out the latest version and have done
>> `make distclean`, then it should have worked (it does work, you know).
In other words: With the latest develop version, even "ma
or: The content of
"/home/king/Sage/git/py3/build/pkgs/beautifulsoup/type" must be
'base', 'standard', 'optional', or 'experimental'
autoreconf, to rebuild the configure script, didn't help either.
Best regards,
Simon
--
You received this
I tested, and I can create
an executable from some "Hello World" program.
Again: How to debug? The only "failed program" mentioned in config.log
is with "#include " -- so, it is supposed to fail.
Best regards,
Simon
--
You received this message because you are subscribe
ut what went wrong? And: What would be the recommended way
to get a working Sage installation on the new laptop that can use my old
branches?
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and
Hi Nils,
can you open a ticket for it?
Best regards,
Simon
On 2021-09-08, Nils Bruin wrote:
> On Wednesday, 8 September 2021 at 09:24:15 UTC-7 max...@gmail.com wrote:
>
>> Hi Simon,
>>
>> Thank you for your insight, and let me state that I
>> find In
s works and how to fix
that (by "fix", I mean "make it not work and, in the best case, suggest
to convert to a symbolic expression").
InfinitePolynomialRing was created for a very narrow purpose, namely
computing symmetric Gröbner bases. In particular, calculus was not in
the scope. If so
: singular(I).std().interred().normalize()
x^2+1/2*y^3,
x*y*z+z^5,
y^5+3*z^5,
y^4*z-2*x*z^5,
z^6
Best regards,
Simon
On 2020-12-12, Joshua Holden wrote:
>
>
> Hi, everyone!
>
> I'm trying to do some computations with (truncated) multivariabl
Hi Nils,
fair enough. I didn't deeply think about it, my naive impression was
that what the preparser does to
R. = QQ[]
is at least as complicated as dealing with the exclamation mark. But
I guess you're right: It isn't.
Best regards,
Simon
On 2020-11-29, Nils Bruin wrote:
>
On 2020-11-29, Simon King wrote:
> Hi Emmanuel,
>
> On 2020-10-28, Emmanuel Charpentier wrote:
>> Nope. This syntactic sugar is provided by `Maxima`'s and `Mathematica`'s
>> readers, but not by Sage preparser.
>
> Would it be nice (and easy) to have in Sag
y_1, y_2, y_3, ...,
and when you take any element of your ideal and apply any permutation of
{1,2,3,...} to all indices of the generators, than you again get an
element of your ideal.
But I'm afraid it seems your use case isn't covered.
Best regards,
Simon
--
You received this mes
Hi Emmanuel,
On 2020-10-28, Emmanuel Charpentier wrote:
> Nope. This syntactic sugar is provided by `Maxima`'s and `Mathematica`'s
> readers, but not by Sage preparser.
Would it be nice (and easy) to have in Sage? What prevents the preparser
from understanding "!&q
7*t^4 + 8*t^5 + 6*t^6 + 6*t^7 + 11*t^8 + 13*t^9 +
9*t^10 + 11*t^11 + 10*t^12 + 8*t^13 + 10*t^14 + 10*t^15 + 8*t^16 + 10*t^17 +
10*t^18 + 8*t^19 + O(t^20)
Note that in princible Singular can compute Hilbert series, too, but
it has an awkward syntax, refuses to work in non-commutative settings,
eal_mpfr.RealLiteral.
3. Is there some "official" standard (similar to IEEE 754) supporting
Sage's rounding?
4. Shouldn't the rounding be defined in a .__round__() method rather
than in a .round() method?
5. Is it possible to explicitly request "half to even"
field of a
polynomial ring, which does automatic simplifications (which in the
special context of polynomials is a lot easier than in the general
context of symbolic variables).
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support"
not appropriate to discourage people using sage-support,
IMHO.
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-sup
cally work with polynomial expressions over
GF(2) in indeterminates x0,...,x3, and want to eventually insert
special values into the expressions, you could do the following:
sage: P. = GF(2)[]
sage: f = ((x0+x1)^2+(x2+x3)^2)^2
sage: f
x0^4 + x1^4 + x2^4 + x3^4
sage: f(x0=1, x
Best regards,
Simon
> Type:LazyImportString form: The cartesian_product functorial
> constructionFile:
> /opt/sagemath-8.9/local/lib/python2.7/site-packages/sage/misc/lazy_import.pyxDocstring:
>
>A singleton class for the Cartesian pro
hon2". So, if you
really want Sage-with-py-3's Python installation, you should either do
"sage -python" or (in a Sage shell) "python3". And I think the same
holds for pip.
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
&qu
that will give you some
> examples.
Cool! I didn't know about %mprun before.
Thanks!
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-sup
hon-3 str)? And can we really say that things
*are* compatible when compatibility can only be achieved by providing an
optional keyword argument?
Anyway. After I learned about the `encoding` keyword, I opened #28444,
where I propose to add the `encoding` keyword to Sage's `load` function,
so that
compatible.
In fact it isn't compatible, but that of course means it must be
attempted to make it compatible.
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop rece
d compatible. See
>
> https://trac.sagemath.org/ticket/28302
Thank you for the pointer.
I believe a CAS which doesn't even *attempt* to offer a way to store user
data permanently and reliably is a failure. I'll rant more on it on the
ticket.
Best regards,
Simon
--
You received thi
takes? In that
case, it might make sense to use a profiler (e.g., %prun or %crun). Or do
you only want to know how much time and memore the program takes in total?
In that case, %time and get_memory_usage would probably give you the
answer.
Best regards,
Simon
--
You received this message
Note that you don't need root access. In fact, it is recommended AGAINST
building Sage as root, which is also mentioned in the installation guide
(i.e., the pointer above).
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-suppo
and correctly, saving/loading individual objects is supposed to
be backwards compatible. But saving whole sessions (which I never tried and
even didn't know that it exists in Sage, btw.) probably not. There are
systems (such as GAP), in which one can save the whole session but cannot
save i
2
...
- Stop and remove the docker container.
Would you recommend a different solution?
Best regards,
Simon
On 2019-07-30, Simon King wrote:
> Nathan,
>
> On 2019-07-29, Nathan Dunfield wrote:
>> You can start a container and open a shell on it via:
>>
>> doc
*
ImportError: No module named sage.all
The same command works after waiting long enough.
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an e
sage'
Makefile:31: recipe for target 'all-toolchain' failed
make: *** [all-toolchain] Error 2
Why is that? "sage -i meataxe" did work before (at least with
"cocker container run ...")
Best regards,
Simon
--
You received this message because you are subscribe
Hi,
The post you are replying to is about 9 years old. Meanwhile, it is (I
think) recommended to not use the legacy Sage notebook (sagenb), but use
jupyter.
So, do you really have the problem of converting a Sage notebook, or a
jupyter worksheet?
Best regards,
Simon
On 2019-07-23, '
ger is: Create a matrix over a non-prime finite field
of size <255 in odd characteristic.
Anyway, I created #28188 and would appreciate getting some explanation
on the specific situation on CoCalC and some feedback on the potential
ways out (such as: Keep the arithmetic tables in memory, not on d
characteristic (in characteristic 2, M4RIE is
used).
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-support+unsubscr...@goo
It is just that the
installation relies on a contract that is broken on CoCalc (if missing
write permission to DOT_SAGE is the problem).
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and s
Hi Dima,
On 2019-07-12, Dima Pasechnik wrote:
> Hi Simon,
> isn't MeatAxe interfaced via a library, rather than via files?!
> Doing arithmetics on small matrices storing them on a disk is insanely
> inefficient...
Maybe. Do you mean one should instead compute a new multip
Hi Harald,
On 2019-07-12, Harald Schilly wrote:
> On Friday, July 12, 2019 at 11:48:40 AM UTC+2, Simon King wrote:
>>
>> sage: DOT_SAGE
>> '/home/king/.sage/'
>
> It's
>
> sage: DOT_SAGE
> '/home/user/.sage/'
Do you literally m
;
sage: !ls /home/king/.sage/meataxe
p002.zzz p005.zzz p013.zzz p025.zzz p064.zzz p125.zzz p243.zzz
p003.zzz p007.zzz p017.zzz p027.zzz p081.zzz p127.zzz
p004.zzz p009.zzz p019.zzz p049.zzz p121.zzz p169.zzz
Best regards,
Simon
--
You received this message because you are subscribed
ice possibility (assuming that you do want to create a symbolic
function based on cotangent function) is this:
sage: f(x) = cot(pi*x)
sage: f
x |--> cot(pi*x)
sage: f(3)
Infinity
sage: f(3/2)
0
sage: f(3/4)
-1
Hope that I understood and answered your question.
Best regards,
)
sage: P.gen(0)
z0
sage: P.inject_variables()
Defining z0, z1, z2, z3, z4
(the latter only in an interactive session) suites your needs better.
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
sage: f(x,y) = x^2+y
x and y are virginally conceived by the symbolic ring through the power
of the preparser, which is commonly accepted by SageMath's followers.
However, the scripture does not assert that the symbolic ring is free of
sin (bugs), and thus not all followers agree on the im
Hi Emmanuel,
On 2019-03-20, Emmanuel Charpentier wrote:
> Nice one, Simon ! I'm sorely tempted to mark is as "best answer":-)...
No, it was off-topic. But when a question is raised, I generally try to
answer.
Cheers,
Simon
--
You received this message because you are subscr
ex.html
you find further tutorials "Symbolics and Plotting" and "Advanced-2D
Plotting".
And of course, the reference manual
http://doc.sagemath.org/html/en/reference/index.html
contains chapters on 2D and 3D graphics.
Best regards,
Simon
>
>
> Thank you
>
>
*any* sin, including the sins of Adam and Eve).
The dogma of "virginal conception" says that Mary conceived Jesus
although she was virgin.
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe fro
> you wouldn't have this problem and it should be easy enough to change in
> the preparsesr.
By "problem" you mean that f(x,y)=x+y^2 creates symbolic variables
called x and y? I don't think that's a problem, but a useful feature.
Best regards,
Simon
--
You r
)
is standard Python behaviour, the other examples work because Sage uses
a preparser to make it possible to use nicer syntax in maths:
f(x) = x^2
is a lot more concise and easier to understand for non-programmers than
__tmp__=var("x"); f = symbolic_expression(x**Integer(2)).function
tions in a.
> That is probably the "right" way to do it.
Probably!
> But I wish there were a simpler way.
Why do you think using a sub-optimal far too general tool (e.g., symbolic
variables when in fact the problem is about polynomial) is "simpler"?
Best regards,
Simo
f in fact
the returned GB is not always reduced) or in caching (if it *is* the
reduced GB and isn't cached).
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving e
ue, hence, they should
be cached independently of the algorithm used to compute them. But some
algorithms would only call *some* Gröbner basis, no *the* reduced
Gröbner basis. So, in these cases it makes sense to not automatically
cache the value.
Best regards,
Simon
--
You received this message
.rings.power_series_ring import PowerSeriesRing
R = PowerSeriesRing(QQ, 't')
t = R.gen()
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from
esting. I often tell people to only use symbolic expressions when it
is really needed --- and I thought that in this particular case the
usage of symbolic expressions is appropriate. But you showed that again
using a more specialised tool is better.
Cheers,
Simon
--
You received this message becaus
PS:
On 2018-12-30, Simon King wrote:
> It surprises me that .series(x,6) has a pole (after all, LargeSchroeder's
> discontinuity in x=0 seems removable), so perhaps it's a bug, but
> perhaps it's a feature after all --- I cannot tell from the documentation
> if it i
rises me that .series(x,6) has a pole (after all, LargeSchroeder's
discontinuity in x=0 seems removable), so perhaps it's a bug, but
perhaps it's a feature after all --- I cannot tell from the documentation
if it is intended or not.
Best regards,
Simon
--
You received this mess
On 2018-12-15, Simon King wrote:
> It's not an error but a warning. The absence of a warning doesn't mean
> that the result is more trustworthy than a result of a computation that
> doesn't create a warning.
Ooops, one negation too many. I meant to say: "The abse
uess it's a general advice in numerical computations to do cross
verifications
in order to assess the validity of the result.
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and s
On 2018-12-09, Marc Mezzarobba wrote:
> Simon King wrote:
>> What about
>> a more complicated recurrence, such as the one given by
>> x_(n+1) = 1 + x_n*2/n
>> Any chances to solve those and similar recurrences automatically?
>
> You can try sympy's rsolve()
s *can* to some extent be
computed in Sage:
sage: var('k', domain='integer')
k
sage: sum(x^k*(k+1)/(k+2), k,0,Infinity)
(x*(log(-x + 1) - 1) - log(-x + 1))/(x^3 - x^2)
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
formula x_n = 2^n.
I was just wondering if Sage could do such deductions more or less
automatically (and: how).
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving em
Hi Samuel,
thank you for all the links!
Best regards,
Simon
On 2018-12-07, slelievre wrote:
> Fri 2018-12-07 13:56:34 UTC+1, Simon King:
>
>> Let x_0 be given, let f be a function defining a sequence (x_0,x_1,...)
>> recursively by x_{n+1}=f(x_n).
>>
>> Is the
ise.
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-support+unsubscr...@googlegroups.com.
To post to this group, send e
.900]
And you can still do calculus, to some extent:
sage: h.derivative(s)
[ 1 0]
[ 0 -1]
Summary: If you use tools that were designed to work with the mathematical
notions you are using (matrices over polynomial rings),...
sage: type(h)
... then things are mor
t; Do you think it is realistic to use sage as a
> Python library and completely not using sage (as an interpreter) itself?
Sure. If you write code (in the sense of "python or cython module") for
Sage, then you are in fact using Sage as a Python library. To execute it
in Python, I thi
e the same.
In addition to David's answer: range() is just a built-in Python function, thus
returning Python int. If you want a similar function that returns Sage's
"Integer", you may use srange instead.
Best regards,
Simon
--
You received this message because you are su
book*
will be folded and will only be visible when the user clicks
on an appropriate button. I don't know how that could be done in the
Jupyter notebook, but perhaps other people know. A user who decided to
wrongly believe that tracebacks are useless won't be bothered, and a
developer can ea
s week I told my students about the trivial ring (where
1=0).
In any case, in order to track down the bug you encountered, it would
help if you could give us the expression whose integration triggers the
bug.
Best regards,
Simon
--
You received this message because you are subscribed to the Goo
ms
> to get chosen by Maxima at times.
OK, I'll add the example at #21440.
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it,
. Is it a stupid mistake of mine (but then, Wolfram alpha does the
same stupid mistake), is it a known bug, or a new bug (in that case I
should create some ticket, that would probably be my first on calculus...)?
Best regards,
Simon
--
You received this message because you are subscribed to the
function, and that's the same when directly pushing to the
global option stack:
gap> PushOptions(rec(foo:=5));
gap> f();
Original value 55
gap> PopOptions();
gap> f();
Original value failfail
So, that would work as desired.
Best regards,
Simon
--
You received this messa
is defined
in some file that can be read into libgap, and I could easily create
just TWO versions of that function, once with
forceDefiningGenerators=true, and once with
forceDefiningGenerators=false. However, I am asking for the general
picture.
Best regards,
Simon
--
You received this message be
On 2018-09-30, Simon King wrote:
> D) libgap's and gap's methods should have roughly similar semantics
That said: Of course I see the point of designing the libgap interface
in the way it was done: libgap(X), where X is something in Sage, should
return something in libgap that cor
x27;)
'Sym( [ 1 .. 8 ] )'
sage: type(_)
In other words, libgap() behaves roughly like gap.eval()
2. sage: libgap.eval('SymmetricGroup(8)')
Sym( [ 1 .. 8 ] )
sage: gap('SymmetricGroup(8)')
SymmetricGroup( [ 1 .. 8 ] )
In other words, libgap.eval(
last):
...
ValueError: libGAP: Error, Variable: 'f1' must have a value
What to do instead?
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from i
ion 1: Is there an elegant way to access the first generator of G
than G.GeneratorsOfGroup()[0]?
Question 2: Do you think it would be a good idea to provide a libgap.gen
function, so that G.1 would return the first generator of G?
Best regards,
Simon
--
You received this message because you are sub
but G.Order()/N.Order() is 170775.
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-support+unsubscr...@googlegroups.com.
To po
tuff is done in a
custom way anyway -- so, in my unpickling functions I could simply
replace gap by libgap.
It is some work, but hopefully worth-while to do.
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubsc
Hi Dima,
On 2018-09-29, Dima Pasechnik wrote:
> On Sat, Sep 29, 2018 at 9:58 AM Simon King wrote:
>>
>> On 2018-09-29, Simon King wrote:
>> > Too bad: When the error occurs and I adjust the pool size then
>> > afterwards the previously defined objects in gap a
use GAP's
> built-in one, by use the one in ACE GAP package,
> it is much faster and efficient with memory etc.
Is ACE part of the gap_packages spkg? If so: How to use its double coset
unumerator? Note that it is really about DOUBLE cosets. The cosets are
of no real use here.
Best reg
On 2018-09-29, Simon King wrote:
> Too bad: When the error occurs and I adjust the pool size then
> afterwards the previously defined objects in gap are gone.
Additional problem: Even when I increase the memory limit sufficiently,
gap-via-pexpect takes substantially longer than libgap to c
Hi Dima,
On 2018-09-29, Simon King wrote:
> Anyway, using set_gap_memory_pool_size(2*get_gap_memory_pool_size())
> till everything works sounds like a reasonable way out.
Too bad: When the error occurs and I adjust the pool size then
afterwards the previously defined objects in gap ar
xpect has not? That would explain why libgap can do what
gap-via-pexpect can't. But why does my computation work in "sage -gap",
but not in gap-via-pexpect?
Anyway, using set_gap_memory_pool_size(2*get_gap_memory_pool_size())
till everything works sounds like a reasonable way out.
Thank
7;) corresponds to libgap.eval('foo'), not to libgap('foo').
My preferred solution, however, would be to enable gap-via-pexpect. How?
Best regards,
Simon
On 2018-09-29, Simon King wrote:
> Hi!
>
> Let G be the third Conway group, S its Sylow 2-subgroup, and
> N the
p-via-pexpect to the apparently sufficient memory limit used by "sage
-gap")?
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an emai
seeking help).
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-support+unsubscr...@googlegroups.com.
To post to this group,
rds,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-support+unsubscr...@googlegroups.com.
To post to this group, send email to
I guess I'll open a
ticket for it.
Best regards,
Simon
On 2018-07-30, Simon King wrote:
>
> To add to my confusion:
>
> I also have p_group_cohomology installed, which makes extensive use of
> matrix_gfpn_dense. And it still works. More precisely, when I import
> som
So, what the heck is going on there?
Best regards,
Simon
On 2018-07-30, Simon King wrote:
> Hi!
>
> I just met a quite troublesome problem: I have MeatAxe installed in
> Sage, and thus the optional extension sage.matrix.matrix_gfpn_dense was
> available - till 30 minutes ago
e
src/sage/matrix/matrix_gfpn_dense.pyx
-- but still I cannot import the resulting module.
So, what has happened? I am totally puzzled now.
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from thi
new
directory) you could create your own version of Sage (if the
prerequisites are installed in you computer, then "make" and a long
coffee break are enough).
Moreover, "sudo" is definitely not needed to run Sage, and I think is
even adviced against.
Best regards,
Simon
-
PS: I don't know if `algorithm='padic'` would use a parallel computation.
It would certainly make sense.
Am Montag, 16. Juli 2018 18:08:07 UTC+2 schrieb Simon King:
>
> Hi Chandra,
>
> Am Montag, 16. Juli 2018 07:33:03 UTC+2 schrieb chandra chowdhury:
>>
>>
uses Flint). But perhaps it helps in your case.
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-support+unsubscr...@goog
the above polynomial ring: In addition to using
coefficients in GF(2), it hard-codes the relation x^2=x for all
variables x:
sage: R. = BooleanPolynomialRing()
sage: u^2
u
sage: 2*u
0
So, just to be on the safe side: The choice you mention is between very
different rings.
Best reg
l just use the Sage installation on my laptop.
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-support+unsubscr...@googlegrou
> msg = str(msg) + "\n" + distutils_messages
> raise RuntimeError(msg.strip())
Thank you! I'll try to undo that commit till the exercise group is
done...
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-supp
ile)
669 except Exception as msg:
670 msg = str(msg) + "\n" + distutils_messages
--> 671 raise RuntimeError(msg.strip())
672
673 if verbose >= 0:
RuntimeError: fileno
What goes wrong?
I'd like to have it solved till the day after tomorro
s added like
this:
g.add_edge(v1,v2)
In your code you basically do the same. Only problem: It seems that
you need to provide the number of vertices during initialisation of g.
But in your code, you add more vertices on the fly, IIRC. But this can
certainly be solved.
Best regards,
Simon
--
Y
graphs/bliss.pyx, it seems easy to modify your
code to directly create a bliss graph.
Cheers,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an e
PS:
On 2018-03-06, Simon King wrote:
> On 2018-03-06, Christian Stump wrote:
> I haven't really been able to work around the bottle neck, but got a
> minor improvement (4%) as follows:
> ...
> And of course using cython helps as well. With the following Cython code, I am
0, -1, -1, 0, -1),
(0, 2, 0, 0, -1, 0, -1, -1),
(0, 2, 0, 0, 0, 0, -2, -1)]
)
###
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, s
ynomial rings but for
non-commutative versions thereof.
Best regards,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-support+unsubscr...@goo
f(x=0)
0
--> one gets yet another solution, the intervall is still too large. Again
smaller:
sage: find_root(f, -1,-0.5)
-0.6282156043130847
sage: f(x=_)
-4.440892098500626e-16
And that was what you were looking for.
Best regards,
Simon
--
You received this message becau
On 2018-02-28, Ralf Stephan wrote:
> On Wednesday, February 28, 2018 at 9:09:04 AM UTC+1, Dima Pasechnik wrote:
>>
>> I would be for dropping 'x' as the only "default" variable (defined at
>> start time).
>>
>
> I agree but does it solve the problem I demonstrated. Can you then add x to
> the mi
1 - 100 of 1114 matches
Mail list logo
