2013
DOI: 10.1007/s00209-013-1146-9
|View full text |Cite
|
Sign up to set email alerts
|

Segre classes on smooth projective toric varieties

Abstract: Produced in cooperation with Akademika publishing. The thesis is produced by Akademika publishing merely in connection with the thesis defence. Kindly direct all inquiries regarding the thesis to the copyright holder or the unit which grants the doctorate. Writing this thesis has been a long lasting and challenging task. At the time of its completion it is time to thank everyone who has contributed. First, I would like to thank Professor Ragni Piene for giving me a solid training in mathematics, for introducin… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(11 citation statements)
references
References 40 publications
(132 reference statements)
0
11
0
Order By: Relevance
“…The algorithm of [30] is a generalization of the previous algorithm of Eklund, Jost and Peterson [12] and works by using appropriate saturations to compute the ideals of certain residual schemes and then computing their multi-degrees. The key advantage of our algorithm (Algorithm 1) likely comes from the result of Theorem 3.5 (combined with Theorem 3.4) since this theorem reduces the problem of computing the Segre class of a subscheme to that of finding the number of solutions to certain zero dimensional polynomial systems; a problem for which there are many effective algorithms.…”
Section: Let N = Dim(x σ ) Again Write [Ymentioning
confidence: 99%
See 4 more Smart Citations
“…The algorithm of [30] is a generalization of the previous algorithm of Eklund, Jost and Peterson [12] and works by using appropriate saturations to compute the ideals of certain residual schemes and then computing their multi-degrees. The key advantage of our algorithm (Algorithm 1) likely comes from the result of Theorem 3.5 (combined with Theorem 3.4) since this theorem reduces the problem of computing the Segre class of a subscheme to that of finding the number of solutions to certain zero dimensional polynomial systems; a problem for which there are many effective algorithms.…”
Section: Let N = Dim(x σ ) Again Write [Ymentioning
confidence: 99%
“…In [30] Moe and Qviller give an algorithm to compute the Segre class of subschemes of smooth projective toric varieties. The algorithm of Moe and Qviller [30] is based on a result which gives an expression for the Segre class of a subscheme of a smooth projective toric variety in terms of the classes in the Chow ring of certain residual sets which are computed via saturation.…”
Section: Previous Algorithmsmentioning
confidence: 99%
See 3 more Smart Citations