Counting the number of unavoidable sets of a given size in a finite set of integers

MaRDI QIDQ3377519zbMATH OpenFDO

Authors Patrick Mitchell, D. Mills

Publication date 23 March 2006

Full work available at URL https://eudml.org/doc/125851, http://www.emis.de/journals/INTEGERS/vol5-2.html

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

set partitionsavoidable sets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Partitions of sets (05A18)

Recommendations

• On generalized Tribonacci sequences and additive partitions
• Counting sets of integers, no \(k\) of which sum to another
• scientific article; zbMATH DE number 2188479
• Sum-avoiding subsets
• A complete categorization of when generalized Tribonacci sequences can be avoided by additive partitions

Cited in

(6)

• Continued fractions and unique additive partitions
• scientific article; zbMATH DE number 2188479 (Why is no real title available?)
• Unavoidable systems of functions
• Divisibility of integers obtained from truncated periodic sequences
• Sum-avoiding subsets
• Avoidable algebraic subsets of Euclidean space

This page was built for publication: Counting the number of unavoidable sets of a given size in a finite set of integers

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