User talk:Gcodrut

Welcome!
Hello, Gcodrut, and welcome to Wikipedia! Thank you for your contributions. I hope you like the place and decide to stay. Here are some pages that you might find helpful: I hope you enjoy editing here and being a Wikipedian! Please sign your messages on talk pages using four tildes ( ~ ); this will automatically insert your username and the date. If you need help, check out Questions, ask me on my talk page, or ask your question on this page and then place  before the question. Again, welcome! --D.Lazard (talk) 17:16, 13 October 2012 (UTC)
 * The five pillars of Wikipedia
 * Tutorial
 * How to edit a page and How to develop articles
 * How to create your first article (using the Article Wizard if you wish)
 * Simplified Manual of Style

Your edits in Polynomial greatest common divisor
I have seen with pleasure your edit in Polynomial greatest common divisor, which shows that at least one Wikipedia user has read the section on subresultants that I have added recently. If your are interested in this subject, you will certainly be convinced that Wikipedia is usually poor about the recent developments of effective algebra which have been impulsed by computer algebra. I am working on expanding Wikipedia in this area, but the task is hard and some help would be helpful. Such an help may have various aspects. It may consist in adding new material to Wikipedia, adding lacking references, correcting typo and errors as you did, improving wording, etc.

I hope you will enjoy in helping us.

If you want to answer, have questions or comments, or anything else, you may use your talk page (here): I'll watch it. Sincerely, --D.Lazard (talk) 17:39, 13 October 2012 (UTC)


 * Dear Prof. Lazard,


 * Thank you very much for your comments. I am a math Phd student and my interest in computer algebra stems from the fact that I am currently writing a paper that uses subresultants. But computer algebra is not my main field and my knowledge in the area is rather poor, so I do not know how much help I could provide, certainly very little in adding new material or references. In fact, if I may, I would be very glad if you could provide me with some references, particularly concerning your proof about subresultants. Where can I find a more detailed proof of this fact? Most proofs (those of Collins and Brown and Traub) also contain computations of the coefficients of similarity, but yours is short and elegant. For my purposes I only need the qualitative statement concerning the similarity between the dth subresultant polynomial and the gcd.


 * I would be very thankful for any reference you could provide me in this direction.


 * I wish you all the best, Gcodrut (talk) 10:56, 14 October 2012 (UTC)


 * Even if you are not yet able to expand WP, you are certainly able to correct some mistakes, as you did, or improve the wordings. If you detect something which needs clarification of correction, and you are unable do by yourself, it is also very useful to mention it in the talk page of the article.


 * About the sources: As far as I remember, Loos's paper, cited in the article, does not contain any elegant proof, but this has to be checked. I suggest you to look on the books of computational algebraic geometry listed in Algebraic geometry, especially, the one by Basu, Pollack, and Roy and those by Cox, Little, O'Shea. One of my sources was a textbook (in French) by Arnaudies, Lelong Ferrand which introduced the principal subresultant coefficient without giving its name.


 * Sincerely --D.Lazard (talk) 11:49, 14 October 2012 (UTC)


 * If you find a good reference, please add it to the article.--D.Lazard (talk) 12:31, 14 October 2012 (UTC)