Infinitely many general rank sequences: extending Patel's polynomiality picture (2026) at arXiv:2501.14643v1, Section 1, p. 2
Year: 2026
Type: preprint
Abstract: Extending Patel's (2026) polynomiality picture, we disprove the finiteness conjecture of Rowland and Sistos Barrón at arXiv:2501.14643v1, Section 1, p. 2: every initial rank r >= 3 admits infinitely many general rank sequences, realized by positive integer sequences. Their ranks are binomial(M+r-1,r-1) - binomial(M-K+r-1,r-1), with the second term zero when M < K, so arbitrarily long maximal prefixes do not determine the full rank sequence. A different family, s_p(n) = p*8^n - 4^n - 2^n, gives infinitely many particular rank sequences under one fixed rank-three recurrence, by parameter-dependent coefficient cancellation. These conclusions concern the number of entire rank sequences, rather than their individual eventual polynomiality.
Authors: Ma, Haobo, Zhang, Wenlin
Institution: National University of Singapore
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236635221
