bio | website | chaoxuprime.com |
---|---|---|
location | Urbana, IL | |
age | 25 | |
visits | member for | 4 years, 5 months |
seen | Nov 12 at 19:06 | |
stats | profile views | 228 |
PhD student in CS theory at UIUC.
I'm interested in algorithms, computational geometry, theory of computation and problem solving in general.
Oct 12 |
awarded | Nice Question |
Sep 24 |
asked | Induced subgraphs on a Laminar family of vertices with constant diameter |
Jul 16 |
awarded | Tumbleweed |
Jul 9 |
asked | Splitting lemma for digraph and preserving local rooted-edge connectivity? |
Jul 2 |
awarded | Curious |
Nov 16 |
awarded | Autobiographer |
Nov 9 |
accepted | Space of simple polygons on $n$-vertices as a set of points in $\mathbb{R}^{2n}$ |
Nov 9 |
comment |
Space of simple polygons on $n$-vertices as a set of points in $\mathbb{R}^{2n}$
I'm more interested in simple polygons. I did some googling with this pointer, and it seems there is nothing on moduli space of simple polygons. |
Nov 9 |
asked | Space of simple polygons on $n$-vertices as a set of points in $\mathbb{R}^{2n}$ |
Oct 7 |
awarded | Caucus |
Oct 5 |
comment |
Primitive elements in a free group of rank three
Is there a more elementary reference for the "monogon" and "bigon" condition for a single closed curve? The one in "Primer on mapping class groups" is a proof about pairs of simple closed curves. I'm working on an application that only consider this problem for the plane with holes, so it be nice to just learn the special case without going too deep into the theory. |
Jun 25 |
awarded | Yearling |
Dec 29 |
awarded | Popular Question |
Jul 24 |
comment |
How many integer partitions of a googol (10^100) into at most 60 parts
I was hoping to see some explanation since I thought this kind of computation is not tractable. This answer is right but doesn't offer any insight :(. |
Jul 18 |
comment |
Conjugacy problem for small braid groups
Yes, this would result a linear algorithm for conjugacy problem in $B_3$. |
Jul 17 |
asked | Conjugacy problem for small braid groups |
Jun 4 |
awarded | Popular Question |
Feb 17 |
accepted | Random parking problem on a probability distribution |
Jan 2 |
asked | Random parking problem on a probability distribution |
Jul 20 |
comment |
When is something too big to be a set?
Is this something related to things like "the class of all ordinals"? It lead to a paradox if it's defined as a set. |