Reputation
521
Top tag
Next privilege 1,000 Rep.
Create new tags
Badges
4 21
Newest
 Curious
Impact
~7k people reached

  • 0 posts edited
  • 2 helpful flags
  • 190 votes cast
Oct
10
revised Natural order of rational trees?
added 6 characters in body
Oct
10
revised Natural order of rational trees?
added 8 characters in body
Oct
10
asked Natural order of rational trees?
Sep
12
awarded  Tumbleweed
Sep
5
revised Better compression for a positive DNF than via BDD
edited title
Sep
5
revised Better compression for a positive DNF than via BDD
added 37 characters in body
Sep
5
revised Better compression for a positive DNF than via BDD
added 4 characters in body
Sep
5
asked Better compression for a positive DNF than via BDD
Jul
20
revised Has a Dependent Type always a Type?
edited body
Jul
9
awarded  Benefactor
Jul
9
accepted Sum set fixpoint, how many iterations?
Jul
8
comment Sum set fixpoint, how many iterations?
Remark for the interested reader, if the lemma holds for sets S_i, it would also hold for integer intervals I_i, since an interval is only a special case of a set.
Jul
8
comment Sum set fixpoint, how many iterations?
Maybe an alternate proof could use monotonicity of Minkowsky sum, i.e. A subset B implies A + C subset B + C. Not sure. But I am already happy to see the question settled.
Jul
8
comment Sum set fixpoint, how many iterations?
Ok I guess the argument runs along the following for a x_i in S^0_i \ S^1_i there was anyway no (x_j)_j<>i, so when "deleting" x_i from S^0_i it will not reduce any of the S^0_j for j<>i.
Jul
8
comment Sum set fixpoint, how many iterations?
Was also hypothesizing once that the fixpoint is reached after maximal 1 iteration. Did not yet have time to produce a counter example. What is exactly the argument behind S^2_i = S^1_i in the general case?
Jul
6
revised Sum set fixpoint, how many iterations?
deleted 188 characters in body
Jul
6
comment Sum set fixpoint, how many iterations?
It looks the problem can be reduced to y_1 + .. + y_n + b = 0, by using y_i = a_i * x_i. We can also find sets T_i with y_i in T_i, by T_i = a_i * S_i. And then ask for fixpoint of (T_1,..,T_n).
Jul
4
comment Sum set fixpoint, how many iterations?
In the case of n=2 a simple geometric argument shows that l=<1 is sufficient. Right? But for n>2, is there also a fixed bound?
Jul
4
comment Sum set fixpoint, how many iterations?
I thought it is the other way around by construction of the mapping, i.e. S_i^k+1 subset S_i^k. But otherwise I agree, this is the worst case. But is it possible that it happens?
Jul
4
revised Sum set fixpoint, how many iterations?
deleted 9 characters in body