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 120939
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
-1
votes
1
answer
154
views
Is this recurrent sequence decreasing?
Let $S_n$ be defined as $\frac{1}{n}\sum_{t=1}^{t=n} [px_t^2 - (p+q)x_t]$ where $x_t = 1-(1-p-q)^t$. We want to find the conditions on $p$ and $q$ such that $S_n$ is monotonically decreasing for all $ …
1
vote
0
answers
47
views
Find conditions for the following running average to be monotonically decreasing
Let $S_n$ be defined as $\frac{1}{n}\sum_{t=1}^{t=n} [px_t^2 - (p+q)x_t]$ where $x_t = 1-(1-p-q)^t$. We want to find the conditions on $p$ and $q$ such that $S_n$ is monotonically decreasing for all $ …
1
vote
1
answer
137
views
Number of distinct points in an n-dimensional tetrahedron
Consider an n-dimensional tetrahedron with $n+1$ vertices $\langle v_0, v_1, \dots,v_n\rangle$. $v_0$ is the origin while $v_i$ lies on $e_i$ (the $i^{th}$ coordinate axis) at a distance $D$ from the …