Volume 4, Issue 2 (Vol. 4, No. 2 2018)
mmr 2018, 4(2): 133-152 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Behboodi1 M, Asgari S, Moradzadeh-Dehkordi A, Hashemi1 A. Solving System of Linear Congruence Equations over some Rings by Decompositions of Modules. mmr 2018; 4 (2) :133-152
URL: http://mmr.khu.ac.ir/article-1-2617-en.html
URL: http://mmr.khu.ac.ir/article-1-2617-en.html
1- Department of Mathematical Sciences, Isfahan University of Technology, Isfahan, Iran
2- School of Mathematics, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran
3- Faculty of Basic Sciences, University of Shahreza, Isfahan, Iran
4- Department of Mathematical Sciences, Isfahan University of Technology, Isfahan, Iran ,amir.hashemi@ipm.ir
2- School of Mathematics, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran
3- Faculty of Basic Sciences, University of Shahreza, Isfahan, Iran
4- Department of Mathematical Sciences, Isfahan University of Technology, Isfahan, Iran ,
Abstract: (3265 Views)
In this paper, we deal with solving systems of linear congruences over commutative CF-rings. More precisely, let R be a CF-ring (every finitely generated direct sum of cyclic R-modules has a canonical form) and let I_1,..., I_n be n ideals of R. We introduce congruence matrices theory techniques and exploit its application to solve the above system. Further, we investigate the application of computer algebra techniques (Gröbner bases) in this context whenever R = Z../files/site1/files/42/2Abstract.pdf
Type of Study: S |
Subject:
alg
Received: 2017/04/20 | Revised: 2019/04/22 | Accepted: 2018/01/7 | Published: 2019/01/14 | ePublished: 2019/01/14
Received: 2017/04/20 | Revised: 2019/04/22 | Accepted: 2018/01/7 | Published: 2019/01/14 | ePublished: 2019/01/14
Send email to the article author
| Rights and permissions | |
 |
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |
