التفاصيل البيبلوغرافية
| العنوان: |
Congruence Properties of Binary Partition Functions. |
| المؤلفون: |
Anders, Katherine, Dennison, Melissa, Lansing, Jennifer, Reznick, Bruce |
| المصدر: |
Annals of Combinatorics; Mar2013, Vol. 17 Issue 1, p15-26, 12p |
| مصطلحات موضوعية: |
GEOMETRIC congruences, PARTITIONS (Mathematics), SUBSET selection, MATHEMATICAL sequences, GENERALIZATION, DIFFERENTIAL geometry, NUMBER theory |
| مستخلص: |
Let $${\mathcal{A}}$$ be a finite subset of $${\mathbb{N}}$$ containing 0, and let f ( n) denote the number of ways to write n in the form $${\sum \varepsilon _{j}2^{j}}$$ , where $${\varepsilon _{j} \epsilon \mathcal{A}}$$ . We show that there exists a computable $${T = T (\mathcal{A})}$$ so that the sequence ( f ( n) mod 2) is periodic with period T. Variations and generalizations of this problem are also discussed. [ABSTRACT FROM AUTHOR] |
|
Copyright of Annals of Combinatorics is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Complementary Index |
