Automatic congruences for diagonals of rational functions

Rowland, Eric and Yassawi, Reem (2015). Automatic congruences for diagonals of rational functions. Journal de Théorie des Nombres de Bordeaux, 27(1) pp. 245–288.

DOI: https://doi.org/10.5802/jtnb.901

Abstract

In this paper we use the framework of automatic sequences to study combinatorial sequences modulo prime powers. Given a sequence whose generating function is the diagonal of a rational power series, we provide a method, based on work of Denef and Lipshitz, for computing a finite automaton for the sequence modulo p^α, for all but finitely many primes p. This method gives completely automatic proofs of known results, establishes a number of new theorems for well-known sequences, and allows us to resolve some conjectures regarding the Apéry numbers. We also give a second method, which applies to an algebraic sequence modulo p^α for all primes p, but is significantly slower. Finally, we show that a broad range of multidimensional sequences possess Lucas products modulo p.

Viewing alternatives

Metrics

Item Actions

Export

You can export this page using these formats Digital Object Identifier - DOI

About

• Item ORO ID
• 67095
• Item Type
• Journal Item
• ISSN
• 2118-8572
• Project Funding Details

• Funded Project Name	Project ID	Funding Body
  Not Set	Not Set	NSERC

• Academic Unit or School
• Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
  Faculty of Science, Technology, Engineering and Mathematics (STEM)
• Copyright Holders
• © 2015 Société Arithmétique de Bordeaux
• Related URLs
• • http://jtnb.cedram.org/item?id=JTNB_2015...(Other)
• Depositing User
• Reem Yassawi