An algorithm to compute the set of characteristics of a system of polynomial equations over the integers. (Q1401152): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Macaulay2 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lifting standard bases in filtered structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Grobner bases and extension of scalars / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4317713 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: MATROID REPRESENTATIONS—AN ALGEBRAIC TREATMENT / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5626684 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Characteristic Sets of Matroids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5611879 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3135082 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Note on Independence Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4156448 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4152555 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4111952 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 09:46, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An algorithm to compute the set of characteristics of a system of polynomial equations over the integers. |
scientific article |
Statements
An algorithm to compute the set of characteristics of a system of polynomial equations over the integers. (English)
0 references
17 August 2003
0 references
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).
0 references
Gröbner basis over the integers
0 references
set of characteristics
0 references
matroid
0 references
constructible set of prime ideals
0 references
solvable system of multivariate polynomials
0 references