Deterministic normal position transformation and its applications

DOI10.1016/J.TCS.2020.07.025zbMATH Open1456.13017OpenAlexW3044060291MaRDI QIDQ2006776FDOQ2006776

Authors: Benyamin M.-Alizadeh, Amir Hashemi 

Publication date: 12 October 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.07.025

Recommendations

• On general primary decomposition for zero-dimensional ideals
• Efficient Algorithms for Computing Nœther Normalization
• scientific article; zbMATH DE number 4101329
• scientific article; zbMATH DE number 1383108
• Computing the primary decomposition of zero-dimensional ideals

zbMATH Keywords

deterministic algorithmpolynomial idealsshape lemmanormal positionGröbner bases

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Cites Work

• A concise proof of the Kronecker polynomial system solver from scratch
• Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
• Title not available (Why is that?)
• Using Algebraic Geometry
• Numerically solving polynomial systems with Bertini
• Factoring polynomials with rational coefficients
• A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
• Solving zero-dimensional systems through the rational univariate representation
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Gröbner free alternative for polynomial system solving
• Gröbner bases and primary decomposition of polynomial ideals
• The membership problem for unmixed polynomial ideals is solvable in single exponential time
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Gröbner bases of ideals defined by functionals with an application to ideals of projective points
• Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
• Title not available (Why is that?)
• Numerical Polynomial Algebra
• Modern computer algebra
• Solving polynomial equations. Foundations, algorithms, and applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms for computing triangular decomposition of polynomial systems
• Evaluation techniques for zero-dimensional primary decomposition
• Title not available (Why is that?)
• Deterministic genericity for polynomial ideals
• Title not available (Why is that?)
• On the stability of Gröbner bases under specializations
• Title not available (Why is that?)
• Title not available (Why is that?)
• An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
• Title not available (Why is that?)
• A zero structure theorem for polynomial-equations-solving and its applications

Cited In (4)

• DetNorPos.mpl
• AFFINE TRANSFORMATION OF A NORMAL ELEMENT AND ITS APPLICATION
• Regular and in normal position with respect to a variable in a zero-dimensional ideal for recurrent event data
• On general primary decomposition for zero-dimensional ideals

Uses Software

• Kronecker
• Bertini
• ISOLATE

This page was built for publication: Deterministic normal position transformation and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2006776)