Congruences of concave composition functions

preprint2014arXivOpen access

Abstract

Concave compositions are ordered partitions whose parts are decreasing towards a central part. We study the distribution modulo aa of the number of concave compositions. Let c(n)c(n) be the number of concave compositions of nn having even length. It is easy to see that c(n)c(n) is even for all n≥1n\geq1. Refining this fact, we prove that #{n<X:c(n)≡0(mod4)}≫X\#\{n<X:c(n)\equiv 0\pmod 4\}\gg\sqrt{X} and also that for every a>2a>2 and at least two distinct values of r∈{0,1,…,a−1}r\in\{0,1,\dotsc,a-1\}, #{n<X:c(n)≡r(moda)}>log⁡2log⁡3Xa.\#\{n<X: c(n)\equiv r\pmod{a}\} > \frac{\log_2\log_3 X}{a}. We obtain similar results for concave compositions of odd length.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.