Linear Recurrences over Function Fields of Positive Characteristic
March 21 – April 1, 2016
Linear recurrence sequences (LRS) appear almost everywhere in mathematics and computer science, and specifically they have fundamental applications in modern cryptography. However, so far we have known little about LRS over function fields, and much less about their wide potential for applications.
In this project, we want to consider two fundamental problems. One is to get a uniform bound for the size of the zero set of such LRS, and the other is to develop algorithms for computing the zero set. This will lay a solid foundation for future study.


Min Sha ( University of New South Wales)
Domingo Gomez Pérez (University of Cantabria)