An algorithm to determine when certain sets have 0-density

DOI10.1016/0196-6774(81)90005-5MaRDI QIDQ3915073zbMATH OpenOpenAlexFDO

Authors David A. Klarner

Publication date 1981

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(81)90005-5

zbMATH Keywords

computational algorithmpositive densitysets of integers

Mathematics Subject Classification ID

Density, gaps, topology (11B05) Special sequences and polynomials (11B83) Algorithms in computer science (68W99)

Cited in

(5)

• A sufficient condition for certain semigroups to be free
• m-recognizability of sets closed under certain affine functions
• scientific article; zbMATH DE number 6902897 (Why is no real title available?)
• Unique expansions in number systems via refinement equations
• On orbit sets generated by semigroups of one-dimensional affine functions

This page was built for publication: An algorithm to determine when certain sets have 0-density

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3915073)