pith. machine review for the scientific record. sign in

arxiv: 2605.05784 · v1 · submitted 2026-05-07 · 🧮 math.NT

Recognition: unknown

The quotient problem for linear recurrence sequences

Parvathi S Nair, S. S. Rout

Pith reviewed 2026-05-08 05:37 UTC · model grok-4.3

classification 🧮 math.NT
keywords linear recurrence sequencesquotient problemDiophantine approximationSchmidt subspace theoremmulti-recurrencemoving hyperplanesfinitely generated ringspolynomial factors
0
0 comments X

The pith

For unequal indices m and n in linear recurrence sequences U and V, a polynomial P exists making the scaled quotient d U(m)/V(n) a multi-recurrence while V(n)/P(n) becomes a linear recurrence.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper studies the Diophantine finiteness question for pairs (m,n) where d_{m,n} U(m)/V(n) lies in a finitely generated subring of the complex numbers and log|d| grows slower than linearly in n. It proves an explicit structural theorem that controls all such pairs through recurrence relations. When m differs from n, multiplication by a suitable polynomial P turns the adjusted quotient into a multi-recurrence sequence and forces the adjusted denominator to satisfy a linear recurrence. When the indices coincide, both the adjusted numerator and denominator satisfy ordinary linear recurrences. The argument proceeds by applying Schmidt's subspace theorem to suitably chosen moving hyperplanes and moving polynomials.

Core claim

Let U(m) and V(n) be linear recurrence sequences. For every pair (m,n) admitting a positive integer d with log|d|=o(n) such that d U(m)/V(n) belongs to a finitely generated subring of C, there exists a polynomial P with the following properties: when m ≠ n, the sequence d P(n) U(m)/V(n) is a multi-recurrence while V(n)/P(n) is a linear recurrence; when m = n, both d P(n) U(m)/V(n) and V(n)/P(n) are linear recurrences. The proof is carried out by combining Schmidt's subspace theorem with the techniques of moving hyperplanes, moving polynomials, and moving points.

What carries the argument

The polynomial P(n) that factors the denominator V(n) so that the scaled ratio d U(m)/V(n) reduces to a multi-recurrence sequence, obtained by applying Schmidt's subspace theorem to moving hyperplanes indexed by the variable n.

If this is right

  • Every admissible pair (m,n) must satisfy a system of linear recurrence relations after a polynomial adjustment of bounded degree.
  • The denominator sequence V(n) is forced to be divisible by a polynomial factor whose coefficients are independent of the numerator index m.
  • When m equals n the problem collapses to the ordinary theory of linear recurrence sequences taking values in a fixed ring.
  • The growth restriction log|d|=o(n) is compatible with the order of the resulting multi-recurrence.
  • Finiteness of the set of such pairs (m,n) follows once the multi-recurrence and linear recurrence conditions are solved explicitly.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same moving-hyperplane construction may apply verbatim to ratios of sequences satisfying higher-order recurrences or to sequences taking values in number fields of fixed degree.
  • The explicit polynomial P supplies a reduction that could turn the original finiteness question into a finite check against the integer points of certain recurrence varieties.
  • The result supplies a uniform way to handle variable-index Diophantine problems for any family of sequences to which Schmidt's theorem applies.

Load-bearing premise

That Schmidt's subspace theorem together with moving-hyperplane methods apply directly to the given linear recurrence sequences without extra conditions on the characteristic roots or their linear independence.

What would settle it

Two explicit linear recurrence sequences U and V together with indices m ≠ n and a d satisfying log|d|=o(n) such that d U(m)/V(n) lies in a finitely generated subring but no polynomial P exists making d P(n) U(m)/V(n) a multi-recurrence.

read the original abstract

Let $\{U(m)\}_{m\in \N}$ and $\{V(n)\}_{n\in \N}$ be linear recurrence sequences. It is a well-known Diophantine problem to determine the finiteness of the set of natural numbers $n$ such that the ratio $U(n)/V(n)$ is an integer. We study the finiteness problem for the set $(m, n)\in \mathbb{N}^2$ such that there exist non-zero positive integers $d_{m, n}$ satisfying $\log |d_{m, n}|=o(n)$, and $d_{m, n}U(m)/V(n)$ is an element from a finitely generated subring of $\C$. In particular, we prove that for $m\neq n $, there exists a polynomial $P$ such that $d_{m, n}P(n)U(m)/V(n)$ is a multi-recurrence and $V(n)/P(n)$ is a linear recurrence and for $m=n$ both $d_{m, n}P(n)U(m)/V(n)$ and $V(n)/P(n)$ are linear recurrences. To prove our results, we employ Schmidt's subspace theorem, and the concept of moving hyperplanes, moving polynomials, and moving points.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 1 minor

Summary. The manuscript studies the finiteness problem for pairs (m, n) of natural numbers such that there exists a positive integer d_{m,n} with log |d_{m,n}| = o(n) and d_{m,n} U(m)/V(n) lies in a finitely generated subring of C, where U(m) and V(n) are linear recurrence sequences. The main theorem asserts that there exists a polynomial P such that, when m ≠ n, the adjusted term d_{m,n} P(n) U(m)/V(n) is a multi-recurrence sequence and V(n)/P(n) is a linear recurrence sequence, while for m = n both adjusted quantities are linear recurrences. The proof is based on Schmidt's subspace theorem together with moving hyperplanes, moving polynomials, and moving points.

Significance. If the result holds in the claimed generality for arbitrary linear recurrences, it would extend classical finiteness theorems on integer-valued quotients of recurrence sequences to a broader Diophantine setting involving controlled denominators and finitely generated rings. The combination of Schmidt's theorem with moving techniques is a methodological strength that could enable more flexible reductions than standard S-unit or logarithmic-form approaches. The paper supplies no machine-checked proofs or explicit parameter-free derivations, but the existence statement is falsifiable in principle via explicit recurrence examples.

major comments (1)
  1. [Abstract] Abstract and the statement of the main result: the existence of P is asserted for arbitrary linear recurrence sequences U and V without any stated hypotheses on the multiplicative independence of their characteristic roots or the linear independence over Q of the logarithms of those roots. Standard applications of Schmidt's subspace theorem to ratios in finitely generated rings (via moving hyperplanes or points) require such conditions to control the exceptional subspaces; the manuscript does not indicate whether these are assumed, derived from the o(n) growth of log |d|, or rendered unnecessary by the moving techniques. This is load-bearing for the central claim, as counterexamples with repeated roots or commensurable logs could invalidate the reduction to multi-recurrence or linear-recurrence form.
minor comments (1)
  1. The abstract packs the main theorem, the auxiliary polynomial P, and the proof methods into a single dense sentence; separating the precise statement of the result from the tools employed would improve readability.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for raising this important point about the hypotheses underlying the main theorem. We address the comment in detail below.

read point-by-point responses
  1. Referee: [Abstract] Abstract and the statement of the main result: the existence of P is asserted for arbitrary linear recurrence sequences U and V without any stated hypotheses on the multiplicative independence of their characteristic roots or the linear independence over Q of the logarithms of those roots. Standard applications of Schmidt's subspace theorem to ratios in finitely generated rings (via moving hyperplanes or points) require such conditions to control the exceptional subspaces; the manuscript does not indicate whether these are assumed, derived from the o(n) growth of log |d|, or rendered unnecessary by the moving techniques. This is load-bearing for the central claim, as counterexamples with repeated roots or commensurable logs could invalidate the reduction to multi-recurrence or linear-recurrence form.

    Authors: We agree that the manuscript does not explicitly address the role of independence conditions on the characteristic roots. In the proof, Schmidt's subspace theorem is applied in conjunction with moving hyperplanes, moving polynomials, and moving points. These moving techniques are designed to absorb any exceptional subspaces that arise from multiplicative relations among the roots or linear dependence over Q of their logarithms (including cases of repeated roots). Such exceptional loci are incorporated into the choice of the polynomial P, which adjusts the sequences so that the stated recurrence properties hold. The hypothesis log |d_{m,n}| = o(n) supplies the necessary height control to ensure that the moving framework remains effective without a priori independence assumptions. We will add a clarifying paragraph in the introduction explaining this aspect of the argument. We do not claim the result holds without the moving techniques, but we maintain that the combination renders the standard independence hypotheses unnecessary for the stated conclusion. revision: partial

Circularity Check

0 steps flagged

No circularity; central claim rests on external Schmidt subspace theorem

full rationale

The derivation applies Schmidt's subspace theorem together with moving hyperplanes/points/polynomials to establish existence of P such that the stated recurrence properties hold. These tools are independent of the paper's own results. No self-citations appear load-bearing, no parameters are fitted to data and then relabeled as predictions, and the statements about d_{m,n}P(n)U(m)/V(n) and V(n)/P(n) are not defined in terms of each other. The log|d|=o(n) and finitely-generated-subring conditions are explicit inputs, not smuggled via self-reference. The result is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The result rests on the definition of linear recurrence sequences and the applicability of Schmidt's subspace theorem from Diophantine approximation.

axioms (1)
  • standard math Schmidt's subspace theorem applies to the linear forms arising from the recurrence quotients
    Invoked to bound approximations and control dependencies in the proof.

pith-pipeline@v0.9.0 · 8701 in / 1210 out tokens · 69713 ms · 2026-05-08T05:37:23.770811+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

23 extracted references

  1. [1]

    Amoroso and E

    F. Amoroso and E. Viada,On the zeros of linear recurrence sequences, Acta Arith.147(4) (2011), 387-396

  2. [2]

    Andr´ e-Jeannin,Divisibility of generalized Fibonacci and Lucas numbers by their subscripts, Fibonacci Quart.29(4) (1991), 364-366

    R. Andr´ e-Jeannin,Divisibility of generalized Fibonacci and Lucas numbers by their subscripts, Fibonacci Quart.29(4) (1991), 364-366

  3. [3]

    Corvaja and U

    P. Corvaja and U. Zannier,Diophantine equations with power sums and universal Hilbert sets, Indag. Math. (N.S.)9(3) (1998), 317-332

  4. [4]

    Corvaja and U

    P. Corvaja and U. Zannier,Finiteness of integral values for the ratio of two linear recurrences, Invent. Math.149(2002), 431-451

  5. [5]

    Everest, A

    G. Everest, A. J. van Der Poorten, I. E. Shparlinski and T. Ward,Recurrence sequences, Math. Surveys Monogr., Vol. 104, AMS, Providence, RI (2003)

  6. [6]

    J. J. A. Gonz´ alez, F. Luca, C. Pomerance and I. E. Shparlinski,On numbers n dividing the nth term of a linear recurrence, Proc. Edinb. Math. Soc.55(2) (2012), 271-289

  7. [7]

    Grieve and J

    N. Grieve and J. Wang,Greatest common divisors with moving targets and consequences for linear recurrence sequences, Trans. Amer. Math. Soc. 373(11) (2020), 8095-8126

  8. [8]

    Lech,A note on recurring series, Ark

    C. Lech,A note on recurring series, Ark. Mat.2(5) (1953), 417-421

  9. [9]

    Levin,Greatest common divisors and Vojta’s conjecture for blowups of algebraic tori, Invent

    A. Levin,Greatest common divisors and Vojta’s conjecture for blowups of algebraic tori, Invent. Math.215(2) (2019), 493-533

  10. [10]

    Mahler,Eine arithmetische Eigenschaft der Taylor-Koeffizienten ratio- naler Funktionen, Proc

    K. Mahler,Eine arithmetische Eigenschaft der Taylor-Koeffizienten ratio- naler Funktionen, Proc. K. Ned. Akad. Wet.38(1935), 50-60

  11. [11]

    Mahler,On the Taylor coefficients of rational functions, Proc

    K. Mahler,On the Taylor coefficients of rational functions, Proc. Camb. Philos. Soc.52(1956), 39-48

  12. [12]

    On the Taylor coefficients of rational functions

    K. Mahler,Addendum to the paper “On the Taylor coefficients of rational functions”, Proc. Camb. Philos. Soc.53(1957), 544

  13. [13]

    Pourchet,Solution du probleme arithm´ etique du quotient de Hadamard de deux fractions rationnelles, C.R

    Y. Pourchet,Solution du probleme arithm´ etique du quotient de Hadamard de deux fractions rationnelles, C.R. Acad. Sci. Paris288(1979), 1055-1057. THE QUOTIENT PROBLEM FOR LINEAR RECURRENCE SEQUENCES 22

  14. [14]

    R Rumely and A. J. van der Poorten,A note on the Hadamard kth root of a rational function, J. Aust. Math. Soc.43(3) (1987), 314-327

  15. [15]

    de Th´ eorie des Nombres, Paris 1986–87, Progr

    R Rumely,Notes on van der Poorten’s proof of the Hadamard Quotient Theorem, S´ em. de Th´ eorie des Nombres, Paris 1986–87, Progr. Math.75 (1988), 349-409

  16. [16]

    Sanna,Distribution of integral values for the ratio of two linear recur- rences, J

    C. Sanna,Distribution of integral values for the ratio of two linear recur- rences, J. Number Theory180(2017), 195-207

  17. [17]

    W. M. Schmidt,Diophantine approximations and Diophantine equations, Springer (2006)

  18. [18]

    T. N. Shorey and R. Tijdeman,Exponential Diophantine Equations, Vol. 87, Cambridge University Press (1986)

  19. [19]

    Skolem,Ein Verfahren zur Behandlung gewisser exponentialer Gleichun- gen und diophantischer Gleichungen, Comptes Rendus Congr

    T. Skolem,Ein Verfahren zur Behandlung gewisser exponentialer Gleichun- gen und diophantischer Gleichungen, Comptes Rendus Congr. Math. Scand., Stockholm (1934), 163-188

  20. [20]

    A. J. van der Poorten,Solution de la conjecture de Pisot sur le quotient de Hadamard de deux fractions rationnelles, C. R Acad. Sci. Paris306(97) (1988)

  21. [21]

    A. J. van der Poorten,Some facts that should be better known, especially about rational functions in Number Theory and Applications (Banff, AB, 1988),265(1989), 497-528

  22. [22]

    Xiao,Greatest common divisors for polynomials in almost units and ap- plications to linear recurrence sequences, Math

    Z. Xiao,Greatest common divisors for polynomials in almost units and ap- plications to linear recurrence sequences, Math. Z.306(4) (2024), article number 61

  23. [23]

    Zannier,Diophantine equations with linear recurrences An overview of some recent progress, J

    U. Zannier,Diophantine equations with linear recurrences An overview of some recent progress, J. Th´ eor. Nombres Bordx.17(1) (2005), 423-435. (Parvathi S Nair)Department of Mathematics, National Institute of Technology Calicut, Kozhikode-673 601, India. Email address:parvathisnair60@gmail.com, parvathi p220245ma@nitc.ac.in (S. S. Rout)Department of Mathe...