Globally periodic rational recurrences

Start with a finite window of positive numbers. At each step, compute the next value as a ratio of two affine functions of the window, then shift the window forward. Both functions have nonnegative coefficients and at least one positive coefficient. Which such recurrences have a period that works for every positive starting window?

Why it matters and what counts as progress

Why it matters: Individual starting windows can repeat even when the whole system has no common period. A classification identifies the rules that force every positive starting window to return after the same number of steps.

What counts as progress: Classify new orders or coefficient families, give an explicit nonperiodicity witness, or simplify the proof for a stated family. State whether a period applies to all positive starting windows.

How the problem developed

  1. 2004 · Reduction and low orders [1][3]

    Anna Cima, Armengol Gasull and Francesc Mañosas Reduced periodicity to a family of reciprocal equations with symmetric coefficients and classified several orders.

  2. 2021 · General classification question [2]

    Armengol Gasull Asked in Problem 11 whether the five known examples, after rescaling and unfolding, exhaust the periodic rational recurrences.

  3. 7 Nov 2026 · Classification at every order [3][4]

    John F. Rudge with Claude Classified the entire affine-ratio family on positive states. The formalization checks both directions.

AI contribution

Globally periodic rational difference equations of arbitrary order

John F. Rudge

A recurrence of any positive order whose next value is a ratio of two affine functions with nonnegative real coefficients has a common period for all positive initial states exactly when it comes from one of five known recurrences by positive rescaling and unfolding. Each affine function must have at least one positive coefficient, counting the constant term. Unfolding multiplies the index gaps by a positive integer.

AI involvementAI-led
ImportanceNotable
Technical verificationFormal (Lean, nanoda and con-ron)
Human understandingFew
Paper date:

Sources

  1. Cima, Gasull and Mañosas on periodic recurrences
  2. Gasull’s survey, Problem 11
  3. Rudge’s classification theorem and proof
  4. Palomar checking record
  5. Rudge’s AI disclosure
  6. Pinned Lean statement of Gasull’s Problem 11
Publication history