On weakly complete sequences formed by the greedy algorithm

DOI10.1515/INTEGERS-2011-0118MaRDI QIDQ2911022zbMATH OpenOpenAlexFDO

Authors Michael P. Knapp, Michael D. Paul

Publication date 12 September 2012

Published in Integers (Search for Journal in Brave)

Full work available at URL http://www.emis.de/journals/INTEGERS/papers/m4/m4.pdf

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

completely sequencesgreedy algorithmweakly complete sequences

Mathematics Subject Classification ID

Recurrences (11B37)

Recommendations

• scientific article; zbMATH DE number 6272416
• scientific article; zbMATH DE number 4123835
• Complete sequences of sets of integer powers
• Completeness properties of perturbed sequences
• Sequences of positive integers containing no p terms in arithmetic progression generated by the greedy algorithm

Cited in

(8)

• On Gurevich's theorem on sequential algorithms
• Using the complete sequences for sorting natural numbers
• scientific article; zbMATH DE number 4123835 (Why is no real title available?)
• scientific article; zbMATH DE number 1300639 (Why is no real title available?)
• Structures in additive sequences
• An introduction to completeness of positive linear recurrence sequences
• scientific article; zbMATH DE number 3372095 (Why is no real title available?)
• Approximation by Egyptian fractions and the weak greedy algorithm

This page was built for publication: On weakly complete sequences formed by the greedy algorithm

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