Add to ORKGPartitions of the set {1,2,...,n} are classified as having successions if a block contains con-secutive integers, and separated otherwise. This paper constructs enumeration formulas for such set partitions and some variations using Stirling numbers of the second kind. 1
24 pages, 1 figure. This version (version 2) : one footnote was added in sec 5.1, one missing symbol...
The theory’s main theorem states that the cardinality of set parti-tions of size k on a carrier set ...
Focusing on a very active area of mathematical research in the last decade, Combinatorics of Set Par...
Partitions of the set {1,2,...,n} are classified as having successions if a block contains con-secut...
AbstractWe enumerate set partitions by strings of consecutive elements, or successions, and obtain a...
Let P (n, k) denote the set of partitions of {1, 2, ... , n} having exactly k blocks. In this paper,...
AbstractWe enumerate set partitions by strings of consecutive elements, or successions, and obtain a...
AbstractBased on finite set partitions, we introduce restrictions to the distances among the element...
summary:Let $S$ be a non-empty subset of positive integers. A partition of a positive integer $n$ ...
The connection between P(m, n), the number of partitions of a set containing m elements as a disjoin...
AbstractA partition u of [ k ] = {1, 2,⋯ , k } is contained in another partition v of [ l ] if [ l ]...
Bell and Stirling numbers of first and second kind tell the number of ways that n objects, or n cycl...
The first chapter examines $p_b(n)$, the number of partitions of $n$ into powers of $b$, along with ...
We introduce the notion of arithmetic progression blocks or m-AP-blocks of Zn, which can be represen...
The first chapter examines $p_b(n)$, the number of partitions of $n$ into powers of $b$, along with ...
24 pages, 1 figure. This version (version 2) : one footnote was added in sec 5.1, one missing symbol...
The theory’s main theorem states that the cardinality of set parti-tions of size k on a carrier set ...
Focusing on a very active area of mathematical research in the last decade, Combinatorics of Set Par...
Partitions of the set {1,2,...,n} are classified as having successions if a block contains con-secut...
AbstractWe enumerate set partitions by strings of consecutive elements, or successions, and obtain a...
Let P (n, k) denote the set of partitions of {1, 2, ... , n} having exactly k blocks. In this paper,...
AbstractWe enumerate set partitions by strings of consecutive elements, or successions, and obtain a...
AbstractBased on finite set partitions, we introduce restrictions to the distances among the element...
summary:Let $S$ be a non-empty subset of positive integers. A partition of a positive integer $n$ ...
The connection between P(m, n), the number of partitions of a set containing m elements as a disjoin...
AbstractA partition u of [ k ] = {1, 2,⋯ , k } is contained in another partition v of [ l ] if [ l ]...
Bell and Stirling numbers of first and second kind tell the number of ways that n objects, or n cycl...
The first chapter examines $p_b(n)$, the number of partitions of $n$ into powers of $b$, along with ...
We introduce the notion of arithmetic progression blocks or m-AP-blocks of Zn, which can be represen...
The first chapter examines $p_b(n)$, the number of partitions of $n$ into powers of $b$, along with ...
24 pages, 1 figure. This version (version 2) : one footnote was added in sec 5.1, one missing symbol...
The theory’s main theorem states that the cardinality of set parti-tions of size k on a carrier set ...
Focusing on a very active area of mathematical research in the last decade, Combinatorics of Set Par...