vdelecroix's profile - activity

Then there was probably a problem in the compilation process. If you want a diagnosis you should post the files $SAGE_RO

That is one (non-optimal) way sage: k = GF(2^4) sage: R.<x> = k[] sage: p = x^3 sage: for a in k: ....: print

Note that the following looks correct sage: vector(Ecoords[:]) (x, y, z) I believe that designers of the EuclideanSpa

is_package_installed('bliss') is irrelevant (because outdated). Use sage: from sage.features.bliss import BlissLibrary

Could you give more details about your setup (operating system, how you did install Sage).

Up to the remarks I made in the comments above, the main question is about how to compute rather efficiently P_k(n). The

There is a (not so well advertized) function for that purpose sage: from sage.rings.qqbar import number_field_elements_

There is a (not so well advertized) function for that purpose sage: from sage.rings.qqbar import number_field_elements_

There is a (not so well advertized) function for that purpose sage: from sage.rings.qqbar import number_field_elements_

From the log it seems that your sage is missing maxima. Could you try to run the command maxima(1)?

Up to the remarks I made in the comments above, the main question is about how to compute rather efficiently P_k(n). One

Up to the remarks I made in the comments above, the main question is about how to compute rather efficiently P_k(n). One

Up to the remarks I made in the comments above, the main question is about how to compute rather efficiently P_k(n). One

Up to the remarks I made in the comments above, the main question is about how to compute rather efficiently P_k(n). One

Also for k=2 I found N_k = 1042 rather than the 1024 that you wrote. Possibly you inverted the last two digits?

Note that your second equation makes no sense: all of P_k(n), P_k(n-1) and P_k(n+1) are positive numbers so that the rat

I agree that the question is not Sage specific. However it is not irrelevant to Sage as it is something that could be pr

How to write a p-adic exponent b^k as a Power series in k ? Let $b$ be p-adic number, we write $b$ as a Power series in

Also, your question is not entirely clear. You want the maximal number of pairwise disjoint hamiltonian cycles? I doubt

Also, your question is not entirely clear. You want the maximal number of pairwise disjoint hamiltonian cycles? I doubt

second thing to do is to share the entire cython code together with the command you used to compile.

It is true that we would prefer pairs (A(c,d), B(c,d)) of algebraic functions for this instance. As you said there is a

Your system is an algebraic system that could be solved with variable elimination. The first step consists in building t

Sage 9.5 fails to start just after an installation I have operating system Linux Lite 6.2 that is based on Ubuntu. I ins

Algebraically solving system of nonlinear equations with parameters Hello, I am kind of new to the sage and I would lik

To check the first one sage: bool(diff(F1) == F2^2) True However, I doubt the others are correct as evaluating at a s

Could s.o. help me with Verifying this system of differential equation I would like to verify that these functions : F1

Could s.o. help me with Verifying this system of differential equation I would like to verify that these functions : F1

SageMathCell behaves similarly to Jupyter: the output of a cell is the result of the last command in that cell. If you w

cryptography and cyprtography are not quite the same

It would have been easier to debug with the name cleanup of the branch you are working on rather than describing partial

It is not allowed (but not very well documented) to have a cython file zeroforcing/fastqueue/fastqueue.pyx in order to c

Is your question related to SageMath? Do you know about the Chinese Remainder Theorem?

Even PolynomialRing(QQ, 'x').tensor_square() is broken.

The fix is incorporated in sage 9.3!