We refine a result of Dubickas on the maximal multiplicity of the roots of a complex polynomial, and obtain several separability criteria for complex polynomials with large leading coefficient. We also give p-adic analogous results for polynomials with integer coefficients.
%0 Journal Article
%1 CambridgeJournals:8370076
%A Bonciocat, A. I.
%A Bonciocat, N. C.
%A Zaharescu, A.
%D 2011
%J Proceedings of the Edinburgh Mathematical Society (Series 2)
%K complex polynomial roots unread
%N 03
%P 587-598
%R 10.1017/S0013091510000209
%T Bounds for the multiplicities of the roots of a complex polynomial
%U http://dx.doi.org/10.1017/S0013091510000209
%V 54
%X We refine a result of Dubickas on the maximal multiplicity of the roots of a complex polynomial, and obtain several separability criteria for complex polynomials with large leading coefficient. We also give p-adic analogous results for polynomials with integer coefficients.
@article{CambridgeJournals:8370076,
abstract = {We refine a result of Dubickas on the maximal multiplicity of the roots of a complex polynomial, and obtain several separability criteria for complex polynomials with large leading coefficient. We also give p-adic analogous results for polynomials with integer coefficients.},
added-at = {2011-09-08T17:29:20.000+0200},
author = {Bonciocat, A. I. and Bonciocat, N. C. and Zaharescu, A.},
biburl = {https://www.bibsonomy.org/bibtex/20fbd246ac06be6873f2d79e4ef17eb76/drmatusek},
doi = {10.1017/S0013091510000209},
eprint = {http://journals.cambridge.org/article_S0013091510000209},
interhash = {210f6bd8496ad1c7cf2d47d88f6091a0},
intrahash = {0fbd246ac06be6873f2d79e4ef17eb76},
journal = {Proceedings of the Edinburgh Mathematical Society (Series 2)},
keywords = {complex polynomial roots unread},
month = {October},
number = 03,
pages = {587-598},
timestamp = {2012-05-21T13:51:54.000+0200},
title = {Bounds for the multiplicities of the roots of a complex polynomial},
url = {http://dx.doi.org/10.1017/S0013091510000209},
volume = 54,
year = 2011
}