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 enumerative-combinatorics
Search options not deleted
user 18086
1
vote
Enumerating 0-1 finite boxes without null rays.
To extrapolate on Brendan McKay's comment for question one, here is a recurrence for $M(m,n)$. Though not exactly an inclusion exclusion argument (it's not hard to turn it into one), this essentially …
- 1,887
8
votes
Accepted
Is this similar to a known combinatorial identity?
Here is a solution to your warm up problem. It uses a few known elementary identities, and some short inductions for identities I didn't recognize. I also changed your notation slightly from $l$ to $k …
- 1,887