George Kenison

About Me

I am an Assistant Professor in the Department of Computer Science at Maynooth University.

My academic interests lie in computational aspects of Algebraic Dynamical Systems and their applications in Verification and Program Analysis. My research primarily investigates the boundary between decidable and undecidable problems.

forename.surname@mu.ie

Interests

Theory of Computation
Algebraic Dynamical Systems
Program Analysis
Automated Verification

Education

PhD in Mathematics, 2017

University of Warwick
Masters of Mathematics, 2013

University of Warwick

Publications and Preprints

P. C. Bell, G. Kenison, R. Niskanen, I. Potapov, P. Semukhin (2026). On Word Representations and Embeddings in Complex Matrices. International Conference on Developments in Language Theory, DLT ‘26.

PDF Cite DOI arXiv

G. Kenison, O. Klurman, E. Lefaucheux, F. Luca, P. Moree, E. C. Sertöz, J. Ouaknine, M. A. Whiteland, J. Worrell (2026). On the Positivity Problem for second-order holonomic sequences.

PDF Cite

R. Ait El Manssour, G. Kenison, M. Shirmohammadi, A.Varonka, J. Worrell (2026). Determination Problems for Orbit Closures and Matrix Groups. Proceedings of the ACM on Programming Languages, POPL'26.

PDF Cite DOI arXiv

G. Kenison, J. Konieczny, F. Luca, A. Scoones, M. Shirmohammadi, J. Worrell (2025). On the growth of hypergeometric sequences.

Cite arXiv

R. Ait El Manssour, G. Kenison, M. Shirmohammadi, A. Varonka (2025). Simple Linear Loops: Algebraic Invariants and Applications. Proceedings of the ACM on Programming Languages, POPL'25.

PDF Cite DOI arXiv

G. Kenison (2024). The Threshold Problem for Hypergeometric Sequences with Quadratic Parameters. International Colloquium on Automata, Languages, and Programming, ICALP ‘24.

PDF Cite DOI arXiv

D. Amrollahi, E. Bartocci, G. Kenison, L. Kovács, M. Moosbrugger, M. Stankovič (2024). (Un)Solvable Loop Analysis. Formal Methods in Systems Design.

Cite DOI arXiv

S. Hitarth, G. Kenison, L. Kovács, A. Varonka (2024). Linear Loop Synthesis for Quadratic Invariants. International Symposium on Theoretical Aspects of Computer Science, STACS ‘24.

PDF Cite DOI arXiv

G. Kenison, J. Nieuwveld, J. Ouaknine, J. Worrell (2023). Positivity Problems for Reversible Linear Recurrence Sequences. International Colloquium on Automata, Languages, and Programming, ICALP ‘23.

PDF Cite DOI

G. Kenison, K. Nosan, M. Shirmohammadi, J. Worrell (2023). The Membership Problem for Hypergeometric Sequences with Quadratic Parameters. International Symposium on Symbolic and Algebraic Computation, ISSAC ‘23.

PDF Cite DOI arXiv

G. Kenison, L. Kovács, A. Varonka (2023). From Polynomial Invariants to Linear Loops. International Symposium on Symbolic and Algebraic Computation, ISSAC ‘23.

PDF Cite DOI arXiv

D. Amrollahi, E. Bartocci, G. Kenison, L. Kovács, M. Moosbrugger, M. Stankovič (2022). Solving Invariant Generation for Unsolvable Loops. International Static Analysis Symposium, SAS ‘22.

Cite DOI arXiv

G. Kenison (2022). On the Skolem Problem for Reversible Sequences. Mathematical Foundations in Computer Science, MFCS `22.

PDF Cite DOI dagstuhl

G. Kenison, O. Klurman, E. Lefaucheux, F. Luca, P. Moree, J. Ouaknine, M. A. Whiteland, J. Worrell (2021). On Positivity and Minimality for Second-Order Holonomic Sequences. Mathematical Foundations in Computer Science, MFCS `21.

PDF Cite DOI dagstuhl

G. Kenison, R. Lipton, J. Ouaknine, J. Worrell (2020). On the Skolem Problem and prime powers. International Symposium on Symbolic and Algebraic Computation, ISSAC `20.

PDF Cite DOI arXiv

G. Kenison, R. Sharp (2019). Statistics in conjugacy classes in free groups. Geom. Dedicata.

PDF Cite DOI arXiv

G. Kenison, R. Sharp (2017). Orbit counting in conjugacy classes for free groups acting on trees. J. Topol. Anal.

PDF Cite DOI arXiv