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

DOI10.1016/S0747-7171(02)00134-7MaRDI QIDQ1401152zbMATH OpenOpenAlexFDO

Authors Rosemary Baines, P. Vámos

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

constructible set of prime idealsGröbner basis over the integersmatroidset of characteristicssolvable system of multivariate polynomials

Mathematics Subject Classification ID

Factorization (11Y05) 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)

Review text

The question considered in the paper under review is: For a given system of multivariate polynomials with integer coefficients, what are the possible characteristics of fields where this system is solvable? The problem is prompted by and has applications in matroid theory. The authors use the Gröbner bases theory over the integers to provide an algorithm to find this set \(\chi (F)\) for any specific system \(F\). Moreover, they demonstrate that either \(\chi (F)\) is finite and does not contain \(0\), or \(0 \in \chi (F)\) and only finitely many primes are missing from \(\chi (F)\). In the final appendix of the paper it is shown that the result can be proved in a more abstract context (constructible sets of prime ideals in affine algebras over Noetherian domains of Krull dimension 1).

Recommendations

• Characteristic set algorithms for equation solving in finite fields
• Solving linear systems of equations over integers with Gröbner bases
• Solving polynomial systems in integers
• Zero decomposition algorithms for systems of polynomial equations
• A nonlinear algebraic matroid with infinite characteristic set

Cites work

• Characteristic Sets of Matroids
• Grobner bases and extension of scalars
• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 3582166 (Why is no real title available?)
• scientific article; zbMATH DE number 3588677 (Why is no real title available?)
• scientific article; zbMATH DE number 704831 (Why is no real title available?)
• scientific article; zbMATH DE number 3334305 (Why is no real title available?)
• scientific article; zbMATH DE number 3351601 (Why is no real title available?)
• Lifting standard bases in filtered structures
• MATROID REPRESENTATIONS—AN ALGEBRAIC TREATMENT
• Note on Independence Functions

Cited in

(5)

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

Describes a project that uses

Uses Software

• Macaulay2

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

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