Papers
Topics
Authors
Recent
Search
2000 character limit reached

Congruences of concave composition functions

Published 4 Jul 2014 in math.NT | (1407.1297v1)

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\geq1$. Refining this fact, we prove that $$#{n<X:c(n)\equiv 0\pmod 4\}\gg\sqrt{X}$$ and also that for every $a\>2$ and at least two distinct values of $r\in{0,1,\dotsc,a-1}$, $$#{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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.