All Questions
7 questions
1
vote
0
answers
170
views
A representation problem involving strict partition numbers
For each positive integer $n$, let $q(n)$ denote the number of ways to write $n$ as a sum of distinct positive integers. We call those $q(n)\ (n=1,2,3,\ldots)$ strict partition numbers.
The sequence $...
- 15.6k
4
votes
1
answer
314
views
Asymptotic for number of partitions of $n$ into $k$ squares, uniform in $n,k \to +\infty$
Let $p^{(s)}(n)$ be the number of ways of writing the positive integer $n$ as a sum of perfect $s$-powers, where the order does not matter. For example, $p^{(2)}(9) = 4$ since
$$9 = 1^2 + 1^2 + 1^2 + ...
- 41
11
votes
1
answer
494
views
Which of these sums appear most often?
Let $N=\{1,2,3,\ldots, n\}$.
We sum all the elements of every nonempty subset of $N$.
Which sum(s) appears most often? (Let's call this sum a champion).
Using a simple pigeonhole argument a champion ...
- 3,866
4
votes
2
answers
784
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 welcome....
- 2,384
4
votes
2
answers
763
views
How local the property of "being a partition" is?
Note: The problem is solved! See EDIT below.
The following question about integer partitions arose from a purely "practical" question: Does there exist better dynamic programming algorithms for the ...
- 213
10
votes
4
answers
1k
views
Binomial coefficient in Andrews' partition book
First of all, I think MathOverflow is a very great community to discuss math, either basic or advanced, and I'm glad to participate here. It's my first post, so I'm sorry if i did anything wrong, and ...
- 103
26
votes
2
answers
1k
views
Partitions to different parts not exceeding $n$
Consider the polynomial $(1+x)(1+x^2)\dots (1+x^n)=1+x+\dots+x^{n(n+1)/2}$, which enumerates subj. How to prove that it's coefficients increase up to $x^{n(n+1)/4}$ (and hence decrease after this)? Or ...
- 109k