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

被引：7
|
作者：
Baines, R [1 ]
Vámos, P [1 ]
机构：
[1] Univ Exeter, Sch Math Sci, Exeter EX4 4QE, Devon, England
来源：
JOURNAL OF SYMBOLIC COMPUTATION | 2003年 / 35卷 / 03期
关键词：
D O I：
10.1016/S0747-7171(02)00134-7
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We describe a (finite) algorithm to determine the set of characteristics of a system of polynomial equations with integer coefficients by using the theory of Grobner bases. This gives us a proof that the set of characteristics must be either finite and not containing zero, or containing zero and co-finite. Another, algebraic, proof of this is given in the appendix. These results carry over to systems of polynomial equations over a principal ideal domain and also yields an algorithm for finding the characteristic set of a matroid. (C) 2003 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码：269 / 279
页数：11
相关论文
共 50 条
  • [1] AN ALGORITHM TO COMPUTE A PRIMARY DECOMPOSITION OF MODULES IN POLYNOMIAL RINGS OVER THE INTEGERS
    Idrees, Nazeran
    Pfister, Gerhard
    Sadiq, Afshan
    [J]. STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 2015, 52 (01) : 40 - 51
  • [2] AN EFFECTIVE ALGORITHM FOR DECIDING THE SOLVABILITY OF A SYSTEM OF POLYNOMIAL EQUATIONS OVER p-ADIC INTEGERS
    Chistov, A. L.
    [J]. ST PETERSBURG MATHEMATICAL JOURNAL, 2022, 33 (06) : 1011 - 1033
  • [3] An algorithm for primary decomposition in polynomial rings over the integers
    Pfister, Gerhard
    Sadiq, Afshan
    Steidel, Stefan
    [J]. CENTRAL EUROPEAN JOURNAL OF MATHEMATICS, 2011, 9 (04): : 897 - 904
  • [4] AN ALGORITHM FOR CONSTRUCTING THE BASIS OF THE SOLUTION SET FOR SYSTEMS OF LINEAR DIOPHANTINE EQUATIONS OVER THE RING OF INTEGERS
    Kryvyi, S. L.
    [J]. CYBERNETICS AND SYSTEMS ANALYSIS, 2009, 45 (06) : 875 - 880
  • [5] Approximate polynomial GCD over integers
    Nagasaka, Kosaku
    [J]. JOURNAL OF SYMBOLIC COMPUTATION, 2011, 46 (12) : 1306 - 1317
  • [6] Lattices over Eisenstein Integers for Compute-and-Forward
    Tunali, Nihat Engin
    Narayanan, Krishna R.
    Boutros, Joseph J.
    Huang, Yu-Chih
    [J]. 2012 50TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2012, : 33 - 40
  • [7] Lattices Over Eisenstein Integers for Compute-and-Forward
    Tunali, Nihat Engin
    Huang, Yu-Chih
    Boutros, Joseph J.
    Narayanan, Krishna R.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (10) : 5306 - 5321
  • [8] WEAKLY MIXING SETS OF INTEGERS AND POLYNOMIAL EQUATIONS
    Konieczny, Jakub
    [J]. QUARTERLY JOURNAL OF MATHEMATICS, 2017, 68 (01): : 141 - 159
  • [9] Polynomial equations for matrices over integers modulo a prime power and the cokernel of a random matrix
    Cheong, Gilyoung
    Liang, Yunqi
    Strand, Michael
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2023, 677 : 1 - 30
  • [10] ON EQUATIONS OVER SETS OF INTEGERS
    Jez, Artur
    Okhotin, Alexander
    [J]. 27TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2010), 2010, 5 : 477 - 488
12345