The partitions tag has no wiki summary.

**0**

votes

**0**answers

57 views

### Classic question on integer partitions (with distinct summands)

I guess that the following was solved sometime in the 18th century, but could not find a reference to it. I am interested in approximations to the following integer partition problem:
Denote $R(N,L)$ ...

**4**

votes

**1**answer

215 views

### Euler-like identity for partition function

Following is the wonderful Euler's partition identity:
$$\prod_{i=1}^\infty (1 - x^i) = 1 + \sum_{k=1}^\infty (-1)^k \left (x^{(3k^2-k)/2} + x^{(3k^2+k)/2} \right )$$
I'm wondering if there is ...

**0**

votes

**0**answers

59 views

### how should this multinomial identity be written?

question if it is correct, how is the identity tagged (4) below usually written, and can the use of conjugate partitions be avoided?
motivation i apologize for the length of this question - it's as ...

**5**

votes

**1**answer

149 views

### A generalization of Erdős–Newman–Mirsky?

Given a sequence $S$ of natural numbers, write ${\bf Gap}(S)$ for the set of differences between consecutive terms. (So $|{\bf Gap}(S)|=1$ precisely for arithmetic progressions, hence the connection ...

**14**

votes

**0**answers

191 views

### Coloring a Ferrers diagram

I've shopped the problem below around a bit and it seems like it might be known, or not that hard to resolve, but so far I've come up empty-handed.
Say that a coloring of the dots of a Ferrers ...

**3**

votes

**1**answer

141 views

### A question of terminology regarding integer partitions

I am wondering if there is a standard notation and name for the following. Let $\lambda$ be a partition $\lambda_1\geq \lambda_2\geq\cdots\geq \lambda_r\geq 1$ of $n$ into $r$ parts. Then we can ...

**-2**

votes

**1**answer

104 views

### Combinatorical meaning of such expression [closed]

Any combinatorical meaning or interpretation of
$$1^{\alpha_1}2^{\alpha_2}3^{\alpha_3}...s^{\alpha_s}\alpha_1!\alpha_2!...\alpha_s!$$
for partition ...

**2**

votes

**0**answers

96 views

### Adding a row to a Young Tableau via Novelli-Pak-Stoyanovskii

Let $T_{\lambda}$ be the set of standard young tableaux (SYT) of shape $\lambda_1\geq \lambda_2\cdots\geq \lambda_n$. Now consider pushing a row $\mu$ with $\mu\geq \lambda_1$ onto $Y$ to give shape ...

**3**

votes

**0**answers

75 views

### Where does this identity involving sums of Hankel-like determinants over partitions come from?

For a partition $\lambda=( \lambda_1,\dots,\lambda_n)\vdash n$ with $\lambda_1\ge\dots\ge\lambda_n\ge0$ and any function $f:\mathbb Z\to\mathbb C$, define a Hankel-like $n\times n$ matrix ...

**3**

votes

**1**answer

119 views

### Infimum of partitions

Let $X\neq\emptyset$ be a set. A partition is a subset $P\subseteq {\cal P}(X)\setminus \{\emptyset\}$ such that $\bigcup P = X$ and any distinct members of $P$ are disjoint. We denote by ...

**2**

votes

**0**answers

48 views

### Optimal tiling for a collection of partitions

I'm interested in a possible generalization of Tiling relation on the set of partitions (the question has only been partially answered).
Let $x$ be an infinite set and let $\text{Part}(x)$ be the ...

**4**

votes

**1**answer

100 views

### Tiling relation on the set of partitions

Let $x\neq \emptyset$ be a set and let $\text{Part}(x)$ be the collection of
all partitions of $x$. We need the following notation. Let $P \in \text{Part}(x)$
and $t\subseteq x$. We set
$$P_{[t]} = ...

**1**

vote

**1**answer

107 views

### asymptotic for restricted partitions

Let $m$ and $n$ be two positive integers and denote by $P(n,m)$ the number of partitions of $n$ into $m$ non-negative integers.
Is there an asymptotic formula for $P(n,m)$ ?? Any reference is ...

**8**

votes

**1**answer

212 views

### For any two noncrossing partitions $p, q$ of $n$, is the graph of geodesics from $p$ to $q$ in $NC(n)$ connected?

Let $NC(n)$ denote the lattice of noncrossing partitions of $n$, and let $G$ denote the Hasse diagram of $NC(n)$ with respect to covering relations, viewed as an undirected graph.
I'm interested in ...

**6**

votes

**0**answers

82 views

### Unbalanced equipartitions

Let $K$ be a compact convex set in the plane.
Say that a perimeter-halving partition of $K$
is a partition of $K$
into two pieces by a chord (a segment with endpoints
on the boundary $\partial K$) ...

**3**

votes

**1**answer

63 views

### Counting a Modified Class of Standard Young Tableau

Let $\lambda=(\lambda_1,\cdots,\lambda_n)$ be a partition, with $|\lambda|:=N$. Attach an extra box to $\lambda$ to the right end of the $r$'th row. In coordinate form, the last box on row $r$ has ...

**13**

votes

**1**answer

804 views

### Wrong asymptotics of OEIS A000607?

Sequence A000607 in the Online Encyclopedia of Integer Sequences is the number of partitions of $n$ into prime parts. For example, there are $5$ partitions of $10$ into prime parts: $10 = 2 + 2 + 2 + ...

**7**

votes

**1**answer

180 views

### Generating function of $p(25n + 24)$

In a paper titled "RAMANUJAN’S UNPUBLISHED MANUSCRIPT ON THE PARTITION AND TAU FUNCTIONS WITH PROOFS AND COMMENTARY" by Bruce C. Berndt and Ken Ono, it is mentioned that Ramanujan derived the formula
...

**6**

votes

**1**answer

176 views

### Coloring summands of given n-partition with given weights of colors

Let $\lambda$ and $\sigma$ be partitions of $n$: $\lambda_1+\lambda_2+\cdots+\lambda_l=n$ and $\sigma_1+\sigma_2+\cdots+\sigma_s=n$
Let $M_{\lambda \sigma}$ be the number of ways to colour the parts ...

**6**

votes

**1**answer

274 views

### A variation on Bulgarian solitare

It appears that a variation on Bulgarian solitare has a fixed point regardless
of the starting $n$.
For example, let $n=69$, and consider this partition:
$$
(8,8,7,7,5,5,5,5,5,4,3,3,2,2)
$$
In ...

**9**

votes

**2**answers

287 views

### Faster formula to compute sum over partitions

Let $f$ be a function from the positive integers to the real numbers (or some ring...). Let
$$(\star) \quad F(n) = \sum_{n_1 \leq \cdots \leq n_j\atop n_1 + \cdots + n_j = n} f(n_1) \cdots f(n_j), $$
...

**3**

votes

**0**answers

135 views

### Asymptotic formula for restricted partition function

Let $p(n)$ be the partition function. Hardy and Ramanujan - and Uspensky, independently proved the asymptotic formula
$$(1) \quad p(n) \sim \frac1{4\sqrt{3}} \frac{e^{c_0\sqrt{n}}}{n} \text{ as } n ...

**1**

vote

**1**answer

136 views

### Sequences that represent different drawing of chords?

In combinatorics there are there are special kind of sequences, in which their terms represent the number of different ways that we can draw chords with some properties.
Actually my question is ...

**10**

votes

**1**answer

271 views

### Laurent polynomials associated to partitions and a $Q$-deformation of $\sigma(d)$

Let $\alpha \vdash d$ be a partition of $d$, i.e. $\alpha = (\alpha_1 \geq \alpha_2 \geq …\geq \alpha_l)$, where $\sum_k \alpha_k = d$. Define a Laurent polynomial in $Q$ as follows:
$$
P_\alpha(Q) = ...

**1**

vote

**0**answers

134 views

### How to prove this identity? (Perhaps related to partition) [closed]

How to prove this identity?
$ \sum_{n\ge 0} \frac{x^{n^2}}{(1-x)(1-x^2)\cdots(1-x^n)}= \frac{1}{\prod_{k \ge 0}(1-x^{5k+1})(1-x^{5k+4})}$
I will appreciate it a lot if a solution using method ...

**3**

votes

**1**answer

106 views

### Partitions whose smallest part is k

Is there a partition formula that counts the number of partitions of n whose smallest part is k ? I know there exists a smallest part formula (Andrews) but it does not answer my question.
Thank you

**0**

votes

**0**answers

81 views

### partition of an integer n into atmost k =O(log n) parts

Suppose you have a partition p of n into atmost k parts, say $$\{i_1, i_2, ..., i_j, ..., i_{k-1}\}$$
For example $\{1, 4\}$ is a partition of 10 into 3 parts (in this notation i am specifying the ...

**2**

votes

**1**answer

264 views

### An infinite product: combinatorial interpretation

It is an undergraduate exercise to show that the generating function for the sequence of unrestricted integer partitions $p(n)$ is the celebrated infinite product
...

**5**

votes

**3**answers

466 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 ...

**5**

votes

**1**answer

172 views

### The number of partitions between two fixed partitions

Given two partitions M and N, with $M_i \leq N_i$ for all $1\leq i\leq \max\{l(M),l(N)\}$. Is there a formula for the generating function: $$\sum_{\lambda: M_i\leq \lambda_i\leq N_i} ...

**11**

votes

**1**answer

725 views

### Number of standard Young tableaux with fixed corner entry

For a partition $\lambda=(\lambda_1\geq \lambda_2\geq\ldots\geq \lambda_k)$ of $n$, let the set of standard Young tableau of shape $\lambda$ be denoted by $SYT(\lambda)$ with boxes at $(i,j)$ denoted ...

**6**

votes

**2**answers

174 views

### Length of the longest chain in dominance order

If $\Pi_n$ is the set of partitions of $n$, then for $\lambda, \mu\in \Pi_n$ we say $\mu$ dominates $\lambda$ if $\sum\limits_{i=1}^k \lambda_i \leq \sum\limits_{i=1}^k \mu_i$ for all $k$. This gives ...

**4**

votes

**0**answers

168 views

### Dimension of a commuting nilpotent variety

Fix $k$ an algebraically closed field, $n$ a natural number, and $\lambda=(\lambda_1,\ldots,\lambda_m)$ a partition of $n$. Let $A$ be any $n\times n$ nilpotent matrix with entries in $k$ whose ...

**10**

votes

**2**answers

664 views

### Number of representations of an integer as an (arbitrary) sum of products

If $n$ is a positive integer, let $r(n)$ denote the number of representations of $n$ as a sum of products of pairs of positive integers. (Here, the order of the terms in the sum does not matter, but ...

**4**

votes

**0**answers

104 views

### Generating random weak k-bounded reverse plane partitions

Fix a partition $\lambda$. A weak reverse plane partition of shape $\lambda$ is a filling $0\leq \pi_{ij}$ of $\lambda$ with $\pi_{ij}\leq \pi_{kl}$ whenever $i\leq k$ or $j\leq l$. Note that ...

**3**

votes

**0**answers

79 views

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

I posted this question on MathStackexchange (http://math.stackexchange.com/questions/639878/asymptotics-of-partitions-in-at-most-n-parts-bounded-by-r) some time ago, but it did not receive any answer, ...

**4**

votes

**1**answer

285 views

### Combinatorial Technique Needed

The following problem is likely too special for MO.
However I have no clue how to deal with it, so I'll just try. Nevertheless
it is a combinatorial problem and a discussion about general methods
in ...

**4**

votes

**0**answers

260 views

### Unique Domino Tiling

Question: how does one enumerate all star-convex $2n$-vertex sublattices of the plane that have the unique domino-tiling property?
Definitions:
A subset S of the xy-plane is star-convex if there is ...

**0**

votes

**1**answer

225 views

### Terminology for a Partition of a Set which Includes Empty Sets

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 ...

**7**

votes

**3**answers

449 views

### Computing the lexicographic indices of integer partition

If we order all the partitions of a integer in a lexicographic order, how can we compute the position of each partition in this order without having to explicitly list all other partitions that ...

**2**

votes

**1**answer

308 views

### Number of 3-tuple partitions of a multiple of three which follow the triangle inequality

Given n=3t, t$\in \mathbb N$; let $\mathbb L_3$ be set of all distinct integer partitions of n having 3 parts; say $\lambda_1,\lambda_2,\lambda_3$ .
If I chose any one partition randomly from ...

**1**

vote

**1**answer

174 views

### Running the Greene-Nijenhuis Algorithm Backwards

This question is crossposted from math.stackexchange.com, where it remains unanswered.
Let $Y$ be a Young tableau of shape $\lambda:=(\lambda_1,\ldots,\lambda_n)$, where ...

**10**

votes

**3**answers

952 views

### A problem on a specific integer partition

Let $n$ be a positive integer, we consider partitions of the following form :
$$n = d^{2}_{1} + d^{2}_{2} + ... + d^{2}_{r}$$ such that :
$d_{i}\vert n$
$1=d_{1}<d_{2} \le d_{3} \le ... \le ...

**2**

votes

**1**answer

484 views

### Recurrence relation for coefficients of product of generating functions for partition numbers

It is well known that
$$Z(x,q) = \prod_{n=1}^\infty\frac{1}{(1-xq^n)} = \sum_{m=0}^\infty\sum_{k=0}^m p_{m,k}x^kq^m$$
is the generating function for the number $p_{m,k}$ of partitions of $m$ in ...

**4**

votes

**2**answers

364 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 ...

**3**

votes

**0**answers

65 views

### Between Cover and Partition

In a cover problem, there is a complex shape (e.g. a polygon), and we have to find a set of simpler shapes (e.g. squares or rectangles), such that their union is exactly equal to the complex shape.
A ...

**1**

vote

**1**answer

183 views

### Does the asymptotic formula for Partitions into parts <c exist?

A partition of $n$ is a weakly decreasing tuple of numbers $(\lambda_1,\lambda_2,\lambda_3,....\lambda_k)$ whose sum is $n.$ A natural problem studied is counting partitions whose summands ...

**3**

votes

**2**answers

147 views

### Databases for sequences indexed by partitions

Is there a database for sequences indexed by partitions similar to Sloane's OEIS? I mean, I am aware that in the OEIS there are some arrays indexed by partitions, but I feel as though most of such ...

**3**

votes

**1**answer

225 views

### bounded partitions and bounded signed partitions of integers

Define a bounded signed partition of length $m$ and of bounded height $h$ of an integer $n$ by a relation:
$$n = \pm a_{1} \pm a_{2} \pm a_{3} \pm \dots \pm a_{m}$$ where each $a_{i}$ is a integer in ...

**0**

votes

**0**answers

162 views

### Algorithm for load balancing during exchange between pairs

There are $P$ buckets each with $n_p (p \in 1..P)$ items. Let $a$ be the average number of items, so $a = \frac{\sum_{p=1}^P n_p}{P}$.
Now for each pair of buckets $i$ and $j$, we need to transfer ...