Solving systems of polynomial equations over Galois–Eisenstein rings with the use of the canonical generating systems of polynomial ideals

DOI10.1515/156939204774148811zbMath1078.13011OpenAlexW2021371782MaRDI QIDQ4825191

D. A. Mikhailov, Alexander A. Nechaev

Publication date: 27 October 2004

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/156939204774148811

zbMATH Keywords

Gröbner basispolynomial systemsstandard basisfinite commutative chain ringFerrer diagramcanonical generating systemsGalois-Eisenstein rings

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Polynomials and finite commutative rings (13M10)

Related Items (5)

Minimal Gröbner bases and the predictable leading monomial property ⋮ Multiplicative orders on terms ⋮ Finite Rings with Applications ⋮ Класс функций с вариационно-координатной полиномиальностью над кольцом $\mathbb Z_{2^m}$ и его обобщение ⋮ Unnamed Item

Uses Software

• FGb

This page was built for publication: Solving systems of polynomial equations over Galois–Eisenstein rings with the use of the canonical generating systems of polynomial ideals