×

Finding numerical solutions of Diophantine equations using ant colony optimization. (English) Zbl 1304.11138

Summary: The paper attempts to find numerical solutions of Diophantine equations, a challenging problem as there are no general methods to find solutions of such equations. It uses the metaphor of foraging habits of real ants. The ant colony optimization based procedure starts with randomly assigned locations to a fixed number of artificial ants. Depending upon the quality of these positions, ants deposit pheromone at the nodes. A successor node is selected from the topological neighbourhood of each of the nodes based on this stochastic pheromone deposit. If an ant bumps into an already encountered node, the pheromone is updated correspondingly. A suitably defined pheromone evaporation strategy guarantees that premature convergence does not take place. The experimental results, which compares with those of other machine intelligence techniques, validate the effectiveness of the proposed method.

MSC:

11Y50 Computer solution of Diophantine equations
90C59 Approximation methods and heuristics in mathematical programming
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] Abraham, S.; Sanglikar, M., A Diophantine equation solver-a genetic algorithm application, Mathematical Colloquium Journal, 15 (2001)
[2] Abraham, S.; Sanyal, S.; Sanglikar, M., An Application of Reciprocally Induced Co-Evolution In Mathematics, (Enachescu, Calin; Gheorghe Fillip, Florin; Iantovics, Barna, Advanced Computational Technologies, Chapter 23, pp. 279-290 (2013), Romanian Academy Publishing House), 258-267
[4] Abraham, S.; Sanyal, S.; Sanglikar, M., A connectionist network approach to find numerical solutions of Diophantine equations, International Journal of Engineering Sciences and Management, III, I, 73-81 (2013)
[7] Abraham, S.; Sanyal, S.; Sanglikar, M., Particle swarm optimization based Diophantine equation solver, International Journal of Bio-Inspired Computation, 2, 2 (2010)
[9] Bag, A. K., Mathematics in Ancient and Medieval India (1979), Chaukhambha Orientalia: Chaukhambha Orientalia Delhi · Zbl 1405.01012
[10] Bashmakova, I., Diophantus and Diophantine Equations (1997), Mathematical Association of America · Zbl 0883.11001
[11] Brown, E.; Myers, B., Elliptic curves from Mordell to Diophantus and Back, The Mathematical Association of America Monthly, 109, 639-649 (2002) · Zbl 1083.11037
[12] Cohen, H., Number Theory, Vol. I: Tools and Diophantine Equations and Vol. II: Analytic and Modern Tools (2007), Springer-Verlag
[13] Davis, M., Hilbert’s tenth problem is unsolvable, Computability and Unsolvability (1982), Dover: Dover New York, Appendix 2, 199-235
[14] Dorigo, M.; Maniezzo; Vand Coloroni, A., Ant system: optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man, and Cybernetics-Part B, 26, 1, 29-41 (1996)
[15] Dorigo, M.; Gambardella, L. M., Ant colony system: a cooperative learning approach to the traveling salesman problem, IEEE Transactions on Evolutionary Computation, 1, 1, 53-66 (1997)
[16] Dorigo, M.; Blum, Christian, Ant colony optimization theory: a survey, Theoretical Computer Science, 344, 2-3, 243-278 (2005) · Zbl 1154.90626
[17] Dorigo, M.; Stutzle, T., Ant Colony Optimization (2006), Prentice Hall India · Zbl 1092.90066
[18] Edwards, H. M., Fermat’s Last Theorem: A Genetic Introduction to Algebraic Number Theory (1977), Springer-Verlag
[19] Guarari, E. M., Two way counter machines and Diophantine equations, Journal of ACM, 29, 3 (1982)
[21] Hills, W. D., Co-evolving parasites improve simulated evolution as an optimization procedure, Artificial Life, 2 (1992), Addison Wesley
[23] Ibarra, O. H.; Dang, Zhe., On two ways FA with monotone counters and quadratic Diophantine equations, Theoretical Computer Science, 312, 2-3 (2004)
[24] Joya, G.; Atencla, M. A.; Sandoval, F., Application of higher order Hopfield neural networks to the solution of Diophantine equation, Lecture Notes in Computer Science, vol. 540 (1991), Springer Berlin/Heidelberg
[25] Koblitz, N., Introduction to Elliptic Curves and Modular Forms (1984), Springer-Verlag · Zbl 0553.10019
[26] Laih, C. S.; Gao, M. J., Cryptanalysis of Diophantine equation oriented public key cryptosystem, IEEE Transactions on Computers, 46 (1997) · Zbl 1361.94042
[27] Lin, C. H.; Chang, C. C.; Lee, R. X.T., A new public-key cipher system based upon Diophantine equations, IEEE Transactions on Computers, 44 (1995) · Zbl 1061.68530
[28] Matiyasevich, Y. V., Hilbert’s Tenth Problem (1993), MIT press · Zbl 0790.03009
[29] Michalewich, Z., GA+Data Structures=Evaluation Programs (1992), Springer Verlag
[30] Paredis, J., Coevolutionary computation, Artificial Life Journal, 2, 3 (1996)
[32] Rosin, C. D.; Belew, R. K., New methods for competitive coevolution, Evolutionary Computation, 5, 1, 1-29 (1997)
[33] Russell, S.; Norwig, P., Artificial Intelligence - A Modern Approach (2003), Pearson Publication
[34] Shirali, S.; Yogananda, C. S., Fermat’s last theorem: a theorem at last, Number Theory: Echoes from Resonance (2003), University Press
[35] Stroeker, R. J.; Tzanakis, N., Solving elliptic Diophantine equations by estimating linear forms in elliptic logarithms, Acta Arithmetica, 67, 2 (1994) · Zbl 0805.11026
[37] Tzen, T. H.; Ni, L. M., Trapezoid self-scheduling: a practical scheduling scheme for parallel compilers, IEEE Transactions on Parallel Distributed Systems, 4, 1, 87-98 (1993)
[38] Velu, P. K., Computable Economics: The Arne Memorial Lecture Series (2000), Oxford University Press
[41] Zuckerman, N., An Introduction to the Theory of Numbers (1980), Wiley Publication
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.