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 18263
10
votes
How many triangulations of the genus $g$ surface on $n$ vertices?
I don't think a nice asymptotic formula like the one you've mentioned from Tutte's work is available for higher $g$ to the best of my understanding; it is entirely possible that someone who regularly …
- 15.5k
2
votes
Morse matching with 0-cells and (n-1)-cells
Based on the comments under the question, it seems that the real question is as follows:
Let $P$ be a finite poset whose maximal chains have length $\leq n+1$ for some strictly positive $n \in \ma …
- 15.5k
1
vote
Combinatorial Morse functions and random permutations
While the original question regarding permutations is interesting, it is not true that combinatorial Morse functions are hard to construct algorithmically on regular CW complexes. Much work has gone i …
- 15.5k