2000 character limit reached
Segre Class Computation and Practical Applications
Published 19 Jun 2018 in math.AG, cs.SC, and math.AC | (1806.07408v4)
Abstract: Let $X \subset Y$ be closed (possibly singular) subschemes of a smooth projective toric variety $T$. We show how to compute the Segre class $s(X,Y)$ as a class in the Chow group of $T$. Building on this, we give effective methods to compute intersection products in projective varieties, to determine algebraic multiplicity without working in local rings, and to test pairwise containment of subvarieties of $T$. Our methods may be implemented without using Groebner bases; in particular any algorithm to compute the number of solutions of a zero-dimensional polynomial system may be used.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.