560 reputation
411
bio website liafa.univ-paris-diderot.fr/…
location
age 28
visits member for 4 years, 11 months
seen Sep 2 at 11:37

Feb
17
comment What are the most attractive Turing undecidable problems in mathematics?
Note the recent preprint arxiv.org/abs/1312.6700 which improves these results. Undecidability now holds for five 3*3 matrices or two 15*15 matrices.
Jun
14
awarded  Nice Answer
May
27
awarded  Notable Question
Oct
20
awarded  Yearling
Jul
9
awarded  Good Answer
Apr
29
answered Equivalent subshifts
Apr
18
revised What's the difference between 2 and 3?
added 332 characters in body
Apr
18
answered What's the difference between 2 and 3?
Mar
22
comment Importance of Poincaré recurrence theorem? Any example?
The ergodic theorems can be seen as improvements of the Poincaré recurrence theorem, because they relate the time average with the space average. However, the Poincaré theorem is treated first because it is not hard to prove and it is very nice.
Mar
3
answered Computational software in Algebraic Topology?
Dec
5
answered More open problems
Oct
20
awarded  Yearling
Sep
21
comment Lecture notes by Thurston on tiling
I got the above PDF version from Shigeki Akiyama and I am very glad that putting it on my website is useful to some people. It would be great if more people did this because trying to find a paper that is neither on the internet or in libraries can be extremely frustrating!
Aug
20
awarded  Popular Question
Aug
20
revised Cutting a rectangle into an odd number of congruent pieces
deleted 2 characters in body
Jul
27
awarded  Self-Learner
Apr
8
answered Using TikZ in papers
Mar
4
comment Cutting a rectangle into an odd number of congruent pieces
Note that this solution yields an answer with $2k + 11$ pieces, for all $k \geq 0$.
Mar
2
awarded  Nice Question
Feb
15
awarded  Nice Answer