About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Journal of Combinatorial Theory, Series A
Paper
The complement of certain recursively defined sets
Abstract
An RD-set (recursively defined) is a minimal set of positive integers containing a given seed and closed under a given set of unary linear operations (x → ax + b). We examine conditions under which the complement of an RD-set may be expressed as the disjoint union of infinite arithmetic progressions. © 1975.