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 2225
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
4
votes
Equation in the conjugacy class of a free group
I don't think so. This boils down to finding a retraction from the group
$\langle a,b,c,d,q,r,t\rangle/\langle\langle tQabRcdT=QbaRdc\rangle\rangle$
to the subgroup $\langle a,b,c,d\rangle$. The White …
- 436
10
votes
2
answers
1k
views
How many functions are there from a set to itself, up to isomorphism?
What is known about the (asymptotic?) behaviour of the number of equivalence classes of functions $n\to n$, where two functions are considered equivalent if they differ by a permutation of $n$, i.e., …
- 39.9k