21 citations · 93 across the 36 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.AG2017
On supersolvable and nearly supersolvable line arrangements
Alexandru Dimca, Gabriel Sticlaru
We introduce a new class of line arrangements in the projective plane, called nearly supersolvable, and show that any arrangement in this class is either free or nearly free. More…
math.AG2017
Saturation of Jacobian ideals: some applications to nearly free curves, line arrangements and rational cuspidal plane curves
Alexandru Dimca, Gabriel Sticlaru
In this note we describe the minimal resolution of the ideal , the saturation of the Jacobian ideal of a nearly free plane curve . In particular, it follows that this i…
math.AG2017
Computing Milnor fiber monodromy for some projective hypersurfaces
Alexandru Dimca, Gabriel Sticlaru
We describe an algorithm computing the monodromy and the pole order filtration on the top Milnor fiber cohomology of hypersurfaces in whose pole order spectral seque…