I could just do it in cuda, but having the coeffecients means less work for the machine, so faster: (there's also an analogue of the Hardy-Ramanujan circle method for modular forms of a quaternion argument, but that's getting ahead of myself) https://math.stackexchange.com/questions/2963628/computing-polynomials-whose-roots-are-the-vertices-of-4-polytopes-of-circumradiu …
-
-
Replying to @graveolens
Not all of the regular 4-polytopes are spherical. Do you mean just those that are? https://en.wikipedia.org/wiki/List_of_regular_polytopes_and_compounds#Spherical_3 ….
3 replies 0 retweets 0 likes
Replying to @theohonohan
just the platonics, in analogy with the cyclotomic polynomials. (1-z^600) is just a 600-gon because the complex numbers are algebraically complete. so you need a different kind of root, and the unit 3-sphere in quaternionic space has nice SO(4)ish properties to play with
5:03 PM - 21 Oct 2018
0 replies
0 retweets
1 like
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.