An algorithm to compute the set of characteristics of a system of polynomial equations over the integers.

DOI10.1016/S0747-7171(02)00134-7zbMath1058.13015OpenAlexW1995058913MaRDI QIDQ1401152

Peter Vámos, Rosemary Baines

Publication date: 17 August 2003

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

Full work available at URL: https://doi.org/10.1016/s0747-7171(02)00134-7

zbMATH Keywords

matroidconstructible set of prime idealsGröbner basis over the integersset of characteristicssolvable system of multivariate polynomials

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to commutative algebra (13-04) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Factorization (11Y05)

Related Items (5)

Von Staudt constructions for skew-linear and multilinear matroids ⋮ Confinement of matroid representations to subsets of partial fields ⋮ The templates for some classes of quaternary matroids ⋮ Lifts of matroid representations over partial fields ⋮ An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties

Uses Software

• Macaulay2

Cites Work

• Note on Independence Functions
• MATROID REPRESENTATIONS—AN ALGEBRAIC TREATMENT
• Characteristic Sets of Matroids
• Lifting standard bases in filtered structures
• Grobner bases and extension of scalars
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm to compute the set of characteristics of a system of polynomial equations over the integers.