Questions related to the different ways of expressing an integer as a sum of integers; or, questions related to the subdivision of a set into smaller disjoint sets; questions related to the subdivision of an interval into smaller intervals that intersect only at the endpoints.

learn more… | top users | synonyms

1
vote
1answer
36 views

Number of Partitioning a deck with m cards in n types into n-element sets.

For exsample, There are 2cards in 3type. AA,BB,CC. Partition 6cards into 2 3-element sets. [AAB,BCC],[AAC,BBC],[ABB,ACC],[ABC,ABC],... 4 ways or Partition 6cards into 3 2-element sets. ...
0
votes
1answer
27 views

Partitioning elements into sets

How many ways are there to partition $n$ unique elements into $2$ sets? What about for $k$ sets? I am specifically interested in how to calculate this for varying values of $n$. Moreover, what if ...
0
votes
0answers
31 views

the number of ways a planar graph can be partitioned

i have a connected planar graph to cut into k parts and want to know how many possible solutions there are. it clearly depends on the shape of the graph since nodes all in a row cannot be partitioned ...
1
vote
1answer
33 views

Solving the equations $x_1= 4 x_2$ and $x_3= 5 x_2$, with the sum of all three being $150$

Here is the problem. A set X is partitioned into subsets x1, x2, and x3. The number of elements in x1 is 4 times the number in x2. And the number in x3 is 5 times the number in x2. If n(x)=150, ...
4
votes
2answers
46 views

What is the number $p(n)$ of partitions of an abundant number $n$ into distinct, proper divisors of $n$?

For lack of a better symbol, $p_{\sigma\tau}(n)$ (feel free to suggest something better). For example, $p_{\sigma\tau}(12) \geq 2$ since $12 = 1 + 2 + 3 + 6 = 2 + 4 + 6$. Of course if $n$ is ...
0
votes
1answer
78 views

Generating Functions of Partitions?

Show that $2(1-x)^{-3} [(1-x)^{-3} + (1+x)^{-3}]$ is the generating function for the number of ways to toss $r$ identical dice and obtain an even sum. Workings: I'm not too sure on this problem. ...
2
votes
2answers
49 views

how interpret this partition identity?

use the symbol $P(N)$ to denote the set of all partitions of a positive integer $N$ and denote by $P_k$ the number of occurrences of $k$ in the partition $P \in P(N)$, so that $$ N = \sum kP_k $$ by ...
2
votes
0answers
34 views

how to count possible planar bipartitions?

i want to find out what small fraction of a solution space a metaheuristic search is actually covering. this case comes down to the number of possible bipartitions for a non-bipartite, undirected ...
2
votes
1answer
55 views

How to find the restricted partition of n into k *distincts* parts between a finite set [1;r]?

It seems to be an opened question. Indeed, it is easy to find: the number of partitions of n into k distinct parts the number of partitions of n into k parts the number of partitions of n into k ...
1
vote
0answers
31 views

How to partition into more than two subsets

Given a set $A$ of numbers and the number of desired subsets, $n$, how can I divide the numbers in set $A$ into $n$ subsets where each number in $A$ is used in one and only one subset and the sum of ...
0
votes
1answer
34 views

Coin Change Problem - Find the number of ways to make change

I read the solution here http://www.algorithmist.com/index.php/Coin_Change basically to find the number of ways to make change: We are trying to count the number of distinct sets. it says " Since ...
2
votes
1answer
43 views

Does and where to does $\lim_{n\to\infty}\sum_{m} \prod_k \frac{1}{\lambda_{k,m}!}$ converge?

Given $n$ you get a number of partitions of $n$ and let's denote $\lambda_{k,m}$ to be the $k$th part of the $m$th partition. Now I built the following sum, that stimulated the following question: $$ ...
1
vote
0answers
26 views

Partitioning items into fixed size sets

I have the following problem: Given $n$ items, where each item has weight $w_{i}$, $i=1,2\ldots n$, what is the number of ways to partition these items into boxes of fixed size $C$, such that the sum ...
4
votes
0answers
86 views

Sum over subsets of a multiset

I have a sum that looks like the following for some multiset $S$ and some function $f$ of $n$ variables which does not depend on the ordering of its arguments: $$\sum_{\{k_1,\dots, k_n\}\subset ...
4
votes
1answer
43 views

How to denote sum over partitions?

How does one denote a sum of partitions of an integer when writing an article? For example, I have a formula regarding an integer-valued variable (say q=5), and I need to write an expression of the ...
1
vote
0answers
42 views

partitions of finite set in same-size parts having at most one element in common

Given g ≥ 2, k ≥ 1 and a population of p = kg workers, I'm trying to figure out the longest series of work shifts such that: during each shift, all workers work in k teams of g people; any two ...
1
vote
0answers
40 views

Expansion for r-associated Stirling numbers of the second kind

I am looking for a paper or guidance for expanding the r-associated Stirling numbers of the second kind $S_r(n,k)$. $S_r(n,k)$ is the number of ways to partition a set of n objects into k subsets, ...
1
vote
0answers
41 views

Expected Max Pseudotree Size

I'm working on a problem where I need to calculate the expected maximum pseudotree size in a randomly-generated pseudoforest with $n$ nodes. Expected maximum value is of course: $$ E(x) = ...
2
votes
2answers
81 views

Counting Set Partitions with Constraints

I'm trying to count set partitions under the following constraints: The number of partitions on $n$ elements where the largest cell(s) have exactly $k$ elements All cells have at least two elements ...
0
votes
0answers
46 views

Truncation of partitions generating function question

$A (x)$ is the generating function for partitions. $B(x)=\sum_{n=0}^{\infty}b_nx^n $ $$b_n =\binom{\text{number of partitions of }n}{\text{into an even number of parts}}-\binom{\text{number of ...
1
vote
1answer
28 views

Union of each family is not the whole set

Let $n\geq k>0$, and consider all $\binom{n}{k}$ subsets of $A=\{1,2,\ldots,n\}$ of size $k$. We want to partition it into families so that the union of each family is not equal to $A$. At least ...
6
votes
1answer
202 views

Number of Sets of Partitions

I looked at the partitions of numbers, like let's say $n=5$. You get $$ \begin{eqnarray} 5&=&5\\ \hline &=&4+1\\ &=&3+2\\ \hline &=&3+1+1\\ &=&1+2+2\\ \hline ...
1
vote
1answer
23 views

What are the number of possible partitions of a set containing n elements?

This question rises immediately if we try to enumerate the number of possible equivalence relations on a set with n elements.
4
votes
2answers
59 views

If $f$ is continuous on $[a,b)$ and $[b,c]$, then $f$ is Riemann integrable on $[a,c]$.

True or False: If $f$ is continuous on $[a, b)$ and on $[b, c]$, then $f$ is Riemann integrable on $[a, c]$. I was unsure if the $)$ in $[a,b)$ completely changed the problem and made it false and I ...
1
vote
2answers
45 views

If L(P, f) = U(P, f), prove that f is a constant function on [a, b]

That is what I have for the beginning of my proof, but I'm not sure how to conclude that the function is constant.
0
votes
1answer
33 views

Counting the number of possible matchups for teams

A tournament has 16 teams. How many ways are there to match up the teams in 8 pairs? Is it (16 choose 2)(14 choose 2)(12 choose 2)(10 choose 2)(8 choose 2)(6 choose 2)(4 choose 2)(2 choose 2)?
0
votes
1answer
20 views

Different flag signal questions

How many different signals can be created by lining up 9 flags in a vertical column in 3 flags are white, 2 are red, and 4 are blue? Is it 9 choose 3 * 6 choose 2 * 4 choose 4?
1
vote
1answer
442 views

Divide a set of $n$ elements into $k$ subsets having equal sum

Given $n$ ( $n$ <= 20) non-negative numbers. Is there / Can there be an algorithm with acceptable time complexity that determines whether the n numbers can be divided into $k$ ( $k$ <= 10) ...
0
votes
1answer
37 views

Prove that the number of partitions of $n$ into $3$ parts is equal to the number of partitions of $2n$ into $3$ parts, each of size less than $n$.

Prove that the number of partitions of $n$ into $3$ parts is equal to the number of partitions of $2n$ into $3$ parts, each of size less than $n$. I do not have any idea to prove this ...
0
votes
0answers
40 views

Minimize sum of squared error

I have an array of real numbers, I want to partition them into k sets. In each set, I calculate the sum of squared error. Then, I add up all the sum of squared error for all the set. I want to ...
2
votes
2answers
29 views

Prove that the number of partitions of $2010$ into $10$ parts is equal to the number of partitions of $2055$ into $10$ distinct parts.

Prove that the number of partitions of $2010$ into $10$ parts is equal to the number of partitions of $2055$ into $10$ distinct parts. How we can prove this?My idea is to construct a bijection but I ...
0
votes
0answers
36 views

Partition problem of equal size

I have an array S of size 2n, each element in the array is an integer I want to split it into two arrays of size n, and under this condition, minimize the difference of the sum of integers in the two ...
0
votes
0answers
35 views

Partition partition with constraint of equal size

I see the problem here Polynomial complexity algorithm of partition problem with sets of equal size This is the well know partition problem but with constraint that the size of both sets must be ...
5
votes
1answer
72 views

Flattening Young Tableaux

Let $\lambda=(\lambda_1,\lambda_2,\cdots,\lambda_k)$ be a partition with $|\lambda|=n$ and $\lambda_1\geq \lambda_2\geq\cdots\geq \lambda_k$. For any Standard Young Tableaux (SYT) $T$ of shape ...
0
votes
0answers
35 views

number of pairs that are member of a class of one of the given partitions

Suppose I am given a set of S partition of universal set A, define pair as (a,b) iff elements a,b are members of one of set in at least one partition. I want to know how many pairs in S. Example: $$A ...
1
vote
1answer
41 views

Find all Combinations of 1 and 2 which sums up to k.

I have two numbers $1$ and $2$. I have to print all ordered combinations which sums up to $k$. For example: $k=1$ Its only $1$. $k=2$ It's ${1,1},{2}$. $k=3$ Its ${1,1,1},{1,2},{2,1}$ What ...
0
votes
1answer
28 views

Proof of Partitions

Let $|n,k|$ denote the number of partitions of $n$ into $k$ distinct parts. Prove $$|n,k| = |n-k,k-1| + |n-k,k|$$ Workings: LHS counts the number of partitions of $n$ into $k$ distinct parts. RHS: ...
1
vote
2answers
52 views

Combinatorics] Partition Numbers

Let $R(n,k)$ denote the number of partitions of $n$ into $k$ (non-empty) parts. That is for example $R(7,2) = 3$ because it can be expressed as $1+6, 2+5$ and $3+4$. Prove that: $R(n,1) +R(n,2) + ...
1
vote
1answer
35 views

Algebra and partions of a set

My book in mathematical finance introduces algebras and partitions of a set, in order to explain how information is modeled to the investor. But there is one thing I don't get. They say that for every ...
5
votes
0answers
48 views

Degree distribution of a graph of integer partitions

Consider a graph whose nodes are the integer partitions of $n$, connected by an edge if you can get from one partition to the other by ‘sliding one square of its Young diagram’ – that is, if one ...
3
votes
0answers
56 views

The number of partitions by distinct positive numbers

Let $N>0$ be a natural number and let $P(N)$ denote the number of ways to write $N$ as a finite sum of $a_i$ such that the $a_i$ are strictly decreasing positive natural numbers. There is a paper ...
1
vote
1answer
38 views

Partitioning a finite set which sums to $n$

Given $n > 1$, we consider the finite sets of positive integers which sum to $n$, and out of these sets we want to maximize the product. For example, given $n = 6$, the set $\{1, 5\}$ does not ...
1
vote
0answers
52 views

Proving Identities using Partition and Generating Function

I have a problem with these two questions: Let $P_E(n)$ be the number of partitions of $n$ with an even number of parts, $P_O(n)$ the number of partitions of n with an odd number of parts, and ...
1
vote
1answer
63 views

Given the partition list the ordered pairs in the corresponding equivalence relation.

Given the partition $\{a,b,c\}$ and $\{d,e\}$ of the set $S=\{a,b,c,d,e\}$, list the ordered pairs in the corresponding equivalence relation. I'm not really sure how to get started on this and would ...
1
vote
4answers
24 views

Choosing three pairs out of eight items

3 students each choose two problems from a list of eight problems. How many ways can this be done? The answer in the text book gives 8!/(2! 2! 2! 2!), but don't we also have to multiply by the ...
13
votes
5answers
373 views

How many sets of distinct non-negative solutions are there to $k_1+\cdots+k_n=k$?

How many distinct $n$-tuples with distinct non-negative integer elements are there that add to $k$. For example there are $6$ triples that add to $4$. Namely $(0, 1, 3)$ and its $6$ permutations. ...
7
votes
0answers
165 views

Does $A193201$ count the partitions of $n$ of arbitrary dimension?

By my count, these sequences match for $n=0\ldots6$, where partitions that are the same after relabeling dimensions are considered equivalent (i.e., the dimensions are unordered). For example, for ...
3
votes
1answer
72 views

Demystifying the asymptotic expression for the partition function

A partition of an integer $n$ is a way of writing $n$ as a sum of integers. The partition function $p(n)$ counts the number of distinct partitions of $n$. In 1918, Hardy and Ramanujan proved the ...
0
votes
1answer
33 views

Equivalence classes, relation, partitions

Let $\sim$ be an equivalence relation on M, and $M/{\sim}$ to be the partition of M by $\sim$, and $\sim_{M/\sim}$ to be the equivalence relation by the partition. How do I show that the two ...
0
votes
1answer
101 views

Generating functions for partitions of n with an even number of parts and odd number of parts, and their difference.

I've been trying to figure this out for more than 10 hours. So far I have, for even number of partitions, $$P_e(x)=\sum_{k\ge1}(x^{2k}\prod_{i=1}^{2k}\frac{1}{1-x^i})$$ and for odd numbers ...