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 36972
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
0
votes
Inequality for hook numbers in Young diagrams
Denote coordinates of boxes in the Young diagram as $(i,j)$ for $i=1,\dots,\ell$ and $j=1,\dots,\lambda_i$. Consider the bijections $\varphi\colon(i,j)\mapsto(i,\lambda_i+1-j)$ and $\psi\colon(i,j)\m …
- 630
7
votes
To what extent is it possible to generalise a natural bijection between trees and $7$-tuples...
Let's dissect the case of binary trees first, and see why Fibonacci numbers/powers of two don't work in the same way.
A binary tree is either empty or made of two binary trees joined by a root, hence …
- 630