Reputation
651
Top tag
Next privilege 1,000 Rep.
Create new tags
Badges
4 11
Newest
 Yearling
Impact
~15k people reached

  • 0 posts edited
  • 0 helpful flags
  • 59 votes cast
Feb
21
asked Cactus graph representation of min-cuts — must the components be connected?
Feb
14
comment Name for a type of combinatorial design?
The extra requirements could vary.
Feb
14
comment Name for a type of combinatorial design?
I stated that there may be additional requirements on $\mathcal S'$, such as a minimum cardinality for its elements, but I want to be vague about those extra requirements.
Feb
14
asked Name for a type of combinatorial design?
Jan
24
awarded  Yearling
Dec
13
asked Approximation of binomial distribution with normal distribution
Dec
6
comment Simple and intuitive example for Zorns Lemma
I disagree that Zorn's lemma gives no procedure for finding the maximal element. Start with an element, find a bigger one, find a bigger one, and so on until you can't get any bigger and you are done. (This procedure may require a transfinite recursion to finish)
Nov
23
answered What is the CONCEPT when we speak of maximum entropy?
Nov
19
comment Number of increasing functions
This at least shows an upper bound, namely that the number of solutions is at most exponential.
Nov
19
asked Number of increasing functions
Nov
15
accepted Probability conditioned on disjunction of events
Nov
15
asked Probability conditioned on disjunction of events
Oct
17
answered Independent tests bound. (Chernoff/Azuma?)
Oct
10
answered In a graph, the vertices can be partitioned $V=V_1\cup V_2$ so that at most half of all edges run within each part?
Sep
28
asked maximum number of graph min-cuts, when edge-connectivity $c$ is odd
Sep
15
answered Decidability of model of set theory.
Aug
29
asked Martingale with reflecting barrier
Aug
18
answered 64 possible values - continuous or discrete?
Aug
17
answered Multiplicative group of integers modulo n definition issues
Aug
17
answered Master theorem solving