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

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Standard

An algorithm to compute certain euler characteristics and chern-schwartz-macpherson classes. / Helmer, Martin.

Proceedings of the 2014 Symposium on Symbolic-Numeric Computation, SNC 2014. Association for Computing Machinery, Inc., 2014. p. 130-131.

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Harvard

Helmer, M 2014, An algorithm to compute certain euler characteristics and chern-schwartz-macpherson classes. in Proceedings of the 2014 Symposium on Symbolic-Numeric Computation, SNC 2014. Association for Computing Machinery, Inc., pp. 130-131, 2014 Symposium on Symbolic-Numeric Computation, SNC 2014, Shanghai, China, 28/07/2014. https://doi.org/10.1145/2631948.2631972

APA

Helmer, M. (2014). An algorithm to compute certain euler characteristics and chern-schwartz-macpherson classes. In Proceedings of the 2014 Symposium on Symbolic-Numeric Computation, SNC 2014 (pp. 130-131). Association for Computing Machinery, Inc.. https://doi.org/10.1145/2631948.2631972

Vancouver

Helmer M. An algorithm to compute certain euler characteristics and chern-schwartz-macpherson classes. In Proceedings of the 2014 Symposium on Symbolic-Numeric Computation, SNC 2014. Association for Computing Machinery, Inc. 2014. p. 130-131 https://doi.org/10.1145/2631948.2631972

Author

Helmer, Martin. / An algorithm to compute certain euler characteristics and chern-schwartz-macpherson classes. Proceedings of the 2014 Symposium on Symbolic-Numeric Computation, SNC 2014. Association for Computing Machinery, Inc., 2014. pp. 130-131

Bibtex

@inproceedings{32f2b7fb5c674baf925ecaf34d750cf9,
title = "An algorithm to compute certain euler characteristics and chern-schwartz-macpherson classes",
abstract = "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.",
keywords = "Chern-Schwartz-MacPherson class, Computational intersection theory, Computer algebra, Euler characteristic, Segre class",
author = "Martin Helmer",
year = "2014",
doi = "10.1145/2631948.2631972",
language = "English",
isbn = "9781450329637",
pages = "130--131",
booktitle = "Proceedings of the 2014 Symposium on Symbolic-Numeric Computation, SNC 2014",
publisher = "Association for Computing Machinery, Inc.",
note = "2014 Symposium on Symbolic-Numeric Computation, SNC 2014 ; Conference date: 28-07-2014 Through 31-07-2014",

}

RIS

TY - GEN

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

AU - Helmer, Martin

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - Chern-Schwartz-MacPherson class

KW - Computational intersection theory

KW - Computer algebra

KW - Euler characteristic

KW - Segre class

UR - http://www.scopus.com/inward/record.url?scp=84906319198&partnerID=8YFLogxK

U2 - 10.1145/2631948.2631972

DO - 10.1145/2631948.2631972

M3 - Article in proceedings

AN - SCOPUS:84906319198

SN - 9781450329637

SP - 130

EP - 131

BT - Proceedings of the 2014 Symposium on Symbolic-Numeric Computation, SNC 2014

PB - Association for Computing Machinery, Inc.

T2 - 2014 Symposium on Symbolic-Numeric Computation, SNC 2014

Y2 - 28 July 2014 through 31 July 2014

ER -

ID: 183131705