Limit points of Nathanson's Lambda sequences
Abstract
We consider the set An=j=0∞\j(n)· njj(n)∈\0,1,2,...,n/2\\ . Let SA= a ∈A Aa where A⊂eq N. We denote by λA(h) the smallest positive integer that can be represented as a sum of h, and no less than h, elements in SA. Nathanson studied the properties of the λA(h)-sequence and posed the problem of finding the values of λA(h). When A=\2,i\, we represent λA(h) by λ2,i(h). Only the values λ2,3(1)=1, λ2,3(3)=5, λ2,3(3)=21 and λ2,3(4)=150 are known. In this paper, we extend this result. For any odd i>1 and h∈\1,2,3\, we find the values of λ2,i(h). Furthermore, for fixed h∈\1,2,3\, we find the values of λ2,i(h) that occur infinitely many times as i runs over the odd integers bigger than 1. We call these numbers the limit points of Nathanson's lambda sequences.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.