Some observations concerning the lattices of integer partitions are presented. We determine the size of the standard contexts, discuss a recursive construction ...

Our goal is to make the lattices of integer partitions better accessible to the powerful algorithms of Formal Concept Analysis. As a first step, we investigate.

We examine integer partitions from the perspective of Formal Concept Analysis, a mathematical research direction that arose in the 1980s.

Note that a partition can be odd and distinct at the same time (4 = 3 + 1), only odd. (2 = 1 + 1), only distinct (6 = 3 + 2 + 1), or neither odd nor distinct ...

The theory of integer partitions has a long history, dating back to many of the great mathematicians, including Ramanujan, Euler, Legendre, and Hardy.

We examine integer partitions from the perspective of Formal Concept Analysis, a mathematical research direction that arose in the 1980s and that provides ...

1 A partition of a positive integer n is a multiset of positive integers that sum to n. We denote the number of partitions of n by pn. · 2 The partitions of 5 ...

Let n be a positive integer. A partition of n is a way to write n as a sum of one or more positive integers (called the parts of the partition).

Jul 10, 2023 · A partition of a positive integer n is a sequence of positive integers that sum up to n. From the introduction, the partitions of 5 are 1 +1 + 1 + 1 + 1, 2 + 1 ...

In standard representation, a partition is any finite or infinite weakly decreasing. (or non-increasing) sequence of non-negative integers. ( containing only ...