102 reputation
19
bio website
location Paris, Frace
age
visits member for 4 years, 3 months
seen Feb 22 '12 at 9:53
Independant mathematician. Working on fractal geometry.

Oct
15
awarded  Nice Question
Sep
24
awarded  Autobiographer
Apr
12
awarded  Popular Question
Nov
8
awarded  Nice Answer
Apr
26
awarded  Necromancer
Feb
7
awarded  Teacher
Oct
24
accepted How to characterize a Self-avoiding path.
Oct
13
comment How to characterize a Self-avoiding path.
Nice one ! :-) The absolute moves algorithm applied to relative moves.
Oct
13
comment How to characterize a Self-avoiding path.
I found a fractal pattern generated by the Fibonacci word, (by interpreting the sequence as a sequence of relative moves). The pattern looks clearly self-avoiding and I'd like to prove it. More generaly, I wonder how to characterise a loop, on a walk of relative moves, in a simple way.
Oct
12
comment How to characterize a Self-avoiding path.
Thanks for this interesting answer ! Your simplification rules seem correct and it surely is a valid way to determine if a sequence of relative moves is a loop or not. I haven't found any counter-example so far. Now, it isn't really what I could call a "simple rule". Maybe I am looking for something that does not exist ? Unless...anybody else has got an idea ?
Oct
11
comment How to characterize a Self-avoiding path.
Whow ! Lots of answers. I'm not sure I have the one I expect here. I need to read all this again. In the meantime, I edited again my question, because I am not precise enough. I hope this example makes things more clear.
Oct
11
revised How to characterize a Self-avoiding path.
added 532 characters in body
Oct
10
revised How to characterize a Self-avoiding path.
deleted 11 characters in body
Oct
9
awarded  Editor
Oct
9
comment How to characterize a Self-avoiding path.
Thanks. I have edited my question to precise the kind of rule I am looking for. It was not clear enough. Thanks.
Oct
9
revised How to characterize a Self-avoiding path.
added 420 characters in body
Oct
8
asked How to characterize a Self-avoiding path.
Sep
14
answered Proofs without words
Sep
10
accepted Hausdorff dimension of subsets of the Mandelbot set.
Sep
8
comment Hausdorff dimension of subsets of the Mandelbot set.
After all, the answer may be in the paper itself. Shishikura says : "Theorem A. H-dim(∂M) = 2. Moreover for any open set U which intersects ∂M, we have H-dim(∂M ∩ U) = 2." The way it is written seems strange to me. Why use this open set intersecting the boundary ? Does this answer the question ? Thanks.