English

Congruences of concave composition functions

Number Theory 2014-07-07 v1

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 n1n\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,,a1}r\in\{0,1,\dotsc,a-1\}, #{n<X:c(n)r(moda)}>log2log3Xa.\#\{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.

Keywords

Cite

@article{arxiv.1407.1297,
  title  = {Congruences of concave composition functions},
  author = {Keenan Monks and Lynnelle Ye},
  journal= {arXiv preprint arXiv:1407.1297},
  year   = {2014}
}

Comments

7 pages; preprint of article published in INTEGERS

R2 v1 2026-06-22T04:55:38.389Z