On the equivalence of types

Producció científica: Contribució a una revistaArticleRecercaAvaluat per experts

2 Cites (Scopus)

Resum

© Société Arithmétique de Bordeaux, 2016, tous droits réservés. Types over a discrete valued field (K, υ) are computational objects that parameterize certain families of monic irreducible polynomials in Kυ[x], where Kυ is the completion of K at υ. Two types are considered to be equivalent if they encode the same family of prime polynomials in Kυ [x]. In this paper, we find different characterizations of the equivalence of types in terms of certain data and operators associated with them.
Idioma originalEnglish
Pàgines (de-a)743-771
RevistaJournal de Theorie des Nombres de Bordeaux
Volum28
Número3
DOIs
Estat de la publicacióPublicada - 1 de gen. 2016

Fingerprint

Navegar pels temes de recerca de 'On the equivalence of types'. Junts formen un fingerprint únic.

Com citar-ho