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
0answers
21 views

Determining probabilities of set of independent experiments from probability of different subsets?

I have a population C of candidates C1..Cn An event will occur to Ci with unknown probability Pi (Pi are independent) The population is divided into disjoint sets S1..Sm For each sub set Si, P(Si) is ...
1
vote
0answers
90 views

Is every integer $\geq5$ the sum of two primes and a power of a prime?

Is every integer $\geq5$ the sum of two primes and a power of a prime (where $1$ is included in the prime powers)? I don't really expect someone to prove this here, but I wonder if the question has ...
1
vote
0answers
32 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 ...
1
vote
0answers
38 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 ...
1
vote
0answers
47 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
62 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
43 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) = ...
1
vote
0answers
86 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
0answers
21 views

Existence of finite Darboux sum with infinite partition

I would like to describe the class of all functions $a\in L^1(\mathbb{R},dx)$, such that there exists $\tilde{a}=a$ a.s. and a size $h$ of an infinite partition of $\mathbb{R}$, such that ...
1
vote
0answers
40 views

Standard form for partitions of $Z_n$

Let $A$ and $B$ be partitions of $Z_n$. Let's say that $A$ and $B$ are equivalent if $A=Bx+y$ for some $x\in{1,−1}$ and $y\in Z_n$. In other words, two partitions are equivalent if one can be obtained ...
1
vote
0answers
56 views

No simple closed form for Bell numbers

The Bell number $B_n$ is the number of partitions of $[n]$. Unlike other basic combinatorial quantities, $B_n$ has no simple finite closed form. This seems surprising to me. Can anyone explain why ...
1
vote
0answers
25 views

Proof of the formula for the number of components in all partitions of a given number

I have to show that this formula is the number of components in all partitions of number $n$: $$\sum_{i=1}^{n}\sum_{j=1}^{[n/i]}\sum_{k=0}^{n-ij}A_i(k) \cdot A_{j-1}(n-ij-k)$$ $A_k(n)$ is number of ...
1
vote
0answers
70 views

Integer partitions without rotated solutions?

I'm searching for an algorithm to determine a list of all integer partitions of a number $n$ into a fixed number $m$ of summands (say $n=6$ and $m=4$), for instance to be stored into a list of ...
1
vote
0answers
67 views

How to describe any partition a set

For ignore of a better word, I will use word "partition" try to describe what I mean. How to describe partition(where over lapping subsets are allowed) of a set mathematically? In another word, ...
1
vote
0answers
33 views

Bound and parity integer-partition into fixed number of parts

Let $E(n,k)$ denote how many set of $k$ distinct non-negative integer are there such that their sum is an even number $\leq n$. Let $O(n,k)$ denote how many set of $k$ distinct non-negative integer ...
1
vote
0answers
60 views

Generation of n terms that sums to a specific value?

I'm about to conduct an integer program where I am to transport some products from different cities to docks and refinement stations. I am however required to work with simulated data where I only ...
1
vote
0answers
77 views

Definition of a Regular Partition of a Closed Generalized Rectangle in $\mathbb R^n$

What the heck does this definition of a regular partition $P$ of $R$ mean? I follow what it is saying until we get to the last part, "the $k_1\cdot k_2\cdot \cdots \cdot k_n$ subrectangles of the ...
1
vote
0answers
21 views

Limits and integration

I have the following quick question: Consider bounded open domain $O \subset \mathbb{R}^{n}$ assume that we partition $O$ into $O_{1}^{m}$ and $O_{2}^{m}$ such that $O_{1}^{m},O_{2}^{m} \subset O$, ...
1
vote
0answers
83 views

Explanation of block systems and group action

According to Wikipedia: "If $B$ is a block then $gB$ is a block for any $g$ in $G$. If $G$ acts transitively on $X$, then the set $\{gB \mid g \in G\}$ is a block system on $X$." i.e., $\{gB \mid g ...
1
vote
0answers
72 views

Monoid on ordered partitions of a natural number

Fix a natural number $n$, and let $O_n$ be the set of ordered partitions of $n$. For example $O_3=\{1+1+1,1+2,2+1,3\}$ which can also be written as $\{1|2|3,1|23,12|3,123\}$. We can define two ...
1
vote
0answers
397 views

Counting distinct restricted integer partitions of $n$ into exactly $k$ distinct parts less or equal then $M$

How can I find the number of partitions of $n$ into exactly $k$ distinct parts, where each part is at most $M$? The number of partitions $p_k(\leq M,n)$ of $n$ into at most $k$ parts, each of size at ...
1
vote
0answers
27 views

partitions are the elements of the free abelian monoid on $\aleph_0$ generators

although the following insight may not be particularly profound, it is always of interest when we see a canonical isomorphism between objects of apparently different types. it is a commonplace that ...
1
vote
0answers
29 views

Finding equivalence relations containing specific equivalences

"Find the number of equivalence relations on the set $\{1,2,3,\ldots,7\}$ such that: a) $1\sim2$ and $3\sim4$. b) $1\not\sim2$, $1\not\sim3$ and $3\not\sim2$." Solving this problem is equivalent to ...
1
vote
0answers
39 views

Partitions that have at most k parts and all parts <= j

Let p¯k(n) be the number of partitions of n with largest part at most k which is equivalent to partition into at most k parts. I do know an expression for that function. ( product of 1/1(1-n) through ...
1
vote
0answers
60 views

Teminology: Partitioning a Set Including Empty Partitions

Mostly I see a partition of a set A defined as a collection of non-empty disjoint sets whose union is A. I see one reference that allows empty sets to be included in the partition: ("Potter, M. "Set ...
1
vote
0answers
48 views

Discriminating integer partitions

Given a fixed positive integer, say $n$, letn $P_n$ be the set all partitions of $n$, where each partition itself is a set i.e. order is discarded and each part is less than 5. Can we establish a ...
1
vote
0answers
67 views

Running the Greene-Nijenhuis algorithm backwards

Let $Y$ be a Young tableau of shape $\lambda:=(\lambda_1,\ldots,\lambda_n)$, where $\lambda_1\geq\lambda_2\geq\ldots\geq\lambda_n$ and $N:=|\lambda|:=\sum_i\lambda_i$. I'll be using the English ...
1
vote
0answers
59 views

Non-standard partition of integers question

The question is as follows. Partition an integer $n$ into $r$ distintc parts with each part ranges from $[1,m]$ and the parts order is irrelevant. How many ways of different partitions are there? ...
1
vote
0answers
40 views

What is the big-$\mathcal{O}$ bound for the sum of function applied to the partitions of a set?

Consider a set $A$ that is partitioned into $n$ subsets $A_1 | A_2 | ... | A_n$ and a function $f \in \mathcal{O}(g)$. Question: what is the tightest bound I can establish for $\sum_{i=1}^n ...
1
vote
0answers
129 views

Shifted Young tableaux & Hook numbers & Bulgarian Solitaire

I would like to find articles or documentation regarding this process: Starting from what ever integer partition, e.g. 5,2 for the number 7. Construct his Young tableaux and then fill it with Hook ...
1
vote
0answers
152 views

Number of solutions (excluding permutations of variables' values) and solving in distinct positive integers the following system of equations

Questions and important info in italics, very important ones in bold. Here we have the system; $V_{1}+V_{2}\cdots+V_{k}=A$ and $V_{1}^{2}+V_{2}^{2}+\cdots +V_{k}^{2}=B$ where $V_{1}$, $V_{2}$, etc. ...
1
vote
0answers
116 views

Partition of unity. Functional analysis

Need to find partition of unity in case of oparator $A_{f}(x)=(|x-1|+x)f(x)$. Operator $A \in L_{2}[0,2]$ Partition of Unity is set of operators $E_{\lambda}=E((- \infty,\lambda]) $, where ...
1
vote
0answers
135 views

Given $x = \sum_{i \in k} a_i$ from $\{ a_1, \ldots, a_n \}$, partition $x$ as $\sum_{j \in k} a_j$

Let me put this into an example. We have an array of the first $r$ (example $r=7$) natural numbers; $1, 2, 3, 4, 5, 6, 7$ and given $k=3$, so you get to select any three integers from the pool ...
1
vote
0answers
159 views

Jordan Measure, Semi-closed sets and Partitions

From earlier question here. Consider $$\mu \left( (0,1) \cap \mathbb Q \right) = 0$$ where $$(0,1) = \left(0,\frac{1}{3}\right)\cup \left[\frac{1}{3}, \frac{2}{3}\right] \cup \left(\frac{2}{3}, ...
0
votes
0answers
19 views

Can you partition a rectangle into exactly 3 congruent non-rectangular parts?

Recently I came upon the following result: Theorem (*): Let $n$ be a positive integer not equal to $1,3,5,7,9$. Then it is possible to partition a rectangle into exactly $n$ congruent non-rectangular ...
0
votes
0answers
25 views

Determine the number of partition of 20 into at most 5 parts.

Im stuck on these questions, I can kind of compute them on maxima, but I have to figure out why and how to get to a particular generating function or method. Determine the number of partition of 20 ...
0
votes
0answers
12 views

On t-core partitions

How exactly can one define what is known as a t-core partition? I know (vaguely) that it involves the definition of what is known as "Hook numbers". Anyone cares to provide a link or explain it?
0
votes
0answers
27 views

dot diagram prove

I have to prove theorems using dot diagrams. a.- $P_n(k) = p_n(k-n)$ b.- $p_n(k) = p_{n-1}(k) + p_n(k-n)$ c.- The number $P_n(k)$ of partitions of $k$ into exactly $n$ parts is equal to the number ...
0
votes
0answers
43 views

Proof of Ramanujan's Identities of Euler's Function

Consider Euler's Function defined as (and not to be confused with the totient!) $$ \phi(x) = (1-x)(1 - x^2) (1 - x^3 ) .... = \prod_{i=1}^{\infty} \left[(1 - x)^i \right] = (1;x)_{\infty}$$ ...
0
votes
0answers
17 views

Can I partition a non-separable set?

This question flashed in my mind, as I was studying quotient partition of a set. Is there any non-separability condition for which a topological set cannot be partitioned? Particularly, I tried ...
0
votes
0answers
48 views

Prove; regarding partitions and refinements

If $ f $ is a bounded function, then for every $ \epsilon >0 $ there exists a partition of a real interval $ X $ such that if $ Y $ is a refinement of $ X $. Why is this true?
0
votes
0answers
34 views

Generalization of Catalan numbers

I am looking for some kind of function describing the number of non-crossing partitions similar to those described by the Catalan numbers. Let's say $C_3$ would be the third Catalan number. $C_3=5$ ...
0
votes
0answers
32 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 ...
0
votes
0answers
48 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 ...
0
votes
0answers
49 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 ...
0
votes
0answers
56 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
40 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 ...
0
votes
0answers
37 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 ...
0
votes
0answers
21 views

K-way Undirected Weighted Graph Partition with K Vertices Pre-Assigned

I have an undirected weighted graph to be partitioned into k subgraphs with minimal edge weight between the partitions and k of the vertices are constrained to lie in separate partitions. I am ...
0
votes
0answers
89 views

Real Analysis: Show that g is integrable on [a,b] and that $\int_a^b$ $g(x)dx=$ $\int_a^b$ $f(x)dx$

Suppose f is integrable and g is bounded on [a,b], and g differs from f only at points in a set H with the following property: For each $\epsilon>0$, H can be covered by a finite number of closed ...