Auto comment: topic has been updated by newbiemaster123 (previous revision, new revision, compare).

Auto comment: topic has been updated by newbiemaster123 (previous revision, new revision, compare).

I am Russian PhD student studying (you guessed it)... CodeForces. Actually I am not Russian, but I am Eastern European (and have the hair to prove it).

CP helped me a bit with my PhD, but most of the stuff I am doing is far too advanced for these silly problems to be of any use.

codelegend

Hi! I have recently defended my PhD thesis. My work is on discrete geometry.

For example, here is a joint work with my friends. I used C++ to try some configurations and find a right-equidistant sequence in $$$\mathbb{R}^3_{\infty}$$$, and then generalized the construction.

Or here is another problem related to the generalized kissing number -- that is, if the kissing number of a space is the maximal number of unit balls that can touch another unit ball while having zero-volume intersection, here we call these balls the first layer, then we add other balls that touch the first-level balls and call them the second level, and so on. The question is, what is the maximum number of balls if all of them are on first $$$k$$$ levels. I considered the problem on the plane, so if $$$k = 1$$$ then it is just the kissing number, that is, $$$6$$$; if $$$k = 2$$$ it is known to be $$$18$$$, and I proved that for $$$k = 3$$$ the answer is $$$36$$$. The optimality of hexagonal picture doesn't hold in general, though; there is another paper (in russian), I may upload it on arXiv as well in near future.

I am PhD of physics (Just received the degree last year), and my field is computational condensed matter.