English
Related papers

Related papers: Higher order log-concavity of the overpartition fu…

200 papers

In this paper, we investigate decompositions of the partition function $p(n)$ from the additive theory of partitions considering the famous M\"{o}bius function $\mu(n)$ from multiplicative number theory. Some combinatorial interpretations…

Combinatorics · Mathematics 2023-10-23 Mircea Merca , Maxie D. Schmidt

We introduce a class of stochastic processes with reinforcement consisting of a sequence of random partitions $\{\mathcal{P}_t\}_{t \ge 1}$, where $\mathcal{P}_t$ is a partition of $\{1,2,\dots, Rt\}$. At each time~$t$,~$R$ numbers are…

Probability · Mathematics 2021-03-02 Caio Alves , Rodrigo Ribeiro , Daniel Valesin

This is an expository note answering a question posed to us by Richard Stanley, in which we prove a limit shape theorem for partitions of $n$ which maximize the number of subpartitions. The limit shape and the growth rate of the number of…

Probability · Mathematics 2020-01-29 Ivan Corwin , Shalin Parekh

We examine the behavior of the coefficients of powers of polynomials over a finite field of prime order. Extending the work of Allouche-Berthe, 1997, we study a(n), the number of occurring strings of length n among coefficients of any power…

Combinatorics · Mathematics 2013-04-18 Kevin Garbe

We are interested in the asymptotic behavior of orthogonal polynomials of the generalized Jacobi type as their degree $n$ goes to $\infty$. These are defined on the interval $[-1,1]$ with weight function…

Mathematical Software · Computer Science 2015-10-23 Alfredo Deaño , Daan Huybrechs , Peter Opsomer

In this paper, we consider an unconventional overdetermined problem through a property of concavity, which provides some characterizations of balls via Brunn-Minkowski inequalities. In this setting, our rsults can be viewed as the…

Analysis of PDEs · Mathematics 2024-06-25 Lei Qin , Lu Zhang

We calculate mod-p cohomology of extended powers, and their group completions which are free infinite loop spaces. We consider the cohomology of all extended powers of a space together and identify a Hopf ring structure with divided powers…

Algebraic Topology · Mathematics 2023-07-04 L. Guerra , P. Salvatore , D. Sinha

We define an overpartition analogue of Gaussian polynomials (also known as $q$-binomial coefficients) as a generating function for the number of overpartitions fitting inside the $M \times N$ rectangle. We call these new polynomials over…

Combinatorics · Mathematics 2014-12-30 Jehanne Dousse , Byungchan Kim

An integer partition of a positive integer $n$ is called to be $t$-core if none of its hook lengths are divisible by $t$. Recently, Gireesh, Ray and Shivashankar [`A new analogue of $t$-core partitions', \textit{Acta Arith.} \textbf{199}…

Number Theory · Mathematics 2024-05-01 Pranjal Talukdar

We introduce a new type of partitions that consists of partitions whose different parts alternate in parity (e.g., $3+2+2+1+1$). Various properties of this partition function are studied. In particular, we obtain its asymptotic behavior by…

Combinatorics · Mathematics 2018-03-06 Shane Chern

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 give explicit error bounds for the asymptotic expansion of the shifted distinct partition function $q(n +s)$ for any nonnegative integer $s$. Then based on this refined asymptotic formula, we give the exact thresholds of…

Combinatorics · Mathematics 2025-12-25 Gargi Mukherjee , Helen W. J. Zhang , Ying Zhong

Recently, Andrews and Dastidar introduced the partition function $SOME(n)$, defined as the sum of all the odd parts in the partitions of $n$ minus the sum of all the even parts in the partitions of $n$. They derived its generating function…

Combinatorics · Mathematics 2026-03-16 D. S. Gireesh , B. Hemanthkumar

In 2003, Maroti showed that one could use the machinery of l-cores and l-quotients of partitions to establish lower bounds for p(n), the number of partitions of n. In this paper we explore these ideas in the case l=2, using them to give a…

Combinatorics · Mathematics 2007-05-23 Mark Wildon

In a recent paper, Thejitha and Fathima introduced the overcolored partition function $\bar{a}_{r,s}(n)$, which enumerates overpartitions in which even parts may appear in one of $r$ colors and odd parts in one of $s$ colors, for fixed…

Number Theory · Mathematics 2026-03-16 Imdadul Hussain , Suparno Ghoshal , Arijit Jana

The primary focus of this paper is overpartitions, a type of partition that plays a significant role in $q$-series theory. In 2006, Treneer discovered an explicit infinite family of congruences of overpartitions modulo $5$. In our research,…

Number Theory · Mathematics 2023-09-04 Qi-Yang Zheng

The paper aims to establish the Tur\'an inequalities, the Laguerre inequalities (order $2$), and the determinantal inequalities (order $3$) for $\Delta p(n)$ and $\Delta \bar{p}(n)$, where $\Delta f(n)$ is the first-order forward difference…

Combinatorics · Mathematics 2023-12-19 Eve Y. Y. Yang

Let $\tau_k(n)$ be the $k$-th divisor function. In this paper, we derive an asymptotic formula for the sum $$ \sum_{1\leq n_1,n_2, \dots, n_{\ell}\leq X^{\frac{1}{r}} \atop 1\leq n_{\ell+1}\le X^{\frac{1}{s}}}\tau_k(n_1^r+n_2^r+\dots…

Number Theory · Mathematics 2024-08-21 Chenhao Du , Qingfeng Sun

We show that the large Cartesian powers of any graph have log-concave valencies with respect to a ffxed vertex. We show that the series of valencies of distance regular graphs is log-concave, thus improving on a result of (Taylor,…

Combinatorics · Mathematics 2025-01-22 Minjia Shi , Lu Wang , Patrick Sole

We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…

Logic in Computer Science · Computer Science 2014-07-16 Arthur Milchior
‹ Prev 1 4 5 6 7 8 10 Next ›