A note on polynomial reduction

DOI10.1006/JSCO.1993.1045MaRDI QIDQ1314434zbMATH OpenOpenAlexFDO

Authors Bernd Sturmfels, Alyson Reeves

Publication date 28 February 1994

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jsco.1993.1045

zbMATH Keywords

term orderingmarked polynomials

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05)

Recommendations

• A polynomial reduction algorithm
• Publication:4488096
• Reduction and specialization of polynomials
• A note on the reducibility of binary affine polynomials
• Reducibility by means of almost polynomial functions
• Reducibility of polynomials in several variables. II
• Reducibility of polynomials in two variables
• Efficient polynomial reduction
• Reduction among bracket polynomials

Cited in

(14)

• Flat families by strongly stable ideals and a generalization of Gröbner bases
• scientific article; zbMATH DE number 4182020 (Why is no real title available?)
• A Note on Muskhelishvili-Vekua Reduction
• Smoothable Gorenstein points via marked schemes and double-generic initial ideals
• Computing quot schemes via marked bases over quasi-stable modules
• Functors of liftings of projective schemes
• Cotangent spaces and separating re-embeddings
• On the functoriality of marked families
• The close relation between border and Pommaret marked bases
• Strong non-Noetherity of polynomial reduction
• Macaulay-like marked bases
• A general framework for Noetherian well ordered polynomial reductions
• On the reduced length of a polynomial with real coefficients
• Term-ordering free involutive bases

This page was built for publication: A note on polynomial reduction

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