English
Related papers

Related papers: Partitions and elementary symmetric polynomials --…

200 papers

The arithmetic properties of the ordinary partition function $p(n)$ have been the topic of intensive study for the past century. Ramanujan proved that there are linear congruences of the form $p(\ell n+\beta)\equiv 0\pmod\ell$ for the…

Number Theory · Mathematics 2022-12-06 Scott Ahlgren , Olivia Beckwith , Martin Raum

When $\lambda$ is a partition, the specialized non-symmetric Macdonald polynomial $E_{\lambda}(x;q;0)$ is symmetric and related to a modified Hall--Littlewood polynomial. We show that whenever all parts of the integer partition $\lambda$ is…

Combinatorics · Mathematics 2023-10-04 Per Alexandersson , Joakim Uhlin

A number of recent papers have estimated ratios of the partition function $p(n-j)/p(n)$, which appears in many applications. Here, we prove an easy-to-use effective bound on these ratios. Using this, we then study second shifted difference…

Number Theory · Mathematics 2023-10-23 Kevin Gomez , Joshua Males , Larry Rolen

For a subset $\mathcal A\subset \mathbb N$, let $p_{\mathcal A}(n)$ denote the restricted partition function which counts partitions of $n$ with all parts lying in $\mathcal A$. In this paper, we use a variation of the Hardy-Littlewood…

Number Theory · Mathematics 2021-02-23 Ayla Gafni

A recent conjecture by I. Ra\c{s}a asserts that the sum of the squared Bernstein basis polynomials is a convex function in $[0,1]$. This conjecture turns out to be equivalent to a certain upper pointwise estimate of the ratio…

Classical Analysis and ODEs · Mathematics 2014-02-27 Geno Nikolov

A cubic partition consists of partition pairs $(\lambda,\mu)$ such that $\vert\lambda\vert+\vert\mu\vert=n$ where $\mu$ involves only even integers but no restriction is placed on $\lambda$. This paper initiates the notion of generalized…

Number Theory · Mathematics 2024-05-01 Tewodros Amdeberhan , Ajit Singh

Ballantine, Beck, and Merca defined a map $\mathrm{pre}_2$, which sends an integer partition $\lambda = (\lambda_1, \dots, \lambda_{\ell})$ to the set $\{\lambda_i\lambda_j : 1 \leq i < j \leq \ell\}$ consisting of the pairwise products of…

Combinatorics · Mathematics 2025-08-05 Stella Jiahui Li

In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…

Combinatorics · Mathematics 2016-11-01 Franck Gabriel

Let $\mathcal{A}=\left(a_i\right)_{i=1}^\infty$ be a weakly increasing sequence of positive integers and let $k$ be a fixed positive integer. For an arbitrary integer $n$, the restricted partition $p_\mathcal{A}(n,k)$ enumerates all the…

Combinatorics · Mathematics 2023-05-02 Krystian Gajdzica

Assume $\mathsf{M}_n$ is the $n$-dimensional permutation module for the symmetric group $\mathsf{S}_n$, and let $\mathsf{M}_n^{\otimes k}$ be its $k$-fold tensor power. The partition algebra $\mathsf{P}_k(n)$ maps surjectively onto the…

Representation Theory · Mathematics 2018-10-03 Georgia Benkart , Tom Halverson

The fingerprint invariant of partitions can be used to describe the Kazhdan-Lusztig map for the classical groups. We discuss the basic properties of fingerprint. We construct the fingerprints of rigid partitions in the $B_n$, $C_n$, and…

Combinatorics · Mathematics 2017-11-10 Bao Shou , Qiao Wu

Let $f \in \mathbb{Z}[y]$ be a polynomial such that $f(\mathbb{N}) \subseteq \mathbb{N}$, and let $p_{\mathcal{A}_{f}}(n)$ denote number of partitions of $n$ whose parts lie in the set $\mathcal{A}_f:=\{f(n):n \in \mathbb{N}\}$. Under…

Number Theory · Mathematics 2018-04-20 Alexander Dunn , Nicolas Robles

Consider exponential Carmichael function $\lambda^{(e)}$ such that $\lambda^{(e)}$ is multiplicative and $\lambda^{(e)}(p^a) = \lambda(a)$, where $\lambda$ is usual Carmichael function. We discuss the value of $\sum \lambda^{(e)}(n)$, where…

Number Theory · Mathematics 2014-05-30 Andrew V. Lelechenko

A probabilistic characterization of the dominance partial order on the set of partitions is presented. This extends work in "Symmetric polynomials and symmetric mean inequalities". Electron. J. Combin., 20(3): Paper 34, 2013. Let $n$ be a…

Combinatorics · Mathematics 2015-12-15 Clifford Smyth

The least $r$-gap, $g_r(\lambda)$, of a partition $\lambda$ is the smallest part of $\lambda$ appearing less than $r$ times. In this article we introduce two new partition functions involving least $r$-gaps. We consider a bisection of a…

Combinatorics · Mathematics 2017-10-18 Cristina Ballantine , Mircea Merca

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 article we will derive a combinatorial formula for the partition function p(n). In the second part of the paper we will establish connection between partitions and q-binomial coefficients and give new interpretation for q-binomial…

Combinatorics · Mathematics 2016-05-10 Zhumagali Shomanov

In this paper, we give a purely bijective proof that two different partition classes that are both combinatorial interpretations of the partition function $p_\nu(n)$, a partition function related to the third order mock theta function…

Combinatorics · Mathematics 2020-07-21 A. S. Andersen

The restricted partition function $p_N(n)$ counts the partitions of the integer $n$ into at most $N$ parts. In the nineteenth century Sylvester described these partitions as a sum of waves. We give detailed descriptions of these waves and,…

Number Theory · Mathematics 2018-04-02 Cormac O'Sullivan

We consider a partially asymmetric exclusion process (PASEP) on a finite number of sites with open and directed boundary conditions. Its partition function was calculated by Blythe, Evans, Colaiori, and Essler. It is known to be a…

Combinatorics · Mathematics 2011-01-20 Matthieu Josuat-Vergès