arXiv Analytics

Sign in

arXiv:2109.10130 [math.LO]AbstractReferencesReviewsResources

On binomials and explicit form of algebraic closure of some pseudofinite fields

Jakub Gismatullin, Katarzyna Tarasek

Published 2021-09-21Version 1

We give a criterion when a polynomial $x^n-g$ is irreducible over a pseudofinite field. As an application we give an explicit description of some pseudofinite fields of zero characteristic.

Categories: math.LO
Subjects: 12L10, 12F05, 03C20
Related articles: Most relevant | Search more
arXiv:1912.07223 [math.LO] (Published 2019-12-16)
Counting mod n in pseudofinite fields
arXiv:1404.4549 [math.LO] (Published 2014-04-17, updated 2014-09-11)
A Sheaf Model of the Algebraic Closure
arXiv:math/9809202 [math.LO] (Published 1998-09-15)
Universal graphs with forbidden subgraphs and algebraic closure

Links

Toolbox