A counterexample to a conjecture on linear systems on .
This paper contains a short and simplified proof of desingularization over fields of characteristic zero, together with various applications to other problems in algebraic geometry (among others, the study of the behavior of desingularization of families of embedded schemes, and a formulation of desingularization which is stronger than Hironaka's). Our proof avoids the use of the Hilbert-Samuel function and Hironaka's notion of normal flatness: First we define a procedure for principalization of...
In this article we describe our experiences with a parallel Singular implementation of the signature of a surface singularity defined by z N + g(x; y) = 0.
We present algorithms and their implementation in the computer algebra system Singular 2.0 for the computation of equations for moduli spaces for semiquasihomogeneous singularities w.r.t. right equivalence. In addition, we describe the structure of the stabilizer group of Brieskorn-Pham singularities.
Let be a germ of a complete intersection variety in , , having an isolated singularity at and be the germ of a holomorphic vector field having an isolated zero at and tangent to . We show that in this case the homological index and the GSV-index coincide. In the case when the zero of is also isolated in the ambient space we give a formula for the homological index in terms of local linear algebra.
Nous montrons dans cet article des bornes pour la régularité de Castelnuovo-Mumford d’un schéma admettant des singularités, en fonction des degrés des équations définissant le schéma, de sa dimension et de la dimension de son lieu singulier. Dans le cas où les singularités sont isolées, nous améliorons la borne fournie par Chardin et Ulrich et dans le cas général, nous établissons une borne doublement exponentielle en la dimension du lieu singulier.
Laminations are classic sets of disjoint and non-self-crossing curves on surfaces. Lamination languages are languages of two-way infinite words which code laminations by using associated labeled embedded graphs, and which are subshifts. Here, we characterize the possible exact affine factor complexities of these languages through bouquets of circles, i.e. graphs made of one vertex, as representative coding graphs. We also show how to build families of laminations together with corresponding lamination...
Nous décrivons dans cet article les algorithmes nécessaires à une implantation efficace de la méthode de Schoof pour le calcul du nombre de points sur une courbe elliptique dans un corps fini. Nous tentons d’unifier pour cela les idées d’Atkin et d’Elkies. En particulier, nous décrivons le calcul d’équations pour , premier, ainsi que le calcul efficace de facteurs des polynômes de division d’une courbe elliptique.