arXiv · 1409.4345
On the equivalence of types
Abstract
Types over a discrete valued field $(K,v)$ are computational objects that parameterize certain families of monic irreducible polynomials in $K_v[x]$, where $K_v$ is the completion of $K$ at $v$. Two types are considered to be equivalent if they encode the same family of prime polynomials. In this paper, we characterize the equivalence of types in terms of certain data supported by them.
Explore related subjects
Keep this discovery
Enric Nart. 2014-09-15. On the equivalence of types. https://arxiv.org/abs/1409.4345
Cite the original work for its findings. Save a collection to share your selection of sources.