Natural phenomenon of coevolution is the reciprocally induced evolutionary change between two or more species or population. Though this biological occurrence is a natural fact, there are only few attempts to use this as a simile in computation. This paper is an attempt to introduce reciprocally induced coevolution as a mechanism to counter problems faced by a typical genetic algorithm applied ...

In this paper, we completely solve the simultaneous Diophantine equations x − az = 1, y − bz = 1 provided the positive integers a and b satisfy b−a ∈ {1, 2, 4}. Further, we show that these equations possess at most one solutions in positive integers (x, y, z) if b − a is a prime or prime power, under mild conditions. Our approach is (relatively) elementary in nature and relies upon classical re...

We look at Diophantine equations arising from equating classical counting functions such as perfect powers, binomial coefficients and Stirling numbers of the first and second kind. The proofs of the finiteness statements that we give use a variety of methods from modern number theory, such as effective and ineffective tools from Diophantine approximation. As a tool for one part of the statement...

This article centres around the contributions of the author and therefore, it is confined to topics where the author has worked. Between these topics there are connections and we explain them by a result of Liouville in 1844 that for an algebraic number α of degree n ≥ 2, there exists c > 0 depending only on α such that | α− p q |> c qn for all rational numbers p q with q > 0. This inequality i...

The main thrust of this article is to show how complete solutions of quadratic Diophantine equations can be given, for any positive discriminant, in terms of the continued fraction algorithm. This is in response to recent results by Zhang [4]-[6], wherein semi-simple continued fractions were introduced to generalize the well-known fact that solutions of quadratic Diophantine equations with valu...