Seminar Details

Automated guessing is a very popular tool in experimental mathematics. Given the first few terms of an infinite sequence, it tries to find a recurrence that the sequence is in some way likely to satisfy. If the sequence under consideration indeed satisfies a recurrence and a sufficient number of initial terms is supplied as input, then the method is bound to find the correct answer. But sufficiently many initial terms are not always available. Together with Christoph Koutschan, we have proposed a variant of the classical method that needs fewer terms and catches some of these cases. We will explain the idea behind this variant and present some conjectures that have been found with the method.