On the equivalence of types

Research output: Contribution to journalArticleResearchpeer-review

2 Citations (Scopus)


© 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.
Original languageEnglish
Pages (from-to)743-771
JournalJournal de Theorie des Nombres de Bordeaux
Issue number3
Publication statusPublished - 1 Jan 2016


  • Inductive valuation
  • MacLane chain
  • Newton polygon
  • Residual polynomial
  • Types


Dive into the research topics of 'On the equivalence of types'. Together they form a unique fingerprint.

Cite this