The last coefficient of the Samuel polynomial
J. Ma Muñoz Porras, J. B. Sancho de Salas (1987)
Compositio Mathematica
Similarity:
J. Ma Muñoz Porras, J. B. Sancho de Salas (1987)
Compositio Mathematica
Similarity:
Julien Sebag (2010)
Annales de la faculté des sciences de Toulouse Mathématiques
Similarity:
In this article, we introduce a special class of non complete webs, the . We also study the algebraic and geometric properties of these webs.
Chistov, A.L. (2005)
Zapiski Nauchnykh Seminarov POMI
Similarity:
Mira Bhargava (1964)
Collectanea Mathematica
Similarity:
Akyıldız, Ersan (2004)
Serdica Mathematical Journal
Similarity:
2000 Mathematics Subject Classification: 13P05, 14M15, 14M17, 14L30. Factorization is an important and very difficult problem in mathematics. Finding prime factors of a given positive integer n, or finding the roots of the polynomials in the complex plane are some of the important problems not only in algorithmic mathematics but also in cryptography.
Aleksandar T. Lipkovski (1997)
Zbornik Radova
Similarity:
Dmitri Novikov, Sergei Yakovenko (1999)
Annales de l'institut Fourier
Similarity:
We give an explicit upper bound for the number of isolated intersections between an integral curve of a polynomial vector field in and an algebraic hypersurface. The answer is polynomial in the height (the magnitude of coefficients) of the equation and the size of the curve in the space-time, with the exponent depending only on the degree and the dimension. The problem turns out to be closely related to finding an explicit upper bound for the length of ascending chains...
George R. Kempf (1985)
Compositio Mathematica
Similarity: