Related papers: Minimal partitions with a given $s$-core and $t$-c…

We give an asymptotic estimate for the number of partitions of a set of $n$ elements, whose block sizes avoid a given set $\mathcal{S}$ of natural numbers. As an application, we derive an estimate for the number of partitions of a set with…

For $n$ and $k$ integers we introduce the notion of some partition of $n$ being able to generate another partition of $n$. We solve the problem of finding the minimum size partition for which the set of partitions this partition can…

The spt-function $spt(n)$ was introduced by Andrews as the weighted counting of partitions of $n$ with respect to the number of occurrences of the smallest part. Andrews, Garvan and Liang defined the spt-crank of an $S$-partition which…

We investigate congruence relations of the form $p_r(\ell m n + t) \equiv 0 \pmod{\ell}$ for all $n$, where $p_r(n)$ is the number of $r$-colored partitions of $n$ and $m,\ell$ are distinct primes.

In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…

In this paper, we are interested in minimizing the sum of block sizes in a pairwise balanced design, where there are some constraints on the size of one block or the size of the largest block. For every positive integers n;m, where m ? n,…

We find the number of partitions of $n$ whose BG-rank is $j$, in terms of $pp(n)$, the number of pairs of partitions whose total number of cells is $n$, giving both bijective and generating function proofs. Next we find congruences mod 5…

Let S and T be sets of positive integers and let a be a fixed positive integer. An a-shifted partition identity has the form p(S,n)=p(T,n-a), for all n greater or equal to a. Here p(S,n) is the number partitions of n whose parts are…

Elementary proofs are given for sums of Schur functions over partitions into at most n parts each less than or equal to m for which i) all parts are even, ii) all parts of the conjugate partition are even. Also, an elementary proof of a…

In this article, we study $(\sigma, \tau)$-derivations of number rings by considering them as commutative unital $\mathbb{Z}$-algebras. We begin by characterizing all $(\sigma, \tau)$-derivations and inner $(\sigma, \tau)$-derivations of…

The set of hook lengths of an integer partition $\lambda$ is the complement of some numerical semigroup $S$. There has been recent interest in studying the number of partitions with a given set of hook lengths. Very little is known about…

In this work, a graph partitioning problem in a fixed number of connected components is considered. Given an undirected graph with costs on the edges, the problem consists of partitioning the set of nodes into a fixed number of subsets with…

Let $\Pi_n$ denote the set of all set partitions of $\{1,2,\ldots,n\}$. We consider two subsets of $\Pi_n$, one connected to rook theory and one associated with symmetric functions in noncommuting variables. Let $\cE_n\sbe\Pi_n$ be the…

We present a family of solvable multi-matrix models associated with an arbitrary embedded graph $\Gamma$ with a single vertex. The graph with $n$ edges is equipped with $2n$ corner matrices. The partition function of each member of the…

One of the oldest outstanding problems in dynamical algebraic combinatorics is the following conjecture of P. Cameron and D. Fon-Der-Flaass (1995). Consider a plane partition $P$ in an $a \times b \times c$ box ${\sf B}$. Let $\Psi(P)$…

We prove new formulas and congruences for $p(n,k):=$ the number of partitions of $n$ into $k$ parts and $q(n,k):=$ the number of partitions of $n$ into $k$ distinct parts. Also, we give lower and upper bounds for the density of the set…

A partition P of the vertex set of a connected graph G is a locating partition of G if every vertex is uniquely determined by its vector of distances to the elements of P. The partition dimension of G is the minimum cardinality of a…

The average size of the "smallest gap" of a partition was studied by Grabner and Knopfmacher in 2006. Recently, Andrews and Newman, motivated by the work of Fraenkel and Peled, studied the concept of the "smallest gap" under the name…

Let $f$ be a pseudo-Anosov homeomorphism on a closed, oriented surface. We give an effective construction of Markov partitions for $f$ based on a simple combinatorial criterion deciding when an immersed graph bounds a Markov partition. This…

Recently, Andrews introduced separable integer partition classes and studied some well-known theorems. In this article, we will consider the types of partitions with restrictions on consecutive parts. We will show that such partitions are…