AbstractWe discuss an algorithm computing the push-forward to projective space of several classes associated to a (possibly singular, reducible, non-reduced) projective scheme. For example, the algorithm yields the topological Euler characteristic of the support of a projective scheme S, given the homogeneous ideal of S. The algorithm has been implemented in Macaulay2
This thesis is in 4 separate parts, of which Chapters 1 and 2. form the first part, and Chapters 3,4...
We provide a generalization of the algorithm of Eklund, Jost and Peterson for computing Segre classe...
AbstractThe notion of a projective system, defined as a set X of n-points in a projective space over...
AbstractWe discuss an algorithm computing the push-forward to projective space of several classes as...
In this thesis we develop several new algorithms to compute characteristics classes in a variety of ...
AbstractWe here develop some new algorithms for computing several invariants attached to a projectiv...
We describe a new algorithm for computing Whitney stratifications of complex projective varieties. T...
AbstractThis article deals with algorithmic and structural aspects related to the computer-aided stu...
This article first presents two examples of algorithms that extracts information on scheme out of it...
We introduce localization and sheaves to define projective schemes, and in particular the projective...
This thesis consists of two parts, a first part on computations in algebraic geometry, and a second ...
The Euler class program was outlined, by M. V. Nori around 1990, as a possible obstruction theory fo...
A classical approach to investigate a closed projective scheme $W$ consists of considering a ge\-...
We introduce the notion of a projective hull for subsets of complex projective varieties parallel to...
Abstract. We provide a generalization of the algorithm of Eklund–Jost– Peterson for computing Segre ...
This thesis is in 4 separate parts, of which Chapters 1 and 2. form the first part, and Chapters 3,4...
We provide a generalization of the algorithm of Eklund, Jost and Peterson for computing Segre classe...
AbstractThe notion of a projective system, defined as a set X of n-points in a projective space over...
AbstractWe discuss an algorithm computing the push-forward to projective space of several classes as...
In this thesis we develop several new algorithms to compute characteristics classes in a variety of ...
AbstractWe here develop some new algorithms for computing several invariants attached to a projectiv...
We describe a new algorithm for computing Whitney stratifications of complex projective varieties. T...
AbstractThis article deals with algorithmic and structural aspects related to the computer-aided stu...
This article first presents two examples of algorithms that extracts information on scheme out of it...
We introduce localization and sheaves to define projective schemes, and in particular the projective...
This thesis consists of two parts, a first part on computations in algebraic geometry, and a second ...
The Euler class program was outlined, by M. V. Nori around 1990, as a possible obstruction theory fo...
A classical approach to investigate a closed projective scheme $W$ consists of considering a ge\-...
We introduce the notion of a projective hull for subsets of complex projective varieties parallel to...
Abstract. We provide a generalization of the algorithm of Eklund–Jost– Peterson for computing Segre ...
This thesis is in 4 separate parts, of which Chapters 1 and 2. form the first part, and Chapters 3,4...
We provide a generalization of the algorithm of Eklund, Jost and Peterson for computing Segre classe...
AbstractThe notion of a projective system, defined as a set X of n-points in a projective space over...
DOI
Add to ORKG