Congruences of concave composition functions

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

Abstract: Concave compositions are ordered partitions whose parts are decreasing towards a central part. We study the distribution modulo

a

of the number of concave compositions. Let

c (n)

be the number of concave compositions of

n

having even length. It is easy to see that

c (n)

is even for all

n g e q 1

. Refining this fact, we prove that

#{n<X:c(n)equiv 0pmod 4}ggsqrt{X}

and also that for every

a > 2

and at least two distinct values of

r i n 0, 1, d o t s c, a - 1

,

#{n<X: c(n)equiv rpmod{a}} > frac{log_2log_3 X}{a}.

We obtain similar results for concave compositions of odd length.

Recommendations

Cited in

(8)

This page was built for publication: Congruences of concave composition functions