93 reputation
5
bio website thi.informatik.uni-frankfurt.…
location Frankfurt
age
visits member for 2 years, 9 months
seen Mar 8 '13 at 16:40

Mar
8
comment Invertibility of a certain matrix indexed by the Hamming cube
Here is yet another elementary proof over GF(2).
Jan
28
revised Do sparse DAGs can have large min-cuts?
Corrected a typo in David's name.
Jan
27
revised Do sparse DAGs can have large min-cuts?
Added a link to the Kraft inequality
Jan
27
answered Do sparse DAGs can have large min-cuts?
Jan
27
revised Do sparse DAGs can have large min-cuts?
Removed useless remark, because long paths can be prolonged to st-paths
Jan
22
revised Do sparse DAGs can have large min-cuts?
A small correction in the expression for c_k(T_n)
Jan
21
revised Do sparse DAGs can have large min-cuts?
slight change in wording
Jan
21
revised Do sparse DAGs can have large min-cuts?
a misleading typo: divided by t, not times t
Jan
21
revised Do sparse DAGs can have large min-cuts?
1-cut is just a cut
Jan
21
asked Do sparse DAGs can have large min-cuts?
Dec
10
revised How local the property of “being a partition” is?
a "cosmetical" correction concerning the choice of the support S
Dec
10
revised How local the property of “being a partition” is?
added "for the case r=1"
Dec
10
revised How local the property of “being a partition” is?
removed incomparabilty constraint for supperts - it is not necessary
Dec
10
revised How local the property of “being a partition” is?
added the "EDIT"
Dec
9
awarded  Supporter
Dec
9
awarded  Scholar
Dec
9
accepted How local the property of “being a partition” is?
Dec
9
awarded  Student
Dec
9
awarded  Teacher
Dec
9
comment How local the property of “being a partition” is?
P.S. I edited my "answer-commment" accordingly: replaced $T(1)\geq n-k$ by $T(1)\geq n+1$. I also asked moderators to merge my two accounts (thanks for a hint!).