Forced Differences Between Terms of Subsequences of Integer Sequences
From MaRDI portal
Publication:3666968
DOI10.2307/2045440zbMath0518.10065MaRDI QIDQ3666968
Michael Glipin, Robert O. Shelton
Publication date: 1983
Full work available at URL: https://doi.org/10.2307/2045440
asymptotic behavior; blocks; pigeon-hole principle; forced differences; length of longest subsequence
Related Items
Predicates whose maximal length functions increase periodically, Integer sequences with proscribed differences and bounded growth rate, Applications of parallel processors to some hard discrete problems, Avoiding-sequences with minimum sum