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

zbMATH Open1085.05015MaRDI QIDQ3377519FDOQ3377519

Authors: Patrick Mitchell, D. Mills 

Publication date: 23 March 2006

Full work available at URL: https://eudml.org/doc/125851

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

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

zbMATH Keywords

set partitionsavoidable sets

Mathematics Subject Classification ID

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

Cited In (6)

• Continued fractions and unique additive partitions
• Title not available (Why is that?)
• 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)