Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
John, it's only the counting problem that would provide a way to factor RSA numbers, and the efficient algorithms don't provide any way to get a count.
A probabilistic resolution would be to, say, assume the phase takes a value based on a circular Cauchy distribution; then you just have to take a map from the Moebius band to the disc, which is possible.
I could get useful information out of finite fields, probably. How much faster is that usually? Also the rings I'm working with have lots of symmetries and I think the letterplace correspondence gives even more in the actual ring being computed. How do you factor those out?
Yeah, the group algebra of $Z/2$ is basically your only option in characteristic different from $2$. In characteristic $2$ you have a couple options though.
I'm still waking up but I think such algebras are always both commutative and cocommutative, since the identity now has to be an anti-isomorphism, severely limiting your options.
My instinct is to say "no" because the standard embedding of the standard braid group depends on basically pushing out the other strands away from the necessary space to produce a braid for each group element