An algorithm to compute certain euler characteristics and chern-schwartz-macpherson classes

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  • Martin Helmer

Let V be a possibly singular scheme-theoretic global complete intersection subscheme of Pn and assume that V can be written as the intersection of j hypersurfaces such that the intersection of j -1 of the hypersurfaces is smooth (scheme theoretically). Using a result of Fullwood [5] we develop a probabilistic algorithm to compute the Chern-Schwartz-MacPherson class (cSM) and Euler characteristic of V . This algorithm complements existing algorithms by providing performance improvements in the computation of the cSM class and Euler characteristic for schemes having the special structure described above.

Original languageEnglish
Title of host publicationProceedings of the 2014 Symposium on Symbolic-Numeric Computation, SNC 2014
Number of pages2
PublisherAssociation for Computing Machinery, Inc.
Publication date2014
Pages130-131
ISBN (Print)9781450329637
DOIs
Publication statusPublished - 2014
Externally publishedYes
Event2014 Symposium on Symbolic-Numeric Computation, SNC 2014 - Shanghai, China
Duration: 28 Jul 201431 Jul 2014

Conference

Conference2014 Symposium on Symbolic-Numeric Computation, SNC 2014
LandChina
ByShanghai
Periode28/07/201431/07/2014
SponsorAcademy of Mathematics and Systems Science, East China Normal University, et al, National Basic Research Program of China, National Natural Science Foundation of China, Ontario Research Centre for Computer Algebra

    Research areas

  • Chern-Schwartz-MacPherson class, Computational intersection theory, Computer algebra, Euler characteristic, Segre class

ID: 183131705