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 16575
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
1
vote
2
answers
193
views
Counting hyperplane cuts vs. projections. Combinatorial identity
I have checked the following combinatorial identity for several cases and it seems to work. I would like to know if this is known or if there is a counter-example. Note, i is a given constant.
$$(i+d …
- 11
0
votes
Counting hyperplane cuts vs. projections. Combinatorial identity
I believe this can be proved combinatorially. Consider we are working in the $[n_1]\times ... \times [n_d]$ box. Consider attaching a variable to each coordinate. Then consider picking an $S=i_1*x_1,. …
- 11