相关论文: Jagged partitions

Let $f: \mathbb{Z}_+\rightarrow \mathbb{Z}_+$ be a polynomial with the property that corresponding to every prime $p$ there exists an integer $\ell$ such that $p\nmid f(\ell)$. In this paper, we establish some equidistributed results…

We investigate properties of attainable partitions of integers, where a partition $(n_1,n_2, \dots, n_r)$ of $n$ is attainable if $\sum (3-2i)n_i\geq 0$. Conjecturally, under an extension of the Cohen and Lenstra heuristics by Holmin et.…

In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all…

In this paper we present an extension of Stanley's theorem related to partitions of positive integers. Stanley's theorem states a relation between "the sum of the numbers of distinct members in the partitions of a positive integer $n$" and…

The notion of noncrossing linked partition arose from the study of certain transforms in free probability theory. It is known that the number of noncrossing linked partitions of [n+1] is equal to the n-th large Schroder number $r_n$, which…

Let $X_1,\dots, X_n$ be independent integers distributed uniformly on $\{1,\dots, M\}$, $M=M(n)\to\infty$ however slow. A partition $S$ of $[n]$ into $\nu$ non-empty subsets $S_1,\dots, S_{\nu}$ is called perfect, if all $\nu$ values…

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…

A new formula for the partition function $p(n)$ is developed. We show that the number of partitions of $n$ can be expressed as the sum of a simple function of the two largest parts of all partitions. Specifically, if $a_1 + >... + a_k = n$…

An integer partition of $n$ is called graphical if its parts form a degree sequence of a simple graph. While unrestricted graphical partitions have been extensively studied, much less is known when the parts are restricted to a prescribed…

An ordered partition of $[n]=\{1, 2, \ldots, n\}$ is a partition whose blocks are endowed with a linear order. Let $\mathcal{OP}_{n,k}$ be set of ordered partitions of $[n]$ with $k$ blocks and $\mathcal{OP}_{n,k}(\sigma)$ be set of ordered…

Distributing spatially located heterogeneous workloads is an important problem in parallel scientific computing. We investigate the problem of partitioning such workloads (represented as a matrix of non-negative integers) into rectangles,…

For $n \in \mathbb{N}$ let $\Pi[n]$ denote the set of partitions of $n$, i.e., the set of positive integer tuples $(x_1,x_2,\ldots,x_k)$ such that $x_1 \geq x_2 \geq \cdots \geq x_k$ and $x_1 + x_2 + \cdots + x_k = n$. Fixing…

Following Cayley, MacMahon, and Sylvester, define a non-unitary partition to be an integer partition with no part equal to one, and let $\nu(n)$ denote the number of non-unitary partitions of size $n$. In a 2021 paper, the sixth author…

We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts)…

A classical method for partition generating functions is developed into a tool with wide applications. New expansions of well-known theorems are derived, and new results for partitions with n copies of n are presented.

Two algorithms for computing $P(n,m)$, the number of integer partitions of $n$ into exactly $m$ parts, are described, and using a combination of these two algorithms, the resulting algorithm is $O(n^{3/2})$. The second algorithm uses a list…

We show that integer partitions, the fundamental building blocks in additive number theory, detect prime numbers in an unexpected way. Answering a question of Schneider, we show that the primes are the solutions to special equations in…

As a well-known enumerative problem, the number of solutions of the equation $m=m_1+...+m_k$ with $m_1\leqslant...\leqslant m_k$ in positive integers is $\Pi(m,k)=\sum_{i=0}^k\Pi(m-k,i)$ and $\Pi$ is called the additive partition function.…

The Dyson rank of an integer partition is the difference between its largest part and the number of parts it contains. Using Fine-Dyson symmetry, we give formulas for the number of partitions of n with rank larger than n/2, and we prove…

For a sequence $M=(m_{i})_{i=0}^{\infty}$ of integers such that $m_{0}=1$, $m_{i}\geq 2$ for $i\geq 1$, let $p_{M}(n)$ denote the number of partitions of $n$ into parts of the form $m_{0}m_{1}\cdots m_{r}$. In this paper we show that for…