Name
Abstract | ||
|---|---|---|
Let Z@?P^r be a smooth variety of dimension n and let c"0,...,c"n be the Chern classes of Z. We present an algorithm to compute the degree of any monomial in {c"0,...,c"n}. The method is based on intersection theory and may be implemented as a numeric or as a symbolic algorithm. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.jsc.2012.09.003 | J. Symb. Comput. |
Keywords | DocType | Volume |
dimension n,Chern class,symbolic algorithm,smooth variety,intersection theory,Computing intersection number | Journal | 50, |
ISSN | Citations | PageRank |
0747-7171 | 3 | 0.49 |
References | Authors | |
2 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel J. Bates | 1 | 103 | 12.03 |
| David Eklund | 2 | 11 | 2.94 |
| Chris Peterson | 3 | 68 | 10.93 |