کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
11008019 1840488 2019 18 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Computing the monodromy and pole order filtration on Milnor fiber cohomology of plane curves
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
Computing the monodromy and pole order filtration on Milnor fiber cohomology of plane curves
چکیده انگلیسی
We describe an algorithm computing the monodromy and the pole order filtration on the Milnor fiber cohomology of any reduced projective plane curve C. The relation to the zero set of Bernstein-Sato polynomial of the defining homogeneous polynomial for C is also discussed. When C has some non-weighted homogeneous singularities, then we have to assume that a conjecture holds in order to get some of our results. In all the examples computed so far this conjecture holds.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Symbolic Computation - Volume 91, March–April 2019, Pages 98-115
نویسندگان
, ,