2000 character limit reached
On the general solution of the Heideman-Hogan family of recurrences
Published 23 Oct 2016 in math.CO and nlin.SI | (1610.07199v2)
Abstract: We consider a family of nonlinear rational recurrences of odd order which was introduced by Heideman and Hogan. All of these recurrences have the Laurent property, implying that for a particular choice of initial data (all initial values set to 1) they generate an integer sequence. For these particular sequences, Heideman and Hogan gave a direct proof of integrality by showing that the terms of the sequence also satisfy a linear recurrence relation with constant coefficients. Here we present an analogous result for the general solution of each of these recurrences.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.