Skip to main content

All Questions

0 votes
0 answers
84 views

number of "equivalence relations" on a set with "n-elements"

I am trying to find a formula for number of equivalence relations on a set with n-elements however I am confused. I have already encountered the idea of "bell's number" and "Stirling ...
Sepehr GH's user avatar
3 votes
1 answer
161 views

Confusion about a factor in a composition of series/Faa di Bruno formula

In the wikipedia article on the Faà di Bruno formula, one considers the composition of two "exponential/Taylor-like" series $\displaystyle f(x)=\sum_{n=1}^\infty {\frac{a_n}{n!}} x^n\; $ ($...
Noix07's user avatar
  • 3,679
0 votes
1 answer
105 views

Problem about counting partitions

The number $f(n)=B(n)-\sum_{k=1}^n B(n-k) {n \choose k}$ counts certain partitions of $[n]$.Which partitions? From Wiki, The Bell numbers satisfy a recurrence relation involving binomial coefficients:...
spruce's user avatar
  • 695
1 vote
1 answer
112 views

Show that $\left| A_n \right| = \sum_{k=1}^{n} (-1)^k \binom{n}{k} B(n - k)$ where $B(n)$ is the nth Bell number.

I am having some trouble solving the following problem: Let $A_n$ be the set of set partitions of $\{1, . . . , n\}$ without any singleton blocks. Show that $$\left| A_n \right| = \sum_{k=0}^{n} (-1)^...
Alexis Sandoval's user avatar
2 votes
2 answers
313 views

How many different equivalence relations with exactly two different equivalence classes are there on a set with $n$ elements

I came across with this topic. It looks straight forward for $5$ elements, but what if I want to find how many different equivalence relations with exactly two different equivalence classes are there ...
vesii's user avatar
  • 1,979
4 votes
2 answers
1k views

$F(n)$ is number of ways to partition set of $n$ without singleton blocks. Prove that $B(n) = F(n) + F(n+1)$

In this case $B(n)$ is $n$-th Bell number. To be honest, I would really love to know if there is a combinatorial proof for that. If there is not, other proofs are appreciated too.
math-traveler's user avatar
0 votes
1 answer
196 views

Relation between Bell number and $F(n)$ the number of partitions of $[n]$ without singeton blocks

Let $F(n)$ be the number of all partitions of $[n]$ with no singleton blocks. Prove that $$\lim_{n\to\infty}\frac{F(n)}{B(n)}=0$$ According to this question, we can know $$F(n+1)=\sum_{i=0}^{n-1}(-1)^...
Leo SHEN's user avatar
  • 153
4 votes
1 answer
111 views

Dividing 12 people into any number of groups, such that person A and B are not in the same group?

In how many ways can you divide 12 people into any number of groups, such that person A and B are not in the same group? I am trying to solve this question and so far I am thinking of this in terms ...
skidjoe's user avatar
  • 365
3 votes
1 answer
577 views

Formula for computing the coefficients of Bell polynomial

I'm working on Bell polynomials and have learned some of its properties, but I've never seen any formula for calculating the coefficient in Bell polynomials. My trying to find these coefficients was ...
Absurd's user avatar
  • 379
0 votes
2 answers
1k views

Partitions of a set with n elements (proof)

I was reading a textbook about combinatorial mathematic which claimed that we can calculate the exact possible partitions of a set with n elements . I searched it on wikipedia and I read about bell ...
user avatar
1 vote
1 answer
338 views

Number of cycle partition of a set with repeating elements

We have a set $S$ with $E$ elements of which only $N$ are unique. We of course know how many repetitions of each of the $N$ elements are present: element $s_i$ is repeating $t_i$ times. I would like ...
Ninja Warrior's user avatar
2 votes
1 answer
3k views

How many partitions are there of a 5 element set into 3 parts (of a specific form)?

I am currently trying to understand the number of ways of partitioning a 5 element set into 3 parts. However, I am only interested in partitions with the form $$ \left\{ \{ a, b \}, \{c, d\}, \{e \} \...
M Smith's user avatar
  • 2,737
0 votes
1 answer
154 views

Probability of set partition

Let $A = \{1\dots n\}$. Do partition of set $A$ on pairwise disjoint two- and three-element subsets randomly. For each n determine probability that number of two-element subsets is equal to three-...
M. Red's user avatar
  • 350