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 8991
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
8
votes
1
answer
422
views
(p,q) versus Glivenko-Cantelli
Say a collection of sets $\mathcal{F}$ satisfies the (p,q) property if whenever $\mathcal{G}\subseteq\mathcal{F}$ with $|\mathcal{G}|\geq p$, there is a $\mathcal{H}\subseteq\mathcal{G}$ with $|\mathc …
- 7,145
4
votes
Applications of idempotent ultrafilters
There are applications of idempotent ultrafilters (often under the name "idempotent member of the enveloping semigroup") to finding and classifying the structure of topological dynamical systems. Aus …