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 119995
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
15
votes
Minimum number of $|\cdot|$ operations necessary to express $\max$
This is just a tighter analysis of the analysis from @GH from MO.
Let $f(n)$ be the minimum number of $|\cdot|$ operations to compute $\max(x_1, \ldots, x_n)$. Then $f(1)=0$ and for $n\geq 1$:
$$f(n)\ …
- 662
1
vote
0
answers
117
views
Upper bound $\sum_{i=1}^m \sum_{j=1}^n p_{i,j}(1-p_{i,j})$
Let
$$p_{i,j} = \frac{\sum_{l=i}^{i+j-1} {l-1 \choose i-1} {m+n-l \choose m-i}}{{m+n \choose n}}$$
I am interested in approximating/upper bounding the sum
$$ \sum_{i=1}^m \sum_{j=1}^n p_{i,j}(1-p_{i,j …
- 662
4
votes
2
answers
265
views
Intuition on inequality in proving a bound on the sum of squares of degrees of a graph
Given a simple connected graph $G$ with $n$ vertices and $m$ edges, let $d_1, ..., d_n$ denote the degrees of the vertices of the graph. In this very short paper, the author prove the inequality
$$\su …
- 662
25
votes
1
answer
1k
views
Expected height of a poset?
I am interested in any known results/empirical studies done on the average height of a poset with $N$ elements. Obviously this would depend on how that poset relation was randomly defined, however, at …
- 662