Numerical computation of the genus of an irreducible curve within an algebraic set
From MaRDI portal
(Redirected from Publication:534004)
Recommendations
- Irreducible decomposition of curves
- Computing the irreducible real factors and components of an algebraic curve
- A Symbolic-Numeric Algorithm for Genus Computation
- Semi-numerical determination of irreducible branches of a reduced space curve
- A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
Cites work
- scientific article; zbMATH DE number 421657 (Why is no real title available?)
- scientific article; zbMATH DE number 747049 (Why is no real title available?)
- A Rank-Revealing Method with Updating, Downdating, and Applications
- A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
- A power series method for computing singular solutions to nonlinear analytic systems
- Adaptive Multiprecision Path Tracking
- Complexity of Bezout's Theorem I: Geometric Aspects
- Complexity of Bezout's theorem. III: Condition number and packing
- Complexity of Bezout's theorem. V: Polynomial time
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- Computing multiple roots of inexact polynomials
- Computing singular solutions to nonlinear analytic systems
- Computing the multiplicity structure in solving polynomial systems
- Newton's method with deflation for isolated singularities of polynomial systems
- Numerical decomposition of the solution sets of polynomial systems into irreducible components
- Regeneration homotopies for solving systems of polynomials
- Smale's 17th problem: average polynomial time to compute affine and projective solutions
- Software for numerical algebraic geometry: a paradigm and progress towards its implementation
- Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- The approximate GCD of inexact polynomials
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Using monodromy to decompose solution sets of polynomial systems into irreducible components
Cited in
(18)- Irreducible decomposition of curves
- Numerically deciding the arithmetically Cohen-Macaulayness of a projective scheme
- A practical algorithm for the computation of the genus
- scientific article; zbMATH DE number 19075 (Why is no real title available?)
- A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
- GENOM3CK: a library for genus computation of plane complex algebraic curves using knot theory
- scientific article; zbMATH DE number 4180354 (Why is no real title available?)
- Computer search for curves with many points among abelian covers of genus 2 curves
- An algebraic study of linkages with helical joints
- Semi-numerical determination of irreducible branches of a reduced space curve
- Global structure of curves from generalized unitarity cut of three-loop diagrams
- A regularization approach for estimating the type of a plane curve singularity
- Some remarks on the computation of Pythagoras numbers of real irreducible algebroid curves through Gram matrices.
- Robust certified numerical homotopy tracking
- Galois groups of Schubert problems via homotopy computation
- Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials
- A Symbolic-Numeric Algorithm for Genus Computation
- Genus calculations of complete intersections
This page was built for publication: Numerical computation of the genus of an irreducible curve within an algebraic set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534004)
