Related papers: Separable Integer Partition Classes
Splitting methods for the numerical integration of differential equations of order greater than two involve necessarily negative coefficients. This order barrier can be overcome by considering complex coefficients with positive real part.…
This paper introduced a way of fractal to solve the problem of taking count of the integer partitions, furthermore, using the method in this paper some recurrence equations concerning the integer partitions can be deduced, including the…
New families of fourth-order composition methods for the numerical integration of initial value problems defined by ordinary differential equations are proposed. They are designed when the problem can be separated into three parts in such a…
This overview is devoted to splitting methods, a class of numerical integrators intended for differential equations that can be subdivided into different problems easier to solve than the original system. Closely connected with this class…
The proposed system of integer functions is logically fully independent from the traditional mathematical analysis of the real functions, but there is a well-defined mutual correspondence between the two disciplines. The system of integer…
In this paper, we use the Lambert series generating function for Euler's totient function to introduce a new identity for the number of $1$'s in the partitions of $n$. A new expansion for Euler's partition function $p(n)$ is derived in this…
I present a bijection on integer partitions that leads to recursive expressions, closed formulae and generating functions for the cardinality of certain sets of partitions of a positive integer $n$. The bijection leads also to a product on…
The theory of partition congruences has been a fascinating and difficult subject for over a century now. In attempting to prove a given congruence family, multiple possible complications include the genus of the underlying modular curve,…
In this paper, we introduce a natural geometric extension of the partition function. More precisely, we investigate the problem of counting partitions of a rectangle into rectangular blocks with integer sides. Here, two partitions of a…
In this paper, we use a simple discrete dynamical model to study partitions of integers into powers of another integer. We extend and generalize some known results about their enumeration and counting, and we give new structural results. In…
The partition function $p(n)$, which counts the number of partitions of a positive integer $n$, is widely studied. Here, we study partition functions $p_S(n)$ that count partitions of $n$ into distinct parts satisfying certain congruence…
In this paper we give a fast algorithm to generate all partitions of a positive integer $n$. Integer partitions may be encoded as either ascending or descending compositions for the purposes of systematic generation. It is known that the…
Five simple guidelines are proposed to compute the generating function for the nonnegative integer solutions of a system of linear inequalities. In contrast to other approaches, the emphasis is on deriving recurrences. We show how to use…
The main aim of this paper is twofold: (1) Suggesting a statistical mechanical approach to the calculation of the generating function of restricted integer partition functions which count the number of partitions --- a way of writing an…
A class of random discrete distributions $P$ is introduced by means of a recursive splitting of unity. Assuming supercritical branching, we show that for partitions induced by sampling from such $P$ a power growth of the number of blocks is…
Partitioning a set of elements into an unknown number of mutually exclusive subsets is essential in many machine learning problems. However, assigning elements, such as samples in a dataset or neurons in a network layer, to an unknown and…
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$…
I propose two simple ways of generating the partitions of (n+1) from the partitions of n. A recurrence relation for P(n+1), the number of partitions of (n+1), in terms of P(n) and Q(n), where Q(n) denotes the number of partitions of n…
Two closely related discrete probability distributions are introduced. In each case the support is a set of vectors in $\mathbb{R}^n$ obtained from the partitions of the fixed positive integer $n$. These distributions arise naturally when…
An integral representation of the partition function for general $n$-dimensional Ising models with nearest or non-nearest neighbours interactions is given. The representation is used to derive some properties of the partition function. An…