An algorithm for intersections in ℙ2[N]
From MaRDI portal
Publication:4977642
Recommendations
- On Fulton’s Algorithm for Computing Intersection Multiplicities
- Intersection-sets in PG(n,2)
- An Algorithmic Analysis of the Intersection Property
- Algorithms for checking zero-dimensional complete intersections
- scientific article; zbMATH DE number 2242531
- Combinatorial algorithms for the interpolation of polynomials in dimension 2
- On the intersection of the curves through a set of points in \(\mathbb P^{2}\)
- On Intersection Problems for Polynomially Generated Sets
Cites work
- 3264 and all that. A second course in algebraic geometry
- Algebraic Families on an Algebraic Surface
- Algebraic Families on an Algebraic Surface, II, the Picard Scheme of the Punctual Hilbert Scheme
- Heisenberg algebra and Hilbert schemes of points on projective surfaces
- On a cell decomposition of the Hilbert scheme of points in the plane.
- On the homology of the Hilbert scheme of points in the plane
Cited in
(4)- Higher codimension cycles on the Hilbert scheme of three points on the projective plane
- On Fulton’s Algorithm for Computing Intersection Multiplicities
- scientific article; zbMATH DE number 1329479 (Why is no real title available?)
- scientific article; zbMATH DE number 7274122 (Why is no real title available?)
This page was built for publication: An algorithm for intersections in ℙ2[N]
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4977642)
