On Monomial Reduction and Polynomial Expressions with Respect to Binomial Ideals

DOI10.1080/00927872.2014.937534zbMath1327.14245OpenAlexW1602242135MaRDI QIDQ3448278

Rostam Sabeti

Publication date: 23 October 2015

Published in: Communications in Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00927872.2014.937534

zbMATH Keywords

computational algebraic geometrydivision algorithmcomponents of solutionspolyhedral method

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Computational aspects of higher-dimensional varieties (14Q15) Polynomials, factorization in commutative rings (13P05)

Related Items (1)

Polynomial expressions for non-binomial structures

Cites Work

• Unnamed Item
• A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic \(n\)-roots
• Binomial ideals
• Numerical-symbolic exact irreducible decomposition of cyclic-12
• Monomial Ideals
• Polyhedral Methods for Space Curves Exploiting Symmetry Applied to the Cyclic n-roots Problem
• Computing Puiseux series for algebraic surfaces

This page was built for publication: On Monomial Reduction and Polynomial Expressions with Respect to Binomial Ideals