Decision Problems for P-finite Sequences

Speaker(s)

George Kenison

Affiliation

Liverpool John Moores University

Language of the talk

English

Date

July 23, 2025, 2:15 p.m.

Room

room 5440

Title in Polish

Decision Problems for P-finite Sequences

Seminar

Seminar Automata Theory

---

This talk will discuss the algorithmic analysis of the class of P-finite sequences.  These sequences satisfy linear recurrence relations with polynomial coefficients and are common across the quantitative sciences (examples include the Fibonacci, Motzkin, Harmonic, and Catalan numbers).   We shall focus on computational aspects and their relevance to basic verification problems, such as termination and reachability. Time permitting, we will give some of the mathematical context for these problems, discuss recent progress, and highlight unsolved cases.

---