English
Related papers

Related papers: Inequalities for the overpartition function arisin…

200 papers

It was recently shown that $q\omega(q)$, where $\omega(q)$ is one of the third order mock theta functions, is the generating function of $p_{\omega}(n)$, the number of partitions of a positive integer $n$ such that all odd parts are less…

Number Theory · Mathematics 2016-03-15 George E. Andrews , Atul Dixit , Daniel Schultz , Ae Ja Yee

In this paper we compute asymptotics for the coefficients of an infinite class of overpartition rank generating functions. Using these results, we show that $ \overline{N}(a,c,n), $ the number of overpartitions of $ n $ with rank congruent…

Number Theory · Mathematics 2019-10-01 Alexandru Ciolan

Inspired by Andrews' and Bachraoui's work on partitions with repeated smallest part, we extend the concept to overpartitions. We study overpartitions with the restriction that the smallest non-overlined part appears exactly $k$ times and…

Combinatorics · Mathematics 2026-03-31 Amita Malik , Rishabh Sarma

If $ p_k(a,m,n) $ denotes the number of partitions of $n$ into $k$th powers with a number of parts that is congruent to $ a $ modulo $m,$ then $p_2(0,2,n)\sim p_2(1,2,n)$ and the sign of the difference $p_2(0,2,n)- p_k(1,2,n)$ alternates…

Number Theory · Mathematics 2021-02-03 Alexandru Ciolan

The starting point for this work is the family of functions $\overline{p}_{-t}(n)$ which counts the number of $t$--colored overpartitions of $n.$ In recent years, several infinite families of congruences satisfied by $\overline{p}_{-t}(n)$…

Number Theory · Mathematics 2024-05-30 James A. Sellers

The rank of partitions play an important role in the combinatorial interpretations of several Ramanujan's famous congruence formulas. In 2005 and 2008, the $D$-rank and $M_2$-rank of an overpartition were introduced by Lovejoy,…

Combinatorics · Mathematics 2019-03-06 Huan Xiong , Wenston J. T. Zang

We introduce a statistic on overpartitions called the $\overline{k}$-rank. When there are no overlined parts, this coincides with the $k$-rank of a partition introduced by Garvan. Moreover, it reduces to the D-rank of an overpartition when…

Combinatorics · Mathematics 2021-08-20 Alice X. H. Zhao

The aim of this work is to establish congruences $\left( \operatorname{mod}p^{2}\right) $ involving the trinomial coefficients $\binom{np-1}{p-1}_{2}$ and $\binom{np-1}{\left( p-1\right)/2}_{2}$ arising from the expansion of the powers of…

Number Theory · Mathematics 2019-10-22 Laid Elkhiri , Miloud Mihoubi

The Tur\'{a}n inequalities and the higher order Tur\'{a}n inequalities arise in the study of Maclaurin coefficients of an entire function in the Laguerre-P\'{o}lya class. A real sequence $\{a_{n}\}$ is said to satisfy the Tur\'{a}n…

Combinatorics · Mathematics 2017-07-03 William Y. C. Chen , Dennis X. Q. Jia , Larry X. W. Wang

In this paper, we obtain inequalities on $M_2$-ranks of overpartitions modulo $6$. Let $\overline{N}_2(s,m,n)$ to be the number of overpartitions of $n$ whose $M_2$-rank is congruent to $s$ modulo $m$. For $M_2$-ranks modulo $3$, Lovejoy…

Combinatorics · Mathematics 2018-05-11 Helen W. J. Zhang

Amdeberhan et al. (2024) introduced the notion of a generalized overcubic partition function $\overline a_c (n)$ and proved an infinite family of congruences modulo a prime $p\ge 3$ and some Ramanujan type congruences. In this paper, we…

Number Theory · Mathematics 2025-03-25 Adam Paksok , Nipen Saikia

In this note, we show that there are many infinity positive integer values of $n$ in which, the following inequality holds $$ \left\lfloor{1/2}(\frac{(n+1)^2}{\log(n+1)}-\frac{n^2}{\log n})-\frac{\log^2 n}{\log\log…

Number Theory · Mathematics 2007-05-23 Mehdi Hassani

Overlap functions were introduced as class of bivariate aggregation functions on [0, 1] to be applied in image processing. This paper has as main objective to present appropriates definitions of overlap functions considering the scope of…

Logic in Computer Science · Computer Science 2019-02-04 Rui Paiva , Eduardo Palmeira , Regivan Santiago , Benjamin Bedregal

Let p(n, k) denote the number of partitions of n into parts less than or equal to k. We show several properties of this function modulo 2. First, we prove that for fixed positive integers k and m, p(n,k) is periodic modulo m. Using this, we…

Combinatorics · Mathematics 2018-11-21 Kedar Karhadkar

In this paper, we show that the difference between the number of parts in the odd partitions of $n$ and the number of parts in the distinct partitions of $n$ satisfies Euler's recurrence relation for the partition function $p(n)$ when $n$…

Combinatorics · Mathematics 2020-05-08 Mircea Merca

Andrews, Lewis and Lovejoy introduced the partition function $PD(n)$ as the number of partitions of $n$ with designated summands. In a recent work, Lin studied a partition function $PD_{t}(n)$ which counts the number of tagged parts over…

Combinatorics · Mathematics 2020-07-08 Robert. X. J. Hao , Erin Y. Y. Shen , Wenston J. T. Zang

We determine the p-exponent in many of the coefficients in the power series (log(1+x)/x)^t, where t is any integer. In our proof, we introduce a variant of multinomial coefficients. We also characterize the power series x/log(1+x) by…

Number Theory · Mathematics 2010-01-19 Donald M. Davis

Heim, Neuhauser, and Tr\"oger recently established some inequalities for MacMahon's plane partition function $\mathrm{PL}(n)$ that generalize known results for Euler's partition function $p(n)$. They also conjectured that $\mathrm{PL}(n)$…

Number Theory · Mathematics 2022-09-13 Ken Ono , Sudhir Pujahari , Larry Rolen

In this paper, we establish two new Ramanujan-type congruences for the overpartition function: $\overline{p}(11\times(8n+5))\equiv 0 \pmod{11}$ and $\overline{p}(13\times 2^6(8n+7))\equiv 0 \pmod{13}$. The proofs rely on the theory of…

Number Theory · Mathematics 2026-03-10 XuanLing Wei

In this paper we investigate the generalization of the Bessenrodt--Ono inequality by following Gian-Carlo Rota's advice in studying problems in combinatorics and number theory in terms of roots of polynomials. We consider the number of…

Combinatorics · Mathematics 2019-10-24 Bernhard Heim , Markus Neuhauser , Robert Tröger