For a computable field F, the splitting set S is the set of polynomials p(X) ∈ F[X] which factor over F, and the root set R is the set of polynomials with roots in F. Work by Frohlich and Shepherdson ...
Hilbert’s 12th problem asked for novel analogues of the roots of unity, the building blocks for certain number systems. Now, over 100 years later, two mathematicians have produced them. Problems in ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback