Abstract: We present an algorithm for solving Diophantine equations which are linear in the variables, but non-linear in one parameter. We are looking for the pointwise solutions, i.e., the solutions ...

Abstract: In this paper, we show how to handle linear Diophantine constraints incrementally by using several variations of the algorithm by Contejean and Devie ...

We propose a look ahead technique using linear Diophantine equations to add the appropriate number of instances while maintaining the initial entropy of the nodes. This method can be used to hide one ...

Laboratoire de Mathématiques, Université Blaise-Pascal, Clermont-Ferrand, France. Recall that in 1991 D. Klarner, J.-C. Birget and W. Satterfield in [3] proved that if then the problem is not ...

An American mathematician has cracked part of a problem that had remained unsolved for 64 years. Andrew Booker, Reader of Pure Mathematics at the University of Bristol in the U.K., worked out how to ...