Your Task 3 seems to target a method indeed
relevant for the exact case (unlike Task 1).
Best regards,
Vincent Neiger
Le mardi 1 avril 2025 à 23:50:15 UTC+2, Pawani Agarwal a écrit :
> Hello Vincent,
>
> I have sent you my proposal directly though I am not sure if you have
> recei
regards,
Vincent Neiger
Le dimanche 23 mars 2025 à 23:35:45 UTC+1, Nicholas Bell a écrit :
> Hello,
>
> I'm Nicholas, currently in my 1st year pursuing a Master of Computer
> Science at Sorbonne Université. I'm new to contributing to SageMath but
> have a little prior
Dear Pawani Agarwal,
Thank you for your interest in this project. Thank you also for your first
contributions to Sagemath. Recall the short description gives ideas for the
project and you, the potential contributor, are expected to turn the ideas
into a detailed proposal.
Best regards,
Vincent
too ambitious for a 12-week project (parallelisation?).
The timeline is too compartmentalized: e.g. a whole part is dedicated to
tests/documentation whereas tests will need to be carried out all along.
Best regards,
Vincent Neiger
Le dimanche 23 mars 2025 à 11:05:54 UTC+1, Yujin Zhao a écrit
Hello,
I just added to the wiki the two projects suggested above. Could you please
have a look to make sure I did not introduce any typo and such? In
particular for the second project, as I created some title and I changed
"genfun" into "gfun" which seems to be the usual name for the Maple libr
A minor comment : from the documentation of Singular it seems that the
output Gröbner basis will be computed with respect to the monomial ordering
of the base ring. So for the specific code snippet given above with the
ring constructed as "Kx.=QQ[]", I would expect step 3 (the actual
change of
Dear all,
No question, no bug report, but just a short report about a SageMath Google
Summer of Code project related to LinBox / FFLAS-FFPACK which was carried
out this summer, by student Marie Bonboire from Sorbonne Université, France.
In short, the goal was to improve as much as possible the
Hello,
The output seems to be the expected one. Can you please clarify what your
question/observation is?
For the first output, 'a' is already reduced w.r.t the DegRevLex Gröbner
basis of the ideal (which happens to be the two provided polynomials in
this case). The behaviour is clearly specif
in the few remaining hours before deadline, sorry for this.
Best regards,
Vincent Neiger
On Tue, 2023-04-04 at 00:32 -0700, Filza Siddiqui wrote:
> Dear GSoC mentors,
> I am writing to request feedback on my GSoC proposal which I submitted for the
> enhancements in linear algebr
d you finalize your application (if you are
still interested).
Best regards,
Vincent Neiger
On Tue, 2023-03-28 at 13:57 -0700, 'Karan Handa' via sage-gsoc wrote:
> Greetings!
>
> I've been working on familiarising myself with with finite field linear
> algebra implemen
Concerning what minimal_approximant_basis returns: this is specified in the
documentation,
http://doc.sagemath.org/html/en/reference/matrices/sage/matrix/matrix_polynomial_dense.html#sage.matrix.matrix_polynomial_dense.Matrix_polynomial_dense.minimal_approximant_basis
but in formal (hence technic
Dear Emmanuel,
You may be interested in taking a look at the following function:
Matrix_polynomial_dense.minimal_approximant_basis
This only supports the univariate case. This solves a problem which
generalizes Padé approximation (the documentation gives a precise
description of what it compute
Le vendredi 18 novembre 2016 04:44:49 UTC+1, Kwankyu Lee a écrit :
> I am not a big fan of the suggested asymptotically best algorithms relying
> on auxiliary tools, which would be hard to implement and gain for small
> matrices might be not much.
>
For sure; I do not know precisely what the th
Le jeudi 17 novembre 2016 21:15:11 UTC+1, Johan S. H. Rosenkilde a écrit :
>
> John Cremona writes:
> > I once used the weak Popov form in a talk with Hendrik Lenstra in the
> > audience and he was quite amused since it appeared to be (and I think
> > he is right) much the same as his brother Ar
Le jeudi 17 novembre 2016 21:15:11 UTC+1, Johan S. H. Rosenkilde a écrit :
>
> John Cremona writes:
> > I once used the weak Popov form in a talk with Hendrik Lenstra in the
> > audience and he was quite amused since it appeared to be (and I think
> > he is right) much the same as his brother Ar
Regarding the original question: is the question specifically about
computing the HNF? Or, is any other canonical form acceptable? (with known
algorithms, it seems that the Popov form would be easier to implement
efficiently than the HNF)
Also, would you have examples of typical dimensions and
16 matches
Mail list logo
