A direct algorithm to compute the topological Euler characteristic and Chern-Schwartz-MacPherson class of projective complete intersection varieties

Abstract Let V be a possibly singular scheme-theoretic complete intersection subscheme of P n over an algebraically closed field of characteristic zero. Using a recent result of Fullwood (“On Milnor classes via invariants of singular subschemes”, Journal of Singularities) we develop an algorithm to compute the Chern–Schwartz–MacPherson class and Euler characteristic of V. This algorithm complements existing algorithms by providing performance improvements in the computation of the Chern–Schwartz–MacPherson class and Euler characteristic for certain types of complete intersection subschemes of P n .

[1]  Paolo Aluffi.  Computing characteristic classes of projective schemes , 2003, J. Symb. Comput..

[2]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[3]  James Fullwood,et al.  On Milnor classes via invariants of singular subschemes , 2013, 1310.2370.

[4]  Richard Zippel,et al.  Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.

[5]  Johan P. Hansen,et al.  INTERSECTION THEORY , 2011 .

[6]  Mboyo Esole,et al.  Chern Class Identities from Tadpole Matching in Type IIB and F-Theory , 2007, 0710.2544.

[7]  Tatsuo Suwa.  Classes de Chern des intersections complètes locales , 1997 .

[8]  A. Banfi,et al.  Non-global logarithms and jet algorithms in high-pT jet shapes , 2010, 1004.3483.

[9]  Shoji Yokura,et al.  Characteristic classes for singular varieties , 1987 .

[10]  P. Aluffi.  Euler characteristics of general linear sections and polynomial Chern classes , 2012, 1207.6638.

[11]  F. J. Rayner,et al.  An algebraically closed field , 1968, Glasgow Mathematical Journal.

[12]  P. Aluffi,et al.  New orientifold weak coupling limits in F-theory , 2009, 0908.1572.

[13]  June Huh,et al.  The maximum likelihood degree of a very affine variety , 2012, Compositio Mathematica.

[14]  Richard J. Lipton,et al.  A Probabilistic Remark on Algebraic Program Testing , 1978, Inf. Process. Lett..

[15]  P. Aluffi.  Singular schemes of hypersurfaces , 1995 .

[16]  Martin Helmer,et al.  Algorithms to compute the topological Euler characteristic, Chern-Schwartz-MacPherson class and Segre class of projective varieties , 2014, J. Symb. Comput..

[17]  Christine Jost,et al.  An algorithm for computing the topological Euler characteristic of complex projective varieties , 2013, 1301.4128.

[18]  Robert MacPherson,et al.  Chern Classes for Singular Algebraic Varieties , 1974 .

[19]  C. Peterson,et al.  A method to compute Segre classes of subschemes of projective space , 2011, 1109.5895.

[20]  Jonathan D. Hauenstein,et al.  Software for numerical algebraic geometry: a paradigm and progress towards its implementation , 2008 .

[21]  Joe W. Harris,et al.  Algebraic Geometry: A First Course , 1995 .

[22]  Jan Verschelde,et al.  Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation , 1999, TOMS.

[23]  F. Denef,et al.  D-brane Deconstructions in IIB Orientifolds , 2008, 0805.1573.

[24]  Felipe Cucker,et al.  Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets , 2005, Found. Comput. Math..

[25]  Andrew J. Sommese,et al.  The numerical solution of systems of polynomials - arising in engineering and science , 2005 .