Forced Differences Between Terms of Subsequences of Integer Sequences

DOI10.2307/2045440zbMath0518.10065OpenAlexW4239793733MaRDI QIDQ3666968

Michael Glipin, Robert O. Shelton

Publication date: 1983

Full work available at URL: https://doi.org/10.2307/2045440

zbMATH Keywords

asymptotic behaviorblockspigeon-hole principleforced differenceslength of longest subsequence

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Special sequences and polynomials (11B83)

Related Items (4)

Applications of parallel processors to some hard discrete problems ⋮ Avoiding-sequences with minimum sum ⋮ Predicates whose maximal length functions increase periodically ⋮ Integer sequences with proscribed differences and bounded growth rate

This page was built for publication: Forced Differences Between Terms of Subsequences of Integer Sequences