Skip to main content
Log in

Effective solution of linear Diophantine equation systems with an application in chemistry

  • Published:
Journal of Mathematical Chemistry Aims and scope Submit manuscript

Abstract

Systematic methods of the solution of linear Diophantine systems of equations and their application in decomposing complex chemical reactions are presented. The Contejean–Devie algorithm is improved. A new, linear programming based enumerative algorithm is described, which is applicable to large systems with large solutions. Mathematica implementations are tested and compared in important chemical examples.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Tomlin A.S., Turányi T., Pilling M.J. Mathematical tools for the construction, investigation and reduction of combustion mechanisms. In: eds. R.G. Compton and G. Hancock, Comprehensive Chemical Kinetics (35), (Elsevier, 1997) pp. 293–437.

  2. Contejean E., Devie H. (1994). An efficient incremental algorithm for solving systems of linear Diophantine equations, Inform. Comput. 113:143–172

    Google Scholar 

  3. D. Lichtblau, Revisiting Strong Gröbner Bases over Euclidean Domains, (Wolfram Research, Inc., 2001).

  4. Smart N. (1988). The Algorithmic Resolution of Diophantine Equations. Cambridge UP, Cambridge

    Google Scholar 

  5. de Weger B.M.M. (1989). Algorithms for Diophantine equations. CWI, Amsterdam

    Google Scholar 

  6. Szalkai I. (2000). A new general algorithmic method in reaction syntheses using linear algebra. J. Math. Chem. 28:1–34

    Article  CAS  Google Scholar 

  7. Érdi P., Tóth J. Mathematical Models of Chemical Reactions, Theory and Applications of Deterministic and Stochastic Models (Manchester UP, Manchester, Princeton UP, Princeton, 1989).

  8. Papadimitriou C.H. (1994). Computational Complexity. Addison–Wesley, New York

    Google Scholar 

  9. Domenjoud E. (1991). Solving systems of linear Diophantine equations: An algebraic approach. Math. Found. Comp. Sci. LNCS 520:141–150

    Google Scholar 

  10. L. Pottier, Minimal solutions of linear diophantine systems: bounds and algorithms, in: Proceedings of 4th Conference on Rewriting Techniques and Applications, Como, Italy, ed. R.V. Book LNCS 488, pp.162–173.

  11. Kovács L.B. (1980). Combinatorial Methods of Discrete Programming. Akadémiai Kiadó, Budapest

    Google Scholar 

  12. Kovács K., Vizvári B., Riedel M., Tóth J. (2004). Decomposition of the permanganate/oxalic acid overall reaction to elementary steps based on integer programming theory. Phys. Chem. Chem. Phys. 6:1236–1242

    Article  Google Scholar 

  13. Clarke B.L. (1992). Stoichiometric network analysis of the oxalate–persulfate–silver oscillator. J. Chem. Phys. 97(4): 2459–2472

    Article  CAS  Google Scholar 

  14. Volpert A.I., Chudyaev S.I. (1975). Analysis in Classes of Discontinuous Functions and the Equations of Mathematical Physics. Nauka, Moscow

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dávid Papp.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Papp, D., Vizvári, B. Effective solution of linear Diophantine equation systems with an application in chemistry. J Math Chem 39, 15–31 (2006). https://doi.org/10.1007/s10910-005-9001-9

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10910-005-9001-9

Keywords

AMS Subject Classification

Navigation