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 15021
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
0
votes
1
answer
256
views
ask for a simple bijective proof about oriented increasing binary trees
Give a bijective proof-----the number of oriented increasing binary trees on the vertex set
$\lbrace 1,2,\cdots,n\rbrace$ is the Eulerian number $E_n$(the number of alternating permutations in
$\math …
- 153
4
votes
1
answer
547
views
a simple combinatorial problems
what sequence $C=(c_1,\cdots,c_n)\in \mathbb{N}^n$ with $\sum ic_i=n$ maximizes the number of
$\omega\in\mathfrak{S}_n$ of type $C$? For instance,when $n=4$ the maximizing sequence is
$(1,0,1,0)$.
- 153