Infinitely many general rank sequences: extending Patel's polynomiality picture (2026) at arXiv:2501.14643v1, Section 1, p. 2

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

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24381373
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Infinitely many general rank sequences: extending Patel's polynomiality picture (2026) at arXiv:2501.14643v1, Section 1, p. 2

Wenlin Zhang, Haobo Ma
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

Infinitely many general rank sequences: extending Patel's polynomiality picture (2026) at arXiv:2501.14643v1, Section 1, p. 2

Wenlin Zhang, Haobo Ma
preprint en

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.

Zenodo (CERN European Organization for Nuclear Research)
National University of Singapore (SG)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon