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

13
votes
0answers
305 views

Visualizing the Partition numbers (suggestions for visualization techniques)

So Ken Ono says that the partition numbers behave like fractals, in which case I'd like to try to find an appropriately illuminating way of visualizing them. But I'm sort of stuck at the moment, so ...
7
votes
0answers
168 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 ...
7
votes
0answers
202 views

Partitions of 13 and 14 into either four or five smaller integers

There are exactly 18 partitions of the integer 13 into 4 parts, as on the left of the table, and also 18 partitions into 5 parts, as on the right of the table: $$\begin{array}{c|c} 10+1+1+1 & ...
7
votes
0answers
76 views

Partitioning points with a line

Let $A_{m, n} = \{1, 2, \dots, n\} \times \{1, 2, \dots, m\}$. A straight line would partition the points into two sets. How many ways are there to do it? Let $p_{m, n}$ be that number. Apparently ...
7
votes
0answers
238 views

Is there some sort of correspondence between groups and partitions of a set?

Every group action on a set $S$ partitions the set into orbits. Conversely, for every partition of $S$ is there a group action such that the set of orbits of the group action equals the partition? ...
7
votes
0answers
275 views

Is there a connection between the 3D random walk constant and the partition function?

In thinking about this question, I took a look at Pólya's random walk constants and was struck by the fact that an expression for the constant for a three-dimensional random walk, ...
6
votes
0answers
300 views

Young Tableaux as Matrices

These questions are motivated only by curiosity. Take a Young tableau of shape $(\lambda_1,\lambda_2,\ldots,\lambda_n)$, where $\lambda_1\geq\lambda_2\geq\ldots\geq \lambda_n)$. Is there any physical ...
6
votes
0answers
214 views

Invariant element in the tensor product of rectangular Specht modules?

Denote by $\mathfrak{S}_k$ the symmetric group on $k$ elements. Let $\lambda=(n^2\times n)=(n^2,\ldots,n^2)$ be a rectangular partition and $k=n^3$. Denote by $S_\lambda$ the Specht module ...
5
votes
0answers
85 views

The smallest non-zero integer $c$ such that $\sum\limits_{n=1}^m\pm(x+n)^6 = c$?

We have the neat equalities, I. Group 1 For $k=2,3,4,5,\dots$ $$\sum_{n=1}^{2^k}\epsilon_n(x+n)^k = 2^{\frac{k(k-1)}{2}}k! = 4,\;48,\;1536,\;\color{brown}{122880},\dots$$ for appropriate ...
5
votes
0answers
49 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 ...
5
votes
0answers
265 views

Which unordered partition of $n$ gives rise to the largest number of ordered partitions?

A quick look at the wikipedia article on partitions of $n \in \mathbb{N}$ shows that the number of ordered partitions is $2^{n-1}$, and the number of unordered partitions is asymptotically $ \sim ...
4
votes
0answers
94 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
0answers
96 views

On Applications of the Murnagham Nakayama rule

The question is located below. In short, I am looking for an accessible explanation of the Murnagham Nakayama rule in relation to the following problem. Pardon the long setup. Let $Y$ be a standard ...
4
votes
0answers
125 views

A general Combinatorics problem (Coefficients of the q factorial)

I was solving a combinatorics problem when I encountered difficulties. The problem was: $x_1 \in \{0,1\}$ $x_2 \in \{0,1,2\}$ . . $x_{n-1}\in\{0,1,2..,n-1\}$ We have to find the number of ways ...
4
votes
0answers
115 views

Why limit Euler's Partition function P to $k\leq\sqrt n$ instead of $k\leq n$?

I solved a Project Euler problem (I won't say which one) involving the Partition Function P. I used equation #11 from the above link: $$P(n) = \sum_{k=1}^n (-1)^{k+1}\bigg(P\Big(n-{1\over ...
3
votes
0answers
71 views

Elementary proof of Ramanujan's “most beautiful identity”

Ramanujan presented many identities, Hardy chose one which for him represented the best of Ramanujan. There are many proofs for this identity. (for example, H. H. Chan’s proof, M. Hirschhorn's ...
3
votes
0answers
46 views

Counting the number of partitions that are a distance d away from a fixed partition.

Given a positive integer $N \in \mathbb{Z}^{\geq 0}$ let $Partitions(N)$ denote the set of all partitions of $N$, where a tuple $\left(f_1,\ldots,f_N \right)$ is a partition of $N$ if $\sum_{i=1}^N ...
3
votes
0answers
61 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 ...
3
votes
0answers
73 views

What is the 'optimal' equal-area partition of a circle?

What is the (an?) n-partition of a circle that meets the following criteria: The boundaries of each partition can be represented as a union of finitely many finite-piecewise-smooth simple closed ...
3
votes
0answers
36 views

Arithmetic properties of the partition function

Ramanujan mentioned in his paper in 1920 that "it appears that there are no equally simple properties for any moduli involving primes other than these three" $p(5n+4)\equiv0 \mod 5$ $p(7n+5)\equiv0 ...
3
votes
0answers
49 views

How many partitions of 12 that fit the requirements?

How many partitions of $12$ are there that have at least four parts, such that the largest, second-largest, third-largest, and fourth-largest parts are respectively greater than or equal to $4,3,2,1$? ...
3
votes
0answers
76 views

Asymptotics of partitions in at most n parts, bounded by r

For every positive integers $n,r,w$ define $$ p_w(n,r)=\#\{ (i_1,...,i_r) | \, 0\leq i_1 \leq \dots \leq i_r\leq n, \, i_1+\dots+i_r=w\} $$ as the number of partitions of $w$ in at most $r$ piece ...
3
votes
0answers
57 views

Partial order on the orbits of the variety of commuting nilpotent matrices

The variety of nilpotent $n\times n$ matrices $\mathcal{N}_n$ over an algebraically closed field $k$ is the disjoint union of orbits under the action of conjugation by $GL_n(k)$. These orbits are ...
3
votes
0answers
108 views

If $f$ is quasi and left continuous on $[a,b]$ and $\alpha$ is increasing and right continuous then $f$ is Riemann-Stieltjes integrable over $[a,b]$

Question: If $f$ is quasi and left continuous on $[a,b]$ and $\alpha$ is increasing and right continuous then $f$ is Riemann-Stieltjes integrable over $[a,b]$ with integrator $\alpha$. ...
2
votes
0answers
51 views

Recurrence relation / recursive formula / closed formula for partition numbers (1,2,3,5,7,11,15,22,30,42,…)

I have already read this: Number partition - prove recursive formula But the formula from the above link requires a parameter k which is the required number of ...
2
votes
0answers
24 views

Link between partition function and ordered partition function

The partition function $p(n)$ measures the number of partitions of $n$, or the number of ways in which natural numbers can be summed to produce $n$, without regard to order. For example, the ...
2
votes
0answers
38 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
0answers
46 views

Partitions of $\mathbb{R}^+$ into subset closed by sum and product

Suppose we can partition $\mathbb{R}$ into two subset $A,B$, both non empty and closed by sum and product. Let $0\in A$, and suppose that exists $b\in B$. Then $b^2\in B$. Now, $-b\in B$, cause if ...
2
votes
0answers
21 views

asymptotic approximation for number of partitions of integer that do contain 1 nor 2

Hardy and Ramanujan provided a famous asymptotic approximation to $P(n)$ the number of partitions of an integer $n$ when $n$ gets large. I wonder if there is an asymptotic approximation to ...
2
votes
0answers
25 views

What are all the possible sums (and how often do they occur) of a k-subsequence of an n-sequence of integers?

Let $A_n = \{a_1,\dots,a_n\}$ be a sequence of non-decreasing non-negative integers. Let $P(A_n,k)$ be the set of all subsequences of $A_n$ of length $k$. Given $n,k\in\mathbb Z_{\geqslant0}$ with ...
2
votes
0answers
41 views

Partitions and divisor functions: what is known about their relations?

If $i\geq 1$ is an integer, we have the following integer valued functions (for any integer $n\geq 0$): \begin{align} p_i(n)&=\textrm{the number of }i\textrm{-dimensional partitions of ...
2
votes
0answers
28 views

Quantiles when the population contains only one unique value

My apologies for the mixing of the terms quartile and quantile below. I am interested in the general case of quantiles, but I'm using a quartile as a specific example. Also feel free to clarify any ...
2
votes
0answers
62 views

What is the least integer of additive dimension 4?

Say that $m$ is the additive dimension of $n\in\Bbb N$, and write $m=\operatorname{ad}n$, if $m$ is the greatest integer for which there is an irredundant $m$-element set $M\subset\Bbb N$ that ...
2
votes
0answers
27 views

Canonical partition function identity

The grand canonical partition function, Z, is given by $$ Z = \sum_{M=0}^\infty G(M)z^M =\frac{V_0(z)U_L(z)}{1−U(z)V (z)} \tag{1} $$ where G(M) is the canonical partition function of a chain of ...
2
votes
0answers
65 views

Distributing problem using generating functions

For $r\in\mathbb{Z^*}$, let $a_r$ denote the number of ways to distribute $r$ identical objects into $3$ identical boxes, $b_r$ be the number of distributions so that the boxes are to be non-empty, ...
2
votes
0answers
42 views

explicit random cake cutting

I like to split a given interval, let's say $[0,1]$, randomly to a given number $n$ parts. A random input may be provided, like for example a sequence of random numbers $\omega=(r1, r2, ...
2
votes
0answers
77 views

Bell number with minimum bound on partition size

I know that the Bell number $B_n$ is the number of ways to partition a set of $n$ elements into distinct non-empty subsets. Is there a variant of this number that specifies the minimum number of ...
2
votes
0answers
20 views

Terminology for breaking partition diagram into “L”'s

When one thinks about partitions, it's quite normal to consider pieces of the partition diagram, such as rows, columns, arms, legs, hooks, etc. One decomposition of particular interest to me is ...
2
votes
0answers
102 views

What is the correct technical term for this generalization of an integer partition?

Given a vector $v$ with non-negative integer coordinates, is there a technical term for an unordered tuple of vectors $(v_1,\dots, v_k)$ with non-negative integer coordinates such that $v_1+\dots+v_k ...
2
votes
0answers
162 views

Partition minimizing maximum of Euler's totient function across terms

Given natural numbers $M$ and $N$, I'd like to find a partition of $2^N$ with $M$ or fewer terms, $t_1 + t_2 + ... + t_M$, such that $\max(\phi(t_1), \phi(t_2), ..., \phi(t_M))$ is minimized, where ...
2
votes
0answers
238 views

Generating Function of Integer Partition Such that at Least One Part is Even

I've been having a few issues coming up with a generating function for an integer partition such that at least one part is even. What I have got so far is: The generating function with no ...
2
votes
0answers
32 views

order of elements in a partition using Maple

I determined this whole partition but I just want to have the finer the partition for example: I have this ...
1
vote
0answers
50 views

Counting problem of combinations of symmetric matrix.

Given, a symmetric $n*n$ matrix $G$ with 0,1 entries. Each row of has same number of 1. $G$ is arranged in a certain order using a rule. The rule is described below- $G$ is partitioned in to two sub ...
1
vote
0answers
21 views

Notation for the set of all integer partitions

I'm working on a project that involves that set $P = \{\{n_1, \ldots, n_k\} \mid k \in \mathbb{N}, n_i \in \mathbb{N} \text{ and } n_1 + \cdots +n_k = n\}$ of all integer partitions of a number $n$. ...
1
vote
0answers
28 views

Terminology: Opposite of “refinement”

Let A be a partition of a set, and B a refinement of A. Fill in the blanks: A is a __________ of B. I know that A is coarser than B, but how does one turn that into a noun?
1
vote
0answers
18 views

Find largest regions bounded by a set of planes

Suppose we are given a set of planes that partition the unit cube into a large number of regions. Is there a computationally efficient way to find the region with the largest volume?
1
vote
0answers
30 views

Does Euler's recurrence relation for partitions imply that the partition function grows exponentially

Can one, just by manipulating the series, demonstrate that the partition function must be growing exponentially or at least that it is unbounded by any polynomial? If so, then how would it be done. ...
1
vote
0answers
17 views

What is wrong with this “inference” about partitions?

Given that: $p(n)=p(n-1)+p(n-2)-p(n-5)-p(n-7)+⋯$ Why can one not state: $p(n)≥p(n-1)+p(n-2)-p(n-5)-p(n-7)$ Here is the logic: the subsequent 2 terms of the relation are additive and the 2 ...
1
vote
0answers
23 views

Famous Arithmetic property of lotteries - restricted partition of integer into exactly k distinct parts between a given set

I would like to find a complete explanation regarding a famous arithmetic property of lotteries : Let´s say a friend of us is a regular player of a lottery where 5 numbers are taken from a box ...
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 ...