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 2811
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
4
votes
0
answers
77
views
Minimizing the cost of clustering a hypergraph
Background and notation:
Whenever I speak of a hypergraph $G$, I mean a pair of finite sets $V_G,E_G$ and a function $g\colon E_G\to\mathbb{P}(V_G)\;$ assigning each edge a subset of vertices.
If $ …
- 8,659
22
votes
2
answers
459
views
Is the order on repeated exponentiation the Dyck order?
The Catalan numbers $C_n$ count both
the Dyck paths of length $2n$, and
the ways to associate $n$ repeated applications of a binary operation.
We call the latter magma expressions; we will expl …
- 8,659