Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with co.combinatorics
Search options not deleted
user 35587
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
3
votes
0
answers
341
views
Conjecture relating differential equation and sum of a function over partitions
The following is an addition to A function from partitions to natural numbers - is it familiar?; the function $f(\lambda)$ as defined there, when summed over all partitions of n, gives an unexpected h …
- 136
1
vote
Statistics on partitions equidistributed with number of even parts
see http://OEIS.org/A002865 : "Number of partitions of n that do not contain 1 as a part".
- 136
2
votes
Sum over integer compositions
Your case p=1 seems to be http://oeis.org/A078812, just binomial(n+k-1, 2*k-1). See also the references to http://oeis.org/A078812.
The case p=-1 seems to be a variant of http://oeis.org/A048594, more …
- 136
6
votes
Accepted
Computing the lexicographic indices of integer partition
Lexicographic order seems more complex than reverse lexicographic order.
In reverse lex order, it becomes straightforward:
define p(n,k) as the number of partitions of n with largest part k (alternati …
- 136