bio | website | csclub.uwaterloo.ca/~ebering |
---|---|---|
location | University of Waterloo | |
age | 25 | |
visits | member for | 2 years, 11 months |
seen | Apr 8 at 1:21 | |
stats | profile views | 275 |
I am currently a graduate student at the University of Illinois at Chicago.
My research interests focus on the geometry and topology of three manifolds. A broad type of question I find very interesting is "What geometric content do combinatorial invariants have and why?"
During the course of my undergraduate studies at the University of Waterloo I founded an undergraduate journal of mathematics, The Waterloo Mathematics Review, in collaboration with my peers.
Jul 26 |
comment |
Surgery diagram for the Seifert-Weber space
@IanAgol, there are two distinct isometry classes of 5-fold covers of the Whitehead link (Theorem 3 in this paper). |
Jul 25 |
awarded | Editor |
Jul 25 |
revised |
Surgery diagram for the Seifert-Weber space
added 866 characters in body |
Jul 18 |
asked | Surgery diagram for the Seifert-Weber space |
Jul 16 |
awarded | Autobiographer |
Oct 8 |
awarded | Citizen Patrol |
Jun 18 |
awarded | Favorite Question |
Mar 30 |
answered | Excellent uses of induction and recursion |
Feb 10 |
comment |
Comparables to Journal of Algebra, Journal of Pure and Applied Algebra
Thank you for including publishers in your reply, since that seems to be at the heart of this question. |
Jan 30 |
awarded | Notable Question |
Dec 27 |
awarded | Good Question |
Dec 23 |
awarded | Popular Question |
Dec 21 |
awarded | Nice Question |
Dec 21 |
asked | How to write popular mathematics well? |
Nov 11 |
awarded | Fanatic |
Jun 14 |
awarded | Enthusiast |
May 8 |
comment |
Computability and complexity of computing $|Hom(G,H)|$ for finitely presented groups G, H.
Thank you for the pointers. In the case where H is finite this is exponential in the number of generators of $G$, so in the particular case I mentioned above, the genus of the surface $S$ (if one uses the standard presentation for $pi(S)$). Is this the best that can be done classically? In the case where H is solvable the Matei algorithm Eric mentions gives another approach using group cohomology but the complexity isn't clear. |
May 7 |
awarded | Scholar |
May 7 |
accepted | Computability and complexity of computing $|Hom(G,H)|$ for finitely presented groups G, H. |
May 7 |
awarded | Supporter |