Congruence properties of the function which counts compositions into powers of 2

MaRDI QIDQ3569511zbMATH OpenFDO

Authors Giedrius Alkauskas

Publication date 21 June 2010

Full work available at URL https://arxiv.org/abs/1003.1064, http://www.emis.de/journals/JIS/VOL13/Alkauskas/alkauskas2.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

2-adic analysisbinary compositionscongruence propertiesordered partitions

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Elementary theory of partitions (11P81) Partitions; congruences and congruential restrictions (11P83)

Abstract: Let v(n) denote the number of compositions (ordered partitions) of a positive integer n into powers of 2. It appears that the function v(n) satisfies many congruences modulo 2^N. For example, for every integer B there exists (as k tends to infinity) the limit of v(2^k+B) in the 2-adic topology. The parity of v(n) obeys a simple rule. In this paper we extend this result to higher powers of 2. In particular, we prove that for each positive integer N there exists a finite table which lists all the possible cases of this sequence modulo 2^N. One of our main results claims that v(n) is divisible by 2^N for almost all n, however large the value of N is.

Recommendations

• Congruences modulo powers of 2 for a certain partition function
• Congruences for powers of the partition function
• Congruence properties of functions related to the partition function
• Congruences for sums of powers of an integer
• Congruence properties for a certain kind of partition functions
• Congruence properties of some partition functions
• scientific article; zbMATH DE number 3289585
• scientific article; zbMATH DE number 2170419
• Some congruence properties of the number of cyclic compositions
• Congruences modulo 2 for certain partition functions

Cited in

(4)

• Representation of a 2-power as sum of \(k\) 2-powers: a recursive formula
• Congruence properties of binary partition functions
• A family of infinite series taking integer values
• Congruences modulo high powers of 2 for Sloane's box stacking function

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Congruence properties of the function which counts compositions into powers of 2

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